Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations

DOI10.1016/0168-9274(92)90058-LzbMath0756.65049OpenAlexW2070551376WikidataQ114214918 ScholiaQ114214918MaRDI QIDQ1201030

Yvan Notay

Publication date: 17 January 1993

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(92)90058-l

zbMATH Keywords

iterative methodspreconditioned conjugate gradient methodlarge sparse linear systemsacceleration of convergenceNumerical examplesconsistently orderedStieltjes matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (4)

A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C ⋮ Comparison of eigenvalue ratios in artificial boundary perturbation and Jacobi preconditioning for solving Poisson equation ⋮ Lower eigenvalue bounds for singular pencils of matrices ⋮ Incomplete factorizations of singular linear systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial acceleration of iterative schemes associated with subproper splittings
• Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
• Approximate factorizations with S/P consistently ordered M-factors
• Incomplete factorizations of singular linear systems
• Parallel concepts in graph theory
• On the robustness of modified incomplete factorization methods
• Influence of the Eigenvalue Spectrum on the Convergence Rate of the Conjugate Gradient Method
• Approximate factorizations with modified S/P consistently ordered M‐factors

This page was built for publication: Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations