On the evaluation of general sparse hybrid linear solvers

DOI10.1002/NLA.2469MaRDI QIDQ5887277zbMATH OpenOpenAlexFDO

Authors M. Serdar Celebi

Publication date 18 April 2023

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.2469

zbMATH Keywords

additive Schwarzdirect methodshigh performance computingHIPSiterative methodsLU factorizationMaphysparallel sparse hybrid linear solverpartitioningPDSLinpreconditionerspreconditioningscalabilitySchur complementsparse matrixSuperLU\(\_\)DIST

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Recommendations

• A domain-decomposing parallel sparse linear system solver
• Analysis and comparison of two general sparse solvers for distributed memory computers
• A hybrid parallel algorithm for large sparse linear systems
• A tearing-based hybrid parallel sparse linear system solver
• New parallel sparse direct solvers for multicore architectures

Cited in

(1)

• FastAGMGar: an aggregation-based algebraic multigrid method

This page was built for publication: On the evaluation of general sparse hybrid linear solvers

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