Robust and Effective eSIF Preconditioning for General Dense SPD Matrices
From MaRDI portal
Recommendations
- Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
- Robust preconditioners via generalized eigenproblems for hybrid sparse linear solvers
- Robust preconditioning of large, sparse, symmetric eigenvalue problems
- scientific article; zbMATH DE number 663839
- ESOR method with diagonal preconditioners for SPD linear systems
- Sparse Preconditioned Iterative Methods for Dense Linear Systems
- Application of Sparse Matrix Solvers as Effective Preconditioners
- Fast multipole preconditioners for sparse matrices arising from elliptic equations
- Preconditioners for hierarchical matrices based on their extended sparse form
Cites work
- A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization
- A Fast ULV Decomposition Solver for Hierarchically Semiseparable Representations
- A fast randomized eigensolver with structured LDL factorization update
- A parallel geometric multifrontal solver using hierarchically semiseparable structure
- A robust incomplete factorization preconditioner for positive definite matrices
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Diagonally compensated reduction and related preconditioning methods
- Direction-Preserving and Schur-Monotonic Semiseparable Approximations of Symmetric Positive Definite Matrices
- Divide and conquer low-rank preconditioners for symmetric matrices
- Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
- Effectiveness and robustness revisited for a preconditioning technique based on structured incomplete factorization
- Efficient Construction of an HSS Preconditioner for Symmetric Positive Definite $\mathcal{H}^2$ Matrices
- Fast algorithms for hierarchically semiseparable matrices
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Improving multifrontal methods by means of block low-rank representations
- Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
- Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
- New efficient and robust HSS Cholesky factorization of SPD matrices
- Numerical experiments on the condition number of the interpolation matrices for radial basis functions
- On the complexity of some hierarchical structured matrix algorithms
- On the Perturbation of the Cholesky Factorization
- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
- Preserving Positive Definiteness in Hierarchically Semiseparable Matrix Approximations
- Randomized algorithms for the low-rank approximation of matrices
- Recursively preconditioned hierarchical interpolative factorization for elliptic partial differential equations
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Robust approximate inverse preconditioning for the conjugate gradient method
- Schur complement-based domain decomposition preconditioners with low-rank corrections.
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
Cited in
(7)- An Empirical Analysis of the Performance of Preconditioners for SPD Systems
- Effectiveness and robustness revisited for a preconditioning technique based on structured incomplete factorization
- Convergence analysis of inexact two-grid methods: a theoretical framework
- Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems
- Robust and effective eSIF preconditioning for general SPD matrices
- Matrix nearness problems with off-block-diagonal rank constraints
- Fractional-order dependent radial basis functions meshless methods for the integral fractional Laplacian
This page was built for publication: Robust and Effective eSIF Preconditioning for General Dense SPD Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5161769)
