Adaptive polynomial preconditioning for Hermitian indefinite linear systems (Q1263933): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q587430
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Florica Luban / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>m</i>-Step Preconditioned Conjugate Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3973645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Taxonomy for Conjugate Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of iterative methods for finite element equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of preconditioned iterative methods for linear systems of algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix-Free Methods for Stiff Systems of ODE’s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel elliptic preconditioners: Fourier analysis and performance on the connection machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Polynomials with Application to Richardson Iteration for Indefinite Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the inverse of a matrix for use in iterative algorithms on vector processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimates of Eigenvalues for Iterative Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3909906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Preconditioners for Conjugate Gradient Calculations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3692700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Sparse Indefinite Systems of Linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3868672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leapfrog variants of iterative methods for linear algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods / rank
 
Normal rank

Latest revision as of 11:01, 20 June 2024

scientific article
Language Label Description Also known as
English
Adaptive polynomial preconditioning for Hermitian indefinite linear systems
scientific article

    Statements

    Adaptive polynomial preconditioning for Hermitian indefinite linear systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    The paper deals with the solution of Hermitian indefinite linear systems in the context of conjugate gradient methods combined with the various polynomial preconditioners. An adaptive procedure is devised for estimating dynamically the extreme eigenvalues of a given indefinite matrix that is equivalent to computing dynamically the optimum polynomial preconditioner. Finally, the efficiency of polynomial preconditioning is demonstrated by means of some numerical experiments executed on a single processor of a Cray X-MP/48. A better performance on parallel architectures is expected.
    0 references
    Hermitian indefinite linear systems
    0 references
    conjugate gradient methods
    0 references
    polynomial preconditioners
    0 references
    extreme eigenvalues
    0 references
    efficiency
    0 references
    numerical experiments
    0 references
    parallel architectures
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references