Lower eigenvalue bounds for singular pencils of matrices
type: Item
instance of: scholarly article
title: Lower eigenvalue bounds for singular pencils of matrices
zbMATH Open document ID: 0755.65038
DOI: 10.1016/0377-0427(92)90208-F
published in: Journal of Computational and Applied Mathematics
publication date: 1993-01-16T00:00:00Z
review text: The author simplifies and extends \textit{R. Beauwens'} procedure [Linear Algebra Appl. 85, 101-119 (1987; Zbl 0613.15011)] to obtain lower eigenvalue estimates for matrix pencils. Using incomplete factorization he compares the accuracy of the new method with \textit{Y. Notay's} method [BIT 29, No. 4, 682-702 (1989; Zbl 0687.65028)]. Two application examples are given.
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 15A42
Mathematics Subject Classification ID: 15A22
zbMATH DE Number: 89595
zbMATH Keywords: singular pencils
zbMATH Keywords: polynomially accelerated iterative methods
zbMATH Keywords: preconditioning
zbMATH Keywords: tridiagonal matrices
zbMATH Keywords: Moore-Penrose inverse
zbMATH Keywords: singular Stieltjes matrices
zbMATH Keywords: lower eigenvalue estimates
zbMATH Keywords: matrix pencils
zbMATH Keywords: incomplete factorization
author: Magolu monga Made
reviewed by: Aurél Galántai
describes a project that uses: symrcm
MaRDI profile type: Publication
cites work: Q4773298
cites work: A generalized SSOR method
cites work: ON ITERATIVE SOLUTION OF ELLIPTIC DIFFERENCE EQUATIONS ON A MESH-CONNECTED ARRAY OF PROCESSORS
cites work: Q3323187
cites work: On the eigenvalue distribution of a class of preconditioning methods
cites work: Upper eigenvalue bounds for pencils of matrices
cites work: On Axelsson's perturbations
cites work: Lower eigenvalue bounds for pencils of matrices
cites work: Approximate factorizations with S/P consistently ordered M-factors
cites work: Q3198793
cites work: Conditioning analysis of positive definite matrices by approximate factorizations
cites work: Q4061081
cites work: Q3943082
cites work: Q3664299
cites work: A class of first order factorization methods
cites work: Parallel concepts in graph theory
cites work: Preconditioned conjugate gradients for solving singular systems
cites work: The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
cites work: Treediagonal matrices and their inverses
cites work: A Local Relaxation Method for Solving Elliptic PDE<scp>s</scp> on Mesh-Connected Arrays
cites work: Conditioning analysis of sparse block approximate factorizations
cites work: Q3140845
cites work: An Incomplete Factorization Technique for Positive Definite Linear Systems
cites work: Polynomial acceleration of iterative schemes associated with subproper splittings
cites work: Incomplete factorizations of singular linear systems
cites work: Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations
cites work: Q3210040
cites work: The rate of convergence of conjugate gradients
cites work: Q3200466
cites work: Conjugate gradient type methods and preconditioning
cites work: On the Robustness of ILU Smoothing
description: scientific article; zbMATH DE number 89595