Approximate factorizations with S/P consistently ordered M-factors
From MaRDI portal
Publication:1263235
DOI10.1007/BF01932739zbMath0687.65027OpenAlexW2020059463WikidataQ114233895 ScholiaQ114233895MaRDI QIDQ1263235
Publication date: 1989
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01932739
incomplete factorizationpositive definite linear systemsNumerical examplesnonstrict-diagonal dominanceQuasi-singular problemsS/P consistently ordered M-matrices
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items (8)
A study of the method of approximate factorization for solving grid elliptic boundary-value problems ⋮ A survey of some estimates of eigenvalues and condition numbers for certain preconditioned matrices ⋮ On the robustness of modified incomplete factorization methods ⋮ Analysis of parallel incomplete point factorizations ⋮ Lower eigenvalue bounds for singular pencils of matrices ⋮ Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations ⋮ Iterative solution methods ⋮ Incomplete factorizations of singular linear systems
Uses Software
Cites Work
- 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
- ON ITERATIVE SOLUTION OF ELLIPTIC DIFFERENCE EQUATIONS ON A MESH-CONNECTED ARRAY OF PROCESSORS
- Existence and Conditioning Properties of Sparse Approximate Block Factorizations
- Existence Criteria for Partial Matrix Factorizations in Iterative Methods
- Preconditioning and Two-Level Multigrid Methods of Arbitrary Degree of Approximation
- Iterative Methods for Solving Partial Difference Equations of Elliptic Type
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Approximate factorizations with S/P consistently ordered M-factors
