File: Contents.m

package info (click to toggle)
suitesparse 1%3A7.10.1%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 254,920 kB
  • sloc: ansic: 1,134,743; cpp: 46,133; makefile: 4,875; fortran: 2,087; java: 1,826; sh: 996; ruby: 725; python: 495; asm: 371; sed: 166; awk: 44
file content (17 lines) | stat: -rw-r--r-- 830 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
% 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)

% SPQR, Copyright (c) 2008-2022, Timothy A Davis. All Rights Reserved.
% SPDX-License-Identifier: GPL-2.0+