DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

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

Abstract

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 operationsmore » 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.« less

Authors:
ORCiD logo [1];  [1]
  1. Mechanical Engineering Department Stanford University 496 Lomita Mall, Room 104 Stanford 94305 CA USA
Publication Date:
Sponsoring Org.:
USDOE
OSTI Identifier:
1400731
Grant/Contract Number:  
NA0002373-1
Resource Type:
Publisher's Accepted Manuscript
Journal Name:
International Journal for Numerical Methods in Engineering
Additional Journal Information:
Journal Name: International Journal for Numerical Methods in Engineering Journal Volume: 107 Journal Issue: 6; Journal ID: ISSN 0029-5981
Publisher:
Wiley Blackwell (John Wiley & Sons)
Country of Publication:
United Kingdom
Language:
English

Citation Formats

Aminfar, AmirHossein, and Darve, Eric. A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices. United Kingdom: N. p., 2016. Web. doi:10.1002/nme.5196.
Aminfar, AmirHossein, & Darve, Eric. A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices. United Kingdom. https://doi.org/10.1002/nme.5196
Aminfar, AmirHossein, and Darve, Eric. Tue . "A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices". United Kingdom. https://doi.org/10.1002/nme.5196.
@article{osti_1400731,
title = {A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices},
author = {Aminfar, AmirHossein and Darve, Eric},
abstractNote = {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.},
doi = {10.1002/nme.5196},
journal = {International Journal for Numerical Methods in Engineering},
number = 6,
volume = 107,
place = {United Kingdom},
year = {Tue Feb 02 00:00:00 EST 2016},
month = {Tue Feb 02 00:00:00 EST 2016}
}

Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record
https://doi.org/10.1002/nme.5196

Citation Metrics:
Cited by: 13 works
Citation information provided by
Web of Science

Save / Share:

Works referenced in this record:

A fast direct solver for elliptic problems on general meshes in 2D
journal, February 2012


A Fast Solver for HSS Representations via Sparse Matrices
journal, January 2007

  • Chandrasekaran, S.; Dewilde, P.; Gu, M.
  • SIAM Journal on Matrix Analysis and Applications, Vol. 29, Issue 1
  • DOI: 10.1137/050639028

ILUT: A dual threshold incomplete LU factorization
journal, July 1994


GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
journal, July 1986

  • Saad, Youcef; Schultz, Martin H.
  • SIAM Journal on Scientific and Statistical Computing, Vol. 7, Issue 3
  • DOI: 10.1137/0907058

Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions
journal, January 2011

  • Halko, N.; Martinsson, P. G.; Tropp, J. A.
  • SIAM Review, Vol. 53, Issue 2
  • DOI: 10.1137/090771806

FETI-DP: a dual-primal unified FETI method?part I: A faster alternative to the two-level FETI method
journal, January 2001

  • Farhat, Charbel; Lesoinne, Michel; LeTallec, Patrick
  • International Journal for Numerical Methods in Engineering, Vol. 50, Issue 7
  • DOI: 10.1002/nme.76

FETI-DP, BDDC, and block Cholesky methods
journal, January 2006

  • Li, Jing; Widlund, Olof B.
  • International Journal for Numerical Methods in Engineering, Vol. 66, Issue 2
  • DOI: 10.1002/nme.1553

A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
journal, January 2006

  • Chandrasekaran, S.; Gu, M.; Pals, T.
  • SIAM Journal on Matrix Analysis and Applications, Vol. 28, Issue 3
  • DOI: 10.1137/S0895479803436652

Construction and Arithmetics of H -Matrices
journal, August 2003


Data-sparse Approximation by Adaptive ℋ2-Matrices
journal, September 2002


Improving Multifrontal Methods by Means of Block Low-Rank Representations
journal, January 2015

  • Amestoy, Patrick; Ashcraft, Cleve; Boiteau, Olivier
  • SIAM Journal on Scientific Computing, Vol. 37, Issue 3
  • DOI: 10.1137/120903476

Adaptive Sampling and Fast Low-Rank Matrix Approximation
book, January 2006

  • Deshpande, Amit; Vempala, Santosh
  • Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
  • DOI: 10.1007/11830924_28

Efficient Structured Multifrontal Factorization for General Large Sparse Matrices
journal, January 2013

  • Xia, Jianlin
  • SIAM Journal on Scientific Computing, Vol. 35, Issue 2
  • DOI: 10.1137/120867032

Separators for sphere-packings and nearest neighbor graphs
journal, January 1997

  • Miller, Gary L.; Teng, Shang-Hua; Thurston, William
  • Journal of the ACM, Vol. 44, Issue 1
  • DOI: 10.1145/256292.256294

Fast monte-carlo algorithms for finding low-rank approximations
journal, November 2004


A theory of pseudoskeleton approximations
journal, August 1997

  • Goreinov, S. A.; Tyrtyshnikov, E. E.; Zamarashkin, N. L.
  • Linear Algebra and its Applications, Vol. 261, Issue 1-3
  • DOI: 10.1016/S0024-3795(96)00301-1

Randomized Sparse Direct Solvers
journal, January 2013

  • Xia, Jianlin
  • SIAM Journal on Matrix Analysis and Applications, Vol. 34, Issue 1
  • DOI: 10.1137/12087116X

The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
journal, March 1992


Algorithms to Solve Hierarchically Semi-separable Systems
book, January 2007

  • Sheng, Zhifeng; Dewilde, Patrick; Chandrasekaran, Shivkumar
  • System Theory, the Schur Algorithm and Multidimensional Analysis
  • DOI: 10.1007/978-3-7643-8137-0_5

A fast block low-rank dense solver with applications to finite-element matrices
journal, January 2016

  • Aminfar, AmirHossein; Ambikasaran, Sivaram; Darve, Eric
  • Journal of Computational Physics, Vol. 304
  • DOI: 10.1016/j.jcp.2015.10.012

Superfast Multifrontal Method for Large Structured Linear Systems of Equations
journal, January 2010

  • Xia, Jianlin; Chandrasekaran, Shivkumar; Gu, Ming
  • SIAM Journal on Matrix Analysis and Applications, Vol. 31, Issue 3
  • DOI: 10.1137/09074543X

Methods of conjugate gradients for solving linear systems
journal, December 1952

  • Hestenes, M. R.; Stiefel, E.
  • Journal of Research of the National Bureau of Standards, Vol. 49, Issue 6
  • DOI: 10.6028/jres.049.044