Constructing memory-minimizing schedules for multifrontal methods

DOI10.1145/1132973.1132975MaRDI QIDQ3549166zbMATH OpenOpenAlexWikidataFDO

Authors Abdou Guermouche, Jean-Yves L'Excellent

Publication date 21 December 2008

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

Full work available at URL https://doi.org/10.1145/1132973.1132975

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Recommendations

• Robust memory-aware mappings for parallel multifrontal factorizations
• scientific article; zbMATH DE number 6001261
• A parallel multifrontal algorithm and its implementation
• Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver
• Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
• The memory gradient methods for unconstrained optimization
• A new conjugate gradient method with an efficient memory structure
• A Family of Supermemory Gradient Projection Methods for Constrained Optimization
• scientific article; zbMATH DE number 1953309

Cited in

(3)

• Robust memory-aware mappings for parallel multifrontal factorizations
• Logarithmic barriers for sparse matrix cones
• A survey of direct methods for sparse linear systems

This page was built for publication: Constructing memory-minimizing schedules for multifrontal methods

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