A note on the ART of relaxation (Q1060809): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q786524
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Manfred R. Trummer / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Row-Action Methods for Huge and Sparse Systems and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong underrelaxation in Kaczmarz's method for inconsistent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5768822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the discrete ART algorithm for the reconstruction of digital pictures from their projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing pictures from projections: On the convergence of the ART algorithm with relaxation / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02242277 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W172623761 / rank
 
Normal rank

Latest revision as of 10:54, 30 July 2024

scientific article
Language Label Description Also known as
English
A note on the ART of relaxation
scientific article

    Statements

    A note on the ART of relaxation (English)
    0 references
    0 references
    1984
    0 references
    Gegeben sind eine (m\(\times n)\)-Matrix A mit Zeilen \(a^{(1)T},...,a^{(m)T}\) mit \(\| a^{(j)}\| =1\) für \(1\leq j\leq m\) und ein Vektor \(y\in {\mathbb{R}}^ n\). Gesucht ist eine Lösung von \(Ax=y\). Es wird gezeigt, daß das Iterationsverfahren \[ x^{(km+j)}=x^{(km+j-1)}+r_ k\| a^{(j)}\|^{-2}[y_ j- a^{(j)T}x^{(km+j-1)}]a^{(j)}, \] (1\(\leq j\leq m\), \(k=0,1,2,...)\), für jeden Startvektor \(x^{(0)}\) aus dem Bildraum von \({\mathbb{R}}^ m\) unter der durch \(A^ T\) gegebenen linearen Abbildung konvergiert für alle Folgen nichtnegativer Parameter \(r_ k\) mit \(\sum^{\infty}_{k=0}r^ 2_ k<\infty\) und \(\sum^{\infty}_{k=0}r_ k=\infty\). Der Grenzwert ist eine Lösung mit minimaler Norm.
    0 references
    ART algorithm
    0 references
    inconsistent systems
    0 references
    relaxation
    0 references
    weighted least squares solution
    0 references
    image reconstruction
    0 references
    generalized inverses
    0 references
    0 references

    Identifiers