Abstract
The memory usage of sparse direct solvers can be the bottleneck to solve large-scale problems. This paper describes a first implementation of an out-of-core extension to a parallel multifrontal solver (MUMPS). We show that larger problems can be solved on limited-memory machines with reasonable performance, and we illustrate the behaviour of our parallel out-of-core factorization. Then we use simulations to discuss how our algorithms can be modified to solve much larger problems. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Agullo, E., Guermouche, A., & L’Excellent, J. Y. (2006). A preliminary out-of-core extension of a parallel multifrontal solver. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4128 LNCS, pp. 1053–1063). Springer Verlag. https://doi.org/10.1007/11823285_111
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
