Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences (Q1114332): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q126668091, #quickstatements; #temporary_batch_1722496391782
 
(6 intermediate revisions by 5 users not shown)
Property / reviewed by
 
Property / reviewed by: Volker Mehrmann / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Volker Mehrmann / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(89)90285-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075351838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of splittings used with the conjugate gradient algorithm / 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: Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at the Lanczos algorithm for solving symmetric systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lanczos Algorithm with Selective Orthogonalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Make the Lanczos Algorithm Converge Slowly / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126668091 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:16, 1 August 2024

scientific article
Language Label Description Also known as
English
Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
scientific article

    Statements

    Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences (English)
    0 references
    0 references
    1989
    0 references
    For the Lanczos and conjugate-gradient algorithms it is shown that in the presence of roundoff the computed set of orthogonal polynomials are still orthogonal polynomials but with respect to a slighly different measure. This property is used to obtain information on the approximate eigenvalues computed by the Lanczos method and the rate of convergence of the perturbed conjugate-gradient algorithm.
    0 references
    Lanczos method
    0 references
    conjugate-gradient method
    0 references
    error analysis
    0 references
    orthogonal polynomials
    0 references
    rate of convergence
    0 references

    Identifiers