Improving the numerical stability and the performance of a parallel sparse solver

DOI10.1016/0898-1221(95)00175-XzbMath0835.65051OpenAlexW1980303711MaRDI QIDQ1905913

Yanyan Li

Publication date: 13 February 1996

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(95)00175-x

zbMATH Keywords

stabilitynumerical resultsparallel computationGaussian eliminationsparse matrixfactorizationblock algorithmcoarse-grain parallelismspeed-updrop-tolerancegeneral sparsitypreliminary reorderingsparse systems of linear algebraic equations

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (max. 100)

Solving sparse linear least-squares problems on some supercomputers by using large dense blocks

Uses Software

• Harwell-Boeing sparse matrix collection

Cites Work

• Unnamed Item
• Unnamed Item
• A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
• A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
• Condition Number Estimators in a Sparse Matrix Software
• Sparse matrix test problems
• Reinversion with the preassigned pivot procedure

This page was built for publication: Improving the numerical stability and the performance of a parallel sparse solver