Lower eigenvalue bounds for singular pencils of matrices

DOI10.1016/0377-0427(92)90208-FzbMath0755.65038MaRDI QIDQ1196836

Mardochée Magolu monga Made

Publication date: 16 January 1993

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

preconditioningMoore-Penrose inversetridiagonal matricesmatrix pencilsincomplete factorizationsingular pencilslower eigenvalue estimatespolynomially accelerated iterative methodssingular Stieltjes matrices

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Inequalities involving eigenvalues and eigenvectors (15A42) Iterative numerical methods for linear systems (65F10) Matrix pencils (15A22)

Related Items (1)

Incomplete factorizations of singular linear systems

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the eigenvalue distribution of a class of preconditioning methods
• Upper eigenvalue bounds for pencils of matrices
• The rate of convergence of conjugate gradients
• On Axelsson's perturbations
• Lower eigenvalue bounds for pencils of matrices
• Polynomial acceleration of iterative schemes associated with subproper splittings
• Preconditioned conjugate gradients for solving singular systems
• Conjugate gradient type methods and preconditioning
• Conditioning analysis of positive definite matrices by approximate factorizations
• Treediagonal matrices and their inverses
• Conditioning analysis of sparse block approximate factorizations
• Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations
• The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
• Approximate factorizations with S/P consistently ordered M-factors
• Incomplete factorizations of singular linear systems
• Parallel concepts in graph theory
• ON ITERATIVE SOLUTION OF ELLIPTIC DIFFERENCE EQUATIONS ON A MESH-CONNECTED ARRAY OF PROCESSORS
• A Local Relaxation Method for Solving Elliptic PDE<scp>s</scp> on Mesh-Connected Arrays
• On the Robustness of ILU Smoothing
• An Incomplete Factorization Technique for Positive Definite Linear Systems
• A class of first order factorization methods
• A generalized SSOR method

This page was built for publication: Lower eigenvalue bounds for singular pencils of matrices