A Purely Algebraic Approach to Preconditioning Based on Hierarchical LU Factorizations
From MaRDI portal
Recommendations
- Domain decomposition based \({\mathcal H}\)-LU preconditioning
- An algebraic approach for \({\mathcal{H}}\)-matrix preconditioners
- Efficient preconditioning of \(hp\)-FEM matrices by hierarchical low-rank approximations
- On the purely algebraic data-sparse approximation of the inverse and the triangular factors of sparse matrices.
- Parallel black box $$\mathcal {H}$$ -LU preconditioning for elliptic boundary value problems
Cited in
(11)- Preconditioners for least squares problems by LU factorization
- A unifying approach to abstract matrix algebra preconditioning
- Domain decomposition based \({\mathcal H}\)-LU preconditioning
- Hierarchical matrix techniques for a domain decomposition algorithm
- An algebraic approach for \({\mathcal{H}}\)-matrix preconditioners
- On the purely algebraic data-sparse approximation of the inverse and the triangular factors of sparse matrices.
- Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations
- Algebraic Analysis of the Hierarchical Basis Preconditioner
- AILU: a preconditioner based on the analytic factorization of the elliptic operator
- Multilevel block factorizations in generalized hierarchical bases
- Hierarchical LU decomposition-based preconditioners for BEM
This page was built for publication: A Purely Algebraic Approach to Preconditioning Based on Hierarchical LU Factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5503083)
