A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices

Aminfar, AmirHossein; Darve, Eric

doi:10.1002/nme.5196

A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices

Journal Article · Tue Feb 02 00:00:00 EST 2016 · International Journal for Numerical Methods in Engineering

DOI:https://doi.org/10.1002/nme.5196· OSTI ID:1400731

^[1]; Darve, Eric ^[1]

Mechanical Engineering Department Stanford University 496 Lomita Mall, Room 104 Stanford 94305 CA USA

Summary

In this article, we introduce a fast, memory efficient and robust sparse preconditioner that is based on a direct factorization scheme for sparse matrices arising from the finite‐element discretization of elliptic partial differential equations. We use a fast (but approximate) multifrontal approach as a preconditioner and use an iterative scheme to achieve a desired accuracy. This approach combines the advantages of direct and iterative schemes to arrive at a fast, robust, and accurate preconditioner. We will show that this approach is faster (∼2×) and more memory efficient (∼2–3×) than a conventional direct multifrontal approach. Furthermore, we will demonstrate that this preconditioner is both faster and more effective than other preconditioners such as the incomplete LU preconditioner. Specific speedups depend on the matrix size and improve as the size of the matrix increases. The preconditioner can be applied to both structured and unstructured meshes in a similar manner. We build on our previous work and utilize the fact that dense frontal and update matrices, in the multifrontal algorithm, can be represented as hierarchically off‐diagonal low‐rank matrices. Using this idea, we replace all large dense matrix operations in the multifrontal elimination process with O ( N ) hierarchically off‐diagonal low‐rank operations to arrive at a faster and more memory efficient factorization scheme. We then use this direct factorization method at low accuracies as a preconditioner and apply it to various real‐life engineering test cases. Copyright © 2016 John Wiley & Sons, Ltd.

View Accepted Manuscript (Publisher)

Sponsoring Organization:: USDOE

OSTI ID:: 1400731

Journal Information:: International Journal for Numerical Methods in Engineering, Journal Name: International Journal for Numerical Methods in Engineering Journal Issue: 6 Vol. 107; ISSN 0029-5981

Publisher:: Wiley Blackwell (John Wiley & Sons)Copyright Statement

Country of Publication:: United Kingdom

Language:: English

References (24)

ILUT: A dual threshold incomplete LU factorization Saad, Yousef Numerical Linear Algebra with Applications, Vol. 1, Issue 4 https://doi.org/10.1002/nla.1680010405	journal	July 1994
FETI-DP, BDDC, and block Cholesky methods Li, Jing; Widlund, Olof B. International Journal for Numerical Methods in Engineering, Vol. 66, Issue 2 https://doi.org/10.1002/nme.1553	journal	January 2006
FETI-DP: a dual-primal unified FETI method?part I: A faster alternative to the two-level FETI method Farhat, Charbel; Lesoinne, Michel; LeTallec, Patrick International Journal for Numerical Methods in Engineering, Vol. 50, Issue 7 https://doi.org/10.1002/nme.76	journal	January 2001
Adaptive Sampling and Fast Low-Rank Matrix Approximation Deshpande, Amit; Vempala, Santosh Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques https://doi.org/10.1007/11830924_28	book	January 2006
Algorithms to Solve Hierarchically Semi-separable Systems Sheng, Zhifeng; Dewilde, Patrick; Chandrasekaran, Shivkumar System Theory, the Schur Algorithm and Multidimensional Analysis https://doi.org/10.1007/978-3-7643-8137-0_5	book	January 2007
Data-sparse Approximation by Adaptive ℋ2-Matrices Hackbusch, W.; Börm, S. Computing, Vol. 69, Issue 1, p. 1-35 https://doi.org/10.1007/s00607-002-1450-4	journal	September 2002
Construction and Arithmetics of H -Matrices Grasedyck, Lars; Hackbusch, Wolfgang Computing, Vol. 70, Issue 4 https://doi.org/10.1007/s00607-003-0019-1	journal	August 2003
A Sparse Matrix Arithmetic Based on $\Cal H$ -Matrices. Part I: Introduction to ${\Cal H}$ -Matrices Hackbusch, W. Computing, Vol. 62, Issue 2 https://doi.org/10.1007/s006070050015	journal	April 1999
An $$\mathcal O (N \log N)$$ O ( N log N ) Fast Direct Solver for Partial Hierarchically Semi-Separable Matrices: With Application to Radial Basis Function Interpolation Ambikasaran, Sivaram; Darve, Eric Journal of Scientific Computing, Vol. 57, Issue 3 https://doi.org/10.1007/s10915-013-9714-z	journal	April 2013
A theory of pseudoskeleton approximations Goreinov, S. A.; Tyrtyshnikov, E. E.; Zamarashkin, N. L. Linear Algebra and its Applications, Vol. 261, Issue 1-3 https://doi.org/10.1016/S0024-3795(96)00301-1	journal	August 1997
A fast direct solver for elliptic problems on general meshes in 2D Schmitz, Phillip G.; Ying, Lexing Journal of Computational Physics, Vol. 231, Issue 4 https://doi.org/10.1016/j.jcp.2011.10.013	journal	February 2012
A fast block low-rank dense solver with applications to finite-element matrices Aminfar, AmirHossein; Ambikasaran, Sivaram; Darve, Eric Journal of Computational Physics, Vol. 304 https://doi.org/10.1016/j.jcp.2015.10.012	journal	January 2016
A Fast Solver for HSS Representations via Sparse Matrices Chandrasekaran, S.; Dewilde, P.; Gu, M. SIAM Journal on Matrix Analysis and Applications, Vol. 29, Issue 1 https://doi.org/10.1137/050639028	journal	January 2007
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems Saad, Youcef; Schultz, Martin H. SIAM Journal on Scientific and Statistical Computing, Vol. 7, Issue 3 https://doi.org/10.1137/0907058	journal	July 1986
Superfast Multifrontal Method for Large Structured Linear Systems of Equations Xia, Jianlin; Chandrasekaran, Shivkumar; Gu, Ming SIAM Journal on Matrix Analysis and Applications, Vol. 31, Issue 3 https://doi.org/10.1137/09074543X	journal	January 2010
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions Halko, N.; Martinsson, P. G.; Tropp, J. A. SIAM Review, Vol. 53, Issue 2 https://doi.org/10.1137/090771806	journal	January 2011
The Multifrontal Method for Sparse Matrix Solution: Theory and Practice Liu, Joseph W. H. SIAM Review, Vol. 34, Issue 1 https://doi.org/10.1137/1034004	journal	March 1992
Efficient Structured Multifrontal Factorization for General Large Sparse Matrices Xia, Jianlin SIAM Journal on Scientific Computing, Vol. 35, Issue 2 https://doi.org/10.1137/120867032	journal	January 2013
Randomized Sparse Direct Solvers Xia, Jianlin SIAM Journal on Matrix Analysis and Applications, Vol. 34, Issue 1 https://doi.org/10.1137/12087116X	journal	January 2013
Improving Multifrontal Methods by Means of Block Low-Rank Representations Amestoy, Patrick; Ashcraft, Cleve; Boiteau, Olivier SIAM Journal on Scientific Computing, Vol. 37, Issue 3 https://doi.org/10.1137/120903476	journal	January 2015
A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations Chandrasekaran, S.; Gu, M.; Pals, T. SIAM Journal on Matrix Analysis and Applications, Vol. 28, Issue 3 https://doi.org/10.1137/S0895479803436652	journal	January 2006
Fast monte-carlo algorithms for finding low-rank approximations Frieze, Alan; Kannan, Ravi; Vempala, Santosh Journal of the ACM, Vol. 51, Issue 6 https://doi.org/10.1145/1039488.1039494	journal	November 2004
Separators for sphere-packings and nearest neighbor graphs Miller, Gary L.; Teng, Shang-Hua; Thurston, William Journal of the ACM, Vol. 44, Issue 1 https://doi.org/10.1145/256292.256294	journal	January 1997
Methods of conjugate gradients for solving linear systems Hestenes, M. R.; Stiefel, E. Journal of Research of the National Bureau of Standards, Vol. 49, Issue 6 https://doi.org/10.6028/jres.049.044	journal	December 1952

Similar Records

An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling

Journal Article · Wed Oct 26 20:00:00 EDT 2016 · SIAM Journal on Scientific Computing · OSTI ID:1378736

Sparse Approximate Multifrontal Factorization with Composite Compression Methods

Journal Article · Mon Sep 18 20:00:00 EDT 2023 · ACM Transactions on Mathematical Software · OSTI ID:2281210

A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices

Citation Formats

References (24)

Similar Records

Related Subjects