An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
From MaRDI portal
Publication:3685075
DOI10.1137/0906028zbMath0568.65017OpenAlexW1990474090MaRDI QIDQ3685075
No author found.
Publication date: 1985
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0906028
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A survey of the advances in the exploitation of the sparsity in the solution of large problems, Solving large and sparse linear least-squares problems by conjugate gradient algorithms, Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods, Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods, Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods, State-of-the-Art Sparse Direct Solvers, A survey of direct methods for sparse linear systems, A new class of preconditioners for large-scale linear systems from interior point methods for linear programming, Combinatorial Aspects in Sparse Elimination Methods, Improving an interior-point approach for large block-angular problems by hybrid preconditioners, Quasi-Newton methods with factorization scaling for solving sparse nonlinear systems of equations
Uses Software
