Avoiding breakdown and near-breakdown in Lanczos type algorithms (Q1187056): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Padé-type approximation and general orthogonal polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lanczos-type algorithms for solving systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding breakdown in the CGS algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynômes orthogonaux formels - applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems / rank
 
Normal rank

Latest revision as of 16:17, 15 May 2024

scientific article
Language Label Description Also known as
English
Avoiding breakdown and near-breakdown in Lanczos type algorithms
scientific article

    Statements

    Avoiding breakdown and near-breakdown in Lanczos type algorithms (English)
    0 references
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    The paper deals with methods which the authors have developed to avoid breakdown and near-breakdown due to division by a scalar product whose value is zero or is different from zero but small in Lanczos type algorithms for solving linear systems. In particular, the bulk of the paper concentrates on a method called by the authors the method of recursive zoom (MRZ) and its variants: SMRZ, BMRZ, GMRZ and BSMRZ, where S, B, G stand for symmetric, balancing and general, respectively. It is shown that a breakdown can be avoided by considering only the existing orthogonal polynomials in the Lanczos type algorithms. The methods described in the paper are able to detect if such a polynomial does not exist in order to jump over it. Pseudo-codes for MRZ and BSMRZ are given and some numerical results are presented.
    0 references
    0 references
    Lanczos method
    0 references
    biconjugate gradient
    0 references
    projection
    0 references
    orthogonal polynomials
    0 references
    methods of moments
    0 references
    method of recursive zoom
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references