Crate rsparse

rsparse

A collection of direct methods for solving sparse linear systems implemented in Rust. This library implements the algorithms described in “Direct Methods For Sparse Linear Systems by Dr. Timothy A. Davis.”

MIT License Copyright (c) 2023 Ricard Lado

Modules

data

Data structures for rsparse

Functions

add

C = alphaA + betaB

gaxpy

gaxpy: Generalized A times x plus y r = A*x+y

lsolve

Solves a lower triangular system. Solves L*x=b. Where x and b are dense.

ltsolve

Solves L’*x=b. Where x and b are dense.

lu

L,U,Pinv = lu(A, [Q lnz unz]). lnz and unz can be guess

lusol

x=A\b where A is unsymmetric; b (dense) overwritten with solution

multiply

C = A*B

norm

Computes the 1-norm of a sparse matrix

sqr

Symbolic analysis for QR or LU

transpose

C = A’

usolve

Solves an upper triangular system. Solves U*x=b.

utsolve

Solve U’x=b where x and b are dense.