Chapitre 2. Sparse functions

Table des matières

sp_cgs — Use a conjugate gradient for a normal equation to solve the system A.x = b
sp_cgs — Use a conjugate gradient to solve the system A.x = b
sp_lu — Performs a Cholesky decomposition on a sparse matrix
sp_lu — Performs an incomplete Cholesky decomposition on a sparse matrix
sp_cgs — Use a Cholesky decomposition to solve the system A.x = b
sp_cgs — Use a generalized minimum residual algorithm of Saad & Schultz to solve the system A.x = b
sp_lu — Performs a LU decomposition on a sparse matrix
sp_lu — Performs an incomplete LU decomposition on a sparse matrix
sp_cgs — Use a LU decomposition to solve the system A.x = b
sp_cgs — Use a modified generalized conjugate residual algorithm to solve the system A.x = b