The row-oriented form of the regularized Kaczmarz’s method

This paper presents the new iterative method for solving the standard Tikhonov regularization problem. The basis of the method is the application the projection Kaczmarz algorithm to the augmented regularized normal system of equations. The use of the augmented regularized normal system of equations...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Vestnik Samarskogo gosudarstvennogo tehničeskogo universiteta. Seriâ Fiziko-matematičeskie nauki Jg. 21; H. 3; S. 546 - 555
Hauptverfasser: Alexander I Zhdanov, Yuri V Sidorov
Format: Journal Article
Sprache:Englisch
Russisch
Veröffentlicht: Samara State Technical University 01.09.2017
Schlagworte:
iterative methods
kaczmarz algorithm
projection algorithms
row-oriented form of the regularized kaczmarz’s algorithm
tikhonov’s regularization
ISSN:1991-8615, 2310-7081
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents the new iterative method for solving the standard Tikhonov regularization problem. The basis of the method is the application the projection Kaczmarz algorithm to the augmented regularized normal system of equations. The use of the augmented regularized normal system of equations, instead the system of regularized normal equations, makes it possible to significantly reduce the spectral condition number of the original problem. The paper presents the row-oriented form of the regularized Kaczmarz algorithm. This form of the regularized Kaczmarz algorithm allows to solve problems in which the data are received sequentially (line by line). The proposed algorithm makes it possible to effectively calculate solutions of problems with sparse matrices of large and superlarge dimensions. The comparison’s results of the proposed row-oriented form of the algorithm with the column-oriented form of this algorithm are presented. By considering a certain classes of problems, the paper demonstrates that the proposed form of the regularized algorithm allows to reduce the number of iterations in comparison with the column-oriented form of the algorithm.
ISSN:1991-8615
2310-7081
DOI:10.14498/vsgtu1548