Algorithms for sparse Gaussian elimination with partial pivoting

DOI10.1145/356502.356494zbMath0398.65010OpenAlexW2063628209MaRDI QIDQ4181879

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

AlgorithmsSparse MatrixTest ProblemsNumerical StabilityGaussian EliminationNumerical Solution of Linear SystemsPartial Pivoting

Mathematics Subject Classification ID

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

Related Items

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