Analysis of the solution phase of a parallel multifrontal approach

DOI10.1016/j.parco.2009.06.001zbMath1208.68234OpenAlexW1995349980MaRDI QIDQ991063

Tz. Slavova, Abdou Guermouche, Patrick R. Amestoy, Iain S. Duff

Publication date: 2 September 2010

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.parco.2009.06.001

zbMATH Keywords

performanceout-of-coresparse linear algebradistributed memory computationmultifrontal approachMUMPS

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (3)

High scalable non-overlapping domain decomposition method using a direct method for finite element analysis ⋮ A survey of direct methods for sparse linear systems ⋮ Analysis of the solution phase of a parallel multifrontal approach

Uses Software

• MUMPS
• TAUCS
• HSL_MA77
• Fortran_Virtual_Memory

Cites Work

• Unnamed Item
• A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
• Analysis of the solution phase of a parallel multifrontal approach
• Multifrontal parallel distributed symmetric and unsymmetric solvers
• An out-of-core sparse Cholesky solver
• The Multifrontal Solution of Unsymmetric Sets of Linear Equations
• The Role of Elimination Trees in Sparse Factorization
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• Efficient Methods for Out-of-Core Sparse Cholesky Factorization
• The design and implementation of a new out-of-core sparse cholesky factorization method

This page was built for publication: Analysis of the solution phase of a parallel multifrontal approach