An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems

DOI10.1137/0906028MaRDI QIDQ3685075zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

Cholesky factorizationcomparisonfill in boundsGaussian eliminationLU decompositionpartial pivoting

Mathematics Subject Classification ID

Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Recommendations

• Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
• Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
• scientific article; zbMATH DE number 2065130
• Parallel sparse Gaussian elimination with partial pivoting
• A Supernodal Approach to Sparse Partial Pivoting

Cited in

(21)

• Quasi-Newton methods with factorization scaling for solving sparse nonlinear systems of equations
• 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
• Evaluation of the efficiency of the partially solving method (PSM) in comparison with the Gaussian elimination method
• LU-decomposition and numerical structure for solving large sparse nonsymmetric linear systems
• A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
• Improving an interior-point approach for large block-angular problems by hybrid preconditioners
• A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over F₂
• Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
• Sparse Gaussian Elimination Modulo p: An Update
• State-of-the-art sparse direct solvers
• Combinatorial Aspects in Sparse Elimination Methods
• scientific article; zbMATH DE number 3907653 (Why is no real title available?)
• Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
• The Impact of Hardware Gather/Scatter on Sparse Gaussian Elimination
• Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
• Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
• scientific article; zbMATH DE number 2160983 (Why is no real title available?)
• Cost-optimal Gaussian Elimination Algorithm on RCC-FULL
• A survey of direct methods for sparse linear systems
• Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods

Describes a project that uses

Uses Software

• MC21A

This page was built for publication: An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3685075)