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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q1196835 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Aurel Galantai / rank
Normal rank
 
Property / author
 
Property / author: Mardochée Magolu monga Made / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Aurel Galantai / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: symrcm / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized SSOR method / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON ITERATIVE SOLUTION OF ELLIPTIC DIFFERENCE EQUATIONS ON A MESH-CONNECTED ARRAY OF PROCESSORS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the eigenvalue distribution of a class of preconditioning methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper eigenvalue bounds for pencils of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Axelsson's perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower eigenvalue bounds for pencils of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate factorizations with S/P consistently ordered M-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3198793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditioning analysis of positive definite matrices by approximate factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4061081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3943082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of first order factorization methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioned conjugate gradients for solving singular systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treediagonal matrices and their inverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local Relaxation Method for Solving Elliptic PDE<scp>s</scp> on Mesh-Connected Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditioning analysis of sparse block approximate factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incomplete Factorization Technique for Positive Definite Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial acceleration of iterative schemes associated with subproper splittings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomplete factorizations of singular linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rate of convergence of conjugate gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3200466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate gradient type methods and preconditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Robustness of ILU Smoothing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:08, 16 May 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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references