A regularizing Lanczos iteration method for underdetermined linear systems (Q1971820): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Daniela Calvetti / rank
Normal rank
 
Property / author
 
Property / author: Lothar Reichel / rank
Normal rank
 
Property / author
 
Property / author: Giulia Spaletta / rank
Normal rank
 
Property / author
 
Property / author: Daniela Calvetti / rank
 
Normal rank
Property / author
 
Property / author: Lothar Reichel / rank
 
Normal rank
Property / author
 
Property / author: Giulia Spaletta / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3334886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3754464 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:00, 29 May 2024

scientific article
Language Label Description Also known as
English
A regularizing Lanczos iteration method for underdetermined linear systems
scientific article

    Statements

    A regularizing Lanczos iteration method for underdetermined linear systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 August 2001
    0 references
    Underdetermined linear systems \(Ax=b\) lead to linear equations of the form \(Bx=b\) where \(B=A^T A\) and \(b\) is redefined. If \(B\) is an ill conditioned matrix, a possible regularization is \[ \left(B+{1\over \beta} I\right) y=b. \] Of course, the result heavily depends on the choice of the regularization parameter \(\beta\). If the data are contaminated by some error, the value of \(\beta\) may be chosen such that the regularization term \(\beta^{-1} y\) has the same order of magnitude as the contamination. Its determination in a Lanczos type iteration is in the center of the paper.
    0 references
    Lanczos method
    0 references
    ill posed problems
    0 references
    underdetermined linear systems
    0 references
    ill conditioned matrix
    0 references
    regularization
    0 references

    Identifiers