Factorization-based sparse solvers and preconditioners
domain decompositionfactorizationill-conditionediterative solversparallelismpreconditionerssparse direct solvers
Direct numerical methods for linear systems and matrix inversion (65F05) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Ill-posedness and regularization problems in numerical linear algebra (65F22) Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05)
- scientific article; zbMATH DE number 1069171
- scientific article; zbMATH DE number 1163095
- Preconditioning with direct approximate factoring of the inverse
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Parallel iterative methods for sparse linear systems
- scientific article; zbMATH DE number 1069171 (Why is no real title available?)
- Preordering saddle‐point systems for sparse LDLT factorization without pivoting
- Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
- Application of Sparse Matrix Solvers as Effective Preconditioners
- A priori sparsification of Galerkin models
- Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems
- Optimal preconditioners of a given sparsity pattern
- Factorised preconditionings of successive approximations in finite precision
This page was built for publication: Factorization-based sparse solvers and preconditioners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3466116)
