An algebraic multifrontal preconditioner that exploits the low‐rank property
From MaRDI portal
Publication:5739752
DOI10.1002/nla.2006zbMath1413.65049OpenAlexW2157072253MaRDI QIDQ5739752
Publication date: 19 July 2016
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/160437/7/strumfREP.pdf
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items
An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations, Matrices with Hierarchical Low-Rank Structures, Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation, An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling, A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization
Uses Software
Cites Work
- Unnamed Item
- Rang revealing QR factorizations
- An aggregation-based algebraic multigrid method
- A fast adaptive solver for hierarchically semiseparable representations
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- Approximation of solution operators of elliptic partial differential equations by \({\mathcal H}\)- and \({\mathcal H}^2\)-matrices
- Existence of \(\mathcal H\)-matrix approximants to the inverse FE-matrix of elliptic operators with \(L^\infty\)-coefficients
- Introduction to hierarchical matrices with applications.
- Domain decomposition based \({\mathcal H}\)-LU preconditioning
- Fast structured LU factorization for nonsymmetric matrices
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- Conditioning Analysis of Incomplete Cholesky Factorizations with Orthogonal Dropping
- An Algebraic Multigrid Method with Guaranteed Convergence Rate
- A Supernodal Approach to Incomplete LU Factorization with Partial Pivoting
- On the Numerical Rank of the Off-Diagonal Blocks of Schur Complements of Discretized Elliptic PDEs
- Fast algorithms for hierarchically semiseparable matrices
- Pivoting strategies for tough sparse indefinite systems
- An overview of SuperLU
- Why Finite Element Discretizations Can Be Factored by Triangular Hierarchical Matrices
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- LAPACK Users' Guide
- Generalized Nested Dissection
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- On Rank-Revealing Factorisations
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Improving Multifrontal Methods by Means of Block Low-Rank Representations
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Efficient Structured Multifrontal Factorization for General Large Sparse Matrices
- Nested Dissection of a Regular Finite Element Mesh
