Lower eigenvalue bounds for singular pencils of matrices (Q1196836): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: symrcm / rank
 
Normal rank

Revision as of 09:44, 29 February 2024

scientific article
Language Label Description Also known as
English
Lower eigenvalue bounds for singular pencils of matrices
scientific article

    Statements

    Lower eigenvalue bounds for singular pencils of matrices (English)
    0 references
    16 January 1993
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    singular pencils
    0 references
    polynomially accelerated iterative methods
    0 references
    preconditioning
    0 references
    tridiagonal matrices
    0 references
    Moore-Penrose inverse
    0 references
    singular Stieltjes matrices
    0 references
    lower eigenvalue estimates
    0 references
    matrix pencils
    0 references
    incomplete factorization
    0 references