Numeric.LinearAlgebra.Sparse

Linear solvers

Iterative methods

(<\>)

Moore-Penrose pseudoinverse

pinv

Direct methods

luSolve

Forward substitution

triLowerSolve

Backward substitution

triUpperSolve

Eigensolvers

eigsQR

eigsArnoldi

Matrix factorization algorithms

QR

qr

LU

lu

Cholesky

chol

Arnoldi iteration

arnoldi

Utilities

Givens' rotation

givens

Condition number

conditionNumberSM

Householder reflection

hhRefl

Matrix partitioning

diagPartitions

Creation and conversion of sparse data

SpVector

Sparse

fromListSV

toListSV

Dense

" from a list of entries

vr

vc

" from/to a Vector of entries

fromVector

toVectorDense

" having constant elements

constv

SpMatrix

fromListSM

toListSM

Packing and unpacking, rows or columns of a sparse matrix

", using lists as container

fromRowsL

toRowsL

fromColsL

toColsL

", using Vector as container

fromRowsV

fromColsV

Block operations

(-=-)

(-||-)

fromBlocksDiag

Special matrices

eye

mkDiagonal

mkSubDiagonal

permutationSM

permutPairsSM

Predicates

isOrthogonalSM

isDiagonalSM

Manipulation of sparse data

filterSV

ifilterSV

Sparsity-related predicates

nearZero

nearOne

isNz

Operators

Scaling

(.*)

(./)

Inner product

(<.>)

Matrix-vector product

(#>)

(<#)

Matrix-matrix product

(##)

(#^#)

(##^)

Sparsifying matrix-matrix product

(#~#)

(#~^#)

(#~#^)

Vector outer product

(><)

Common operations

dim

nnz

spy

Vector spaces

cvx

Norms and normalization

norm

norm2

norm2'

normalize

normalize2

normalize2'

norm1

hilbertDistSq

Matrix-related

transpose

trace

normFrobenius

Pretty-printing

prd

prd0

Iteration combinators

untilConvergedG0

untilConvergedG

untilConvergedGM

modifyInspectGuarded

modifyInspectGuardedM

data IterationConfig a b

modifyUntil

modifyUntilM

Internal

linSolve0

data LinSolveMethod

Exceptions

data PartialFunctionError

data InputError

data OutOfBoundsIndexError i

data OperandSizeMismatch

data MatrixException i

data IterationException a