SciPy (Python) — wrappers and algorithms (dense/sparse)
From MaRDI portal
Cited in
(15)- BiCGSTAB (stabilized BiCG) for improved smooth convergence on nonsymmetric systems
- Cholesky (LL^T) factorization for SPD matrices
- Gaussian/LU factorization specialized to band-diagonal matrices
- LU decomposition with (partial) pivoting for solving Ax=b and computing determinants
- QR decomposition (Householder/Givens) for least-squares and rank-revealing factorizations
- Conjugate Gradient (CG) for sparse symmetric positive definite systems
- Generalized Minimal Residual
- Björck-Pereyra O(n^2) algorithm for solving Vandermonde systems
- Levinson-Durbin recursion for Toeplitz systems
- Thomas algorithm (tridiagonal matrix algorithm) for O(n) solution of tridiagonal systems
- Classical Gaussian elimination with pivoting plus back-substitution for dense linear systems
- Iterative refinement (iterative improvement) to enhance solutions of direct factorizations
- BiConjugate Gradient (BiCG) for nonsymmetric sparse linear systems
- Cyclic tridiagonal solver via Sherman-Morrison rank-1 update
- Singular Value Decomposition (SVD) for least-squares, pseudoinverses, and low-rank analysis
This page was built for software: SciPy (Python) — wrappers and algorithms (dense/sparse)
