Iterative algorithms for Gram-Schmidt orthogonalization (Q1117669): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Walter Hoffmann / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Axel Ruhe / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving linear least squares problems by Gram-Schmidt orthogonalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook series linear algebra. Linear least squares solutions by Householder transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rang revealing QR factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5185900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3868672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical aspects of Gram-Schmidt orthogonalization of vectors / rank
 
Normal rank

Latest revision as of 14:38, 19 June 2024

scientific article
Language Label Description Also known as
English
Iterative algorithms for Gram-Schmidt orthogonalization
scientific article

    Statements

    Iterative algorithms for Gram-Schmidt orthogonalization (English)
    0 references
    0 references
    0 references
    1989
    0 references
    A Gram-Schmidt algorithm to orthogonalize a sequence of vectors, where one vector at a time is orthogonalized to the set of already orthogonalized vectors is investigated. It is shown that if a reorthogonalization is performed whenever the norm of the vector is decreased more than a certain threshold, a prescribed accuracy of the whole sequence will be obtained both for the classical and the modified variants of the Gram-Schmidt algorithm.
    0 references
    0 references
    0 references
    0 references
    0 references
    Gram-Schmidt orthogonalization
    0 references
    QR factorization
    0 references
    vector algorithms
    0 references
    Gram-Schmidt algorithm
    0 references
    0 references
    0 references