On the use of rational iterative methods for solving large sparse linear systems (Q1195363)

From MaRDI portal
Revision as of 20:05, 14 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the use of rational iterative methods for solving large sparse linear systems
scientific article

    Statements

    On the use of rational iterative methods for solving large sparse linear systems (English)
    0 references
    0 references
    0 references
    25 October 1992
    0 references
    One is mainly interested in linear systems arising from the solution of elliptic partial differential equations by finite difference methods. The object of the work is to develop iterative procedures which are not only rapidly convergent but which are also suited for use on vector and parallel supercomputers. These techniques should be applicable to general problems with convergence rate substantially less than \(O(h^{-3})\). To this end, for solving the linear system \(Au=b\), the iteration method is selected in the form \(u(\text{new})=u(\text{old})+R(A)(b-Au(\text{old}))\) which provides a connection with the time-dependent problem \(du(t)/dt=-Au(t)+b\). The sections deal respectively with time-dependent problems, rational iteration, multilevel implementation of the rational iteration and some numerical experiments (in addition to the usual conclusion).
    0 references
    0 references
    large sparse linear systems
    0 references
    finite difference methods
    0 references
    vector and parallel supercomputers
    0 references
    nonsingular preconditioning matrix
    0 references
    polynomial acceleration
    0 references
    Chebyshev acceleration
    0 references
    conjugate gradient acceleration
    0 references
    convergence rate
    0 references
    rational iteration
    0 references
    multilevel implementation
    0 references
    numerical experiments
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references