Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems
DOI10.1002/NME.7076OpenAlexW4284962418WikidataQ114235340 ScholiaQ114235340MaRDI QIDQ6092276FDOQ6092276
Author name not available (Why is that?), 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)
