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

DOI10.1016/0168-9274(92)90058-LzbMATH Open0756.65049OpenAlexW2070551376WikidataQ114214918 ScholiaQ114214918MaRDI QIDQ1201030FDOQ1201030

Authors: 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

Recommendations

• Conditioning analysis of positive definite matrices by approximate factorizations
• An optimal incomplete factorization method for Stieltjes matrices
• Structured condition numbers for some matrix factorizations of structured matrices
• Approximate factorizations with S/P consistently ordered M-factors
• scientific article; zbMATH DE number 1438880
• Conditioning analysis of sparse block approximate factorizations
• Approximate factorizations with modified S/P consistently ordered M‐factors
• An algebraic multilevel iterative method of incomplete factorization for Stieltjes matrices
• A sufficient and necessary condition of the convergence of the SAOR iterative method for consistently ordered matrices
• Stochastic conditioning of matrix functions

zbMATH Keywords

iterative methodspreconditioned conjugate gradient methodlarge sparse linear systemsNumerical examplesacceleration of convergenceconsistently 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)

Cites Work

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

Cited In (6)

• Title not available (Why is that?)
• Conditioning analysis of positive definite matrices by approximate factorizations
• Incomplete factorizations of singular linear systems
• A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C
• Lower eigenvalue bounds for singular pencils of matrices
• Comparison of eigenvalue ratios in artificial boundary perturbation and Jacobi preconditioning for solving Poisson equation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201030)