Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems
From MaRDI portal
Publication:6092276
DOI10.1002/NME.7076OpenAlexW4284962418WikidataQ114235340 ScholiaQ114235340MaRDI QIDQ6092276FDOQ6092276
Authors: Bazyli Klockiewicz, Léopold Cambier, Hamdi A. Tchelepi, Eric Darve 
Publication date: 23 November 2023
Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nme.7076
Basic linear algebra (15Axx) Elliptic equations and elliptic systems (35Jxx) Numerical linear algebra (65Fxx)
Cites Work
- The University of Florida sparse matrix collection
- Fast algorithms for hierarchically semiseparable matrices
- New efficient and robust HSS Cholesky factorization of SPD matrices
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Methods of conjugate gradients for solving linear systems
- Domain decomposition based \({\mathcal H}\)-LU preconditioning
- Performance Of H-Lu Preconditioning For Sparse Matrices
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- A fast direct solver for boundary integral equations in two dimensions
- A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices
- A fast direct solver for elliptic problems on general meshes in 2D
- Two-grid Method for Linear Elasticity on Unstructured Meshes
- Effectiveness and robustness revisited for a preconditioning technique based on structured incomplete factorization
- An adaptive fast direct solver for boundary integral equations in two dimensions
- Efficient structured multifrontal factorization for general large sparse matrices
- A superfast structured solver for Toeplitz linear systems via randomized sampling
- Randomized sparse direct solvers
- Hierarchical interpolative factorization for elliptic operators: differential equations
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Improving multifrontal methods by means of block low-rank representations
- Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation
- A direct solver with \(O(N)\) complexity for variable coefficient elliptic PDEs discretized via a high-order composite spectral collocation method
- Distributed-memory hierarchical interpolative factorization
- Hierarchical Orthogonal Factorization: Sparse Square Matrices
- A fast block low-rank dense solver with applications to finite-element matrices
- Recursively preconditioned hierarchical interpolative factorization for elliptic partial differential equations
- Block preconditioning for fault/fracture mechanics saddle-point problems
- A robust hierarchical solver for ill-conditioned systems with applications to ice sheet modeling
- Fast structured LU factorization for nonsymmetric matrices
- Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
- A recursive skeletonization factorization based on strong admissibility
- Hierarchical interpolative factorization preconditioner for parabolic equations
- ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices
- Robust and Effective eSIF Preconditioning for General Dense SPD Matrices
- Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors
Cited In (1)
This page was built for publication: Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6092276)
