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

DOI10.1007/978-3-319-17353-5_14zbMATH Open1514.65047MaRDI QIDQ6487405FDOQ6487405

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

Publication date: 9 December 2022

Recommendations

• A distributed-memory randomized structured multifrontal method for sparse direct solutions
• A fully asynchronous multifrontal solver using distributed dynamic scheduling
• Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver
• Publication:4860187
• Publication:4860193
• A shared- and distributed-memory parallel general sparse direct solver
• A sparse nonsymmetric eigensolver for distributed memory architectures
• scientific article; zbMATH DE number 434527

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Cites Work

• CALU: A communication optimal LU factorization algorithm
• A fully asynchronous multifrontal solver using distributed dynamic scheduling
• Title not available (Why is that?)
• The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
• Title not available (Why is that?)
• The Multifrontal Solution of Unsymmetric Sets of Linear Equations
• Locality of Reference in LU Decomposition with Partial Pivoting

Cited In (2)

• Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems
• Design and implementation of a parallel Markowitz threshold algorithm

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

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