On Axelsson's perturbations

DOI10.1016/0024-3795(85)90214-9zbMath0599.65023OpenAlexW2068518458MaRDI QIDQ1080620

Robert Beauwens

Publication date: 1985

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(85)90214-9

zbMATH Keywords

convergence rateperturbation techniqueeigenvalue boundsfactorization iterative methods

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (14)

Lower eigenvalue bounds for pencils of matrices ⋮ A survey of some estimates of eigenvalues and condition numbers for certain preconditioned matrices ⋮ Conditioning analysis of positive definite matrices by approximate factorizations ⋮ Vectorizable preconditioners for elliptic difference equations in three space dimensions ⋮ Comparison of eigenvalue ratios in artificial boundary perturbation and Jacobi preconditioning for solving Poisson equation ⋮ Conditioning analysis of sparse block approximate factorizations ⋮ Lower eigenvalue bounds for singular pencils of matrices ⋮ Iterative solution methods ⋮ Approximate factorizations with S/P consistently ordered M-factors ⋮ Incomplete factorizations of singular linear systems ⋮ Modified block-approximate factorization strategies ⋮ On the eigenvalue distribution of a class of preconditioning methods ⋮ A survey of preconditioned iterative methods for linear systems of algebraic equations ⋮ Upper eigenvalue bounds for pencils of matrices

Cites Work

• Upper eigenvalue bounds for pencils of matrices
• Semistrict Diagonal Dominance
• Existence Criteria for Partial Matrix Factorizations in Iterative Methods
• A class of first order factorization methods
• A generalized SSOR method

This page was built for publication: On Axelsson's perturbations