Analysis and comparison of two general sparse solvers for distributed memory computers

DOI10.1145/504210.504212zbMath1072.65035OpenAlexW2100657871WikidataQ113309783 ScholiaQ113309783MaRDI QIDQ5461024

No author found.

Publication date: 21 July 2005

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

Full work available at URL: http://purl.org/net/epubs/work/29533

zbMATH Keywords

performancenumerical stabilitypreorderingsMUMPSlarge sparse sets of linear equationslarge-scale distributed-memory computers

Mathematics Subject Classification ID

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

Related Items

A multiphase compressible model for the simulation of multiphase flows ⋮ The cost of continuity: a study of the performance of isogeometric finite elements using direct solvers ⋮ A survey of direct methods for sparse linear systems

Uses Software

• SuperLU
• MUMPS
• METIS
• SPOOLES
• WSMP
• Harwell-Boeing sparse matrix collection
• VAMPIR