Modeling 1D Distributed-Memory Dense Kernels for an Asynchronous Multifrontal Sparse Solver

DOI10.1007/978-3-319-17353-5_14zbMath1514.65047MaRDI QIDQ6487405

François-Henry Rouet, Wissam M. Sid-Lakhdar, Jean-Yves L'Excellent, Patrick R. Amestoy

Publication date: 9 December 2022

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Related Items (2)

Design and Implementation of a Parallel Markowitz Threshold Algorithm ⋮ Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems

Cites Work

• Unnamed Item
• Unnamed Item
• A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
• The Multifrontal Solution of Unsymmetric Sets of Linear Equations
• CALU: A Communication Optimal LU Factorization Algorithm
• The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
• Locality of Reference in LU Decomposition with Partial Pivoting

This page was built for publication: Modeling 1D Distributed-Memory Dense Kernels for an Asynchronous Multifrontal Sparse Solver