File: Contents.m

package info (click to toggle)
suitesparse 1%3A4.5.4-1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 74,020 kB
  • ctags: 12,092
  • sloc: ansic: 146,148; cpp: 17,776; makefile: 5,777; fortran: 1,927; java: 1,846; csh: 749; ruby: 725; perl: 225; sed: 164; awk: 27; sh: 18
file content (16 lines) | stat: -rw-r--r-- 791 bytes parent folder | download | duplicates (5)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
% SuiteSparseQR : a multifrontal, multithreaded, rank-revealing sparse QR
% factorization method.  Works for both real and complex sparse matrices.
%
% Files
%   spqr         - multithreaded multifrontal rank-revealing sparse QR.
%   spqr_demo    - short demo of SuiteSparseQR 
%   spqr_install - compile and install SuiteSparseQR
%   spqr_make    - compiles the SuiteSparseQR mexFunctions
%   spqr_qmult   - computes Q'*X, Q*X, X*Q', or X*Q with Q in Householder form.
%   spqr_solve   - solves a linear system or least squares problem via QR factorization.
%   spqr_singletons - finds the singleton permutation of a sparse matrix A.
%
% Example:
%   x = spqr_solve (A,b) ;  % solves a least-squares problem (like x=A\b)

% Copyright 2008-2012, Timothy A. Davis, http://www.suitesparse.com