Conditioning analysis of sparse block approximate factorizations
DOI10.1016/0168-9274(91)90096-IzbMath0751.65022OpenAlexW2020950075WikidataQ114214920 ScholiaQ114214920MaRDI QIDQ1181519
Publication date: 27 June 1992
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-9274(91)90096-i
numerical exampleslarge sparse linear systemsStieltjes matrixpolynomially accelerated iterative methodssparse block approximate factorization
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper eigenvalue bounds for pencils of matrices
- On Axelsson's perturbations
- Lower eigenvalue bounds for pencils of matrices
- Conditioning analysis of positive definite matrices by approximate factorizations
- Vectorizable preconditioners for elliptic difference equations in three space dimensions
- Incomplete factorizations of singular linear systems
- Parallel concepts in graph theory
- Second-degree iterative methods for the solution of large linear systems
- Block Preconditioning for the Conjugate Gradient Method
- On Sparse Block Factorization Iterative Methods
- Existence and Conditioning Properties of Sparse Approximate Block Factorizations
- A class of first order factorization methods
- Iterative Methods for Elliptic Problems and the Discovery of “q”
- Preconditioning and Two-Level Multigrid Methods of Arbitrary Degree of Approximation
- A generalized SSOR method
This page was built for publication: Conditioning analysis of sparse block approximate factorizations