Algorithms for sparse Gaussian elimination with partial pivoting

DOI10.1145/356502.356494MaRDI QIDQ4181879zbMATH OpenOpenAlexFDO

Authors Andrew H. Sherman

Publication date 1978

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2027/uiuo.ark:/13960/t2t456j0q

zbMATH Keywords

AlgorithmsGaussian EliminationNumerical Solution of Linear SystemsNumerical StabilityPartial PivotingSparse MatrixTest Problems

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to linear algebra (15-04) Linear equations (linear algebraic aspects) (15A06) Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms and problem complexity (68Q25)

Cited in

(3)

• Bibliography on the evaluation of numerical software
• Maintaining LU factors of a general sparse matrix
• A survey of direct methods for sparse linear systems

This page was built for publication: Algorithms for sparse Gaussian elimination with partial pivoting

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