Implicit iterative schemes based on~singular decomposition and regularizing algorithms

A. I. Zhdanov

Journal of Samara State Technical University, Ser. Physical and Mathematical Sciences, Tome 22 (2018) no. 3, pp. 549-556.

Résumé

A new version of the simple iterations implicit method based on the singular value decomposition is proposed. It is shown that this variant of the simple iterations implicit method can significantly improve the computational stability of the algorithm and at the same time provides a high rate of its convergence. The application of the simple iterations implicit method based on the singular value decomposition for the development of iterative regularization algorithms is considered. The proposed algorithms can be effectively used to solve a wide class of ill-posed and ill-conditioned computational problems.

Détail

Keywords: implicit iterative schemes, computational stability of iterative schemes, iterative regularization methods.
Mots-clés : singular value decomposition, convergence rate

Bibliographie

[1] Vainikko G. M., Veretennikov A. Yu., Iteration Procedures in Ill-Posed Problems, Nauka, Moscow, 1986, 186 pp. (In Russian)

[2] Bakushinsky A. B., Goncharsky A. V., Iterative methods for solving ill-posed problems, Nauka, Moscow, 1986, 186 pp. (In Russian)

[3] Matysik O. V., Explicit and implicit iteration procedures of solving ill-posed problems, Brest State Univ., Brest, 1986, 186 pp. (In Russian)

[4] Donatelli M., “On nondecreasing sequences of regularization parameters for nonstationary iterated Tikhonov”, Numer. Algor., 60:4 (2012), 651–668 | DOI | Zbl

[5] Landi G., Loli Picolomini E., Tomba I., “A stopping criterion for iterative regularization methods”, Appl. Numer. Math., 106 (2016), 53–68 | DOI | Zbl

[6] Buccini A., Donatelli M., Reichel L, “Iterated Tikhonov regularization with a general penalty term”, Numer Linear Algebra Appl., 24:4 (2017), e2089 | DOI | Zbl

[7] Golub G. H., Van Loan C. F., Matrix computations, Johns Hopkins Series in the Mathematical Sciences, 3, The Johns Hopkins University Press., Baltimore, etc., 1989, xix+642 pp. | Zbl

[8] Björk Å., Numerical Methods in Matrix Computations, Texts in Applied Mathematics, 59, Springer, Cham, 2015, xvi+800 pp | DOI

[9] Malyshev A. N., Introduction to numerical linear algebra (with an application of algorithms on FORTRAN), Nauka, Novosibirsk, 1991, 229 pp. (In Russian) | Zbl

[10] Hansen P. C., Rank-deficient and discrete ill-posed problems. Numerical aspects of linear inversion, SIAM Monographs on Mathematical Modeling and Computation, 4, SIAM, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1997, 247 pp. | Zbl

[11] Yamazaki I., Tomov S., Dongarra J., “Sampling Algorithms to Update Truncated SVD”, IEEE International Conference on Big Data (Big Data), 2017 | DOI

[12] Gates M., Tomov S., Dongarra J., “Accelerating the SVD Two StageBidiagonal Reduction and Divide and Conquer Using GPUs”, Parallel Computing, 74 (2018), 3–18 | DOI

[13] Kabir K., Haidar A., Tomov S., Bouteiller A., Dongarra J., “A Framework for Out of Memory SVD Algorithms”, High Performance Computing, ISC 2017. Lecture Notes in Computer Science, v. 10266, eds. J. Kunkel, R. Yokota, P. Balaji, D. Keyes, Springer, Cham, 158–178 | DOI

[14] Dong T., Haidar A., Tomov S., Dongarra J., “Optimizing the SVD Bidiagonalization Process for a Batch of Small Matrices”, Procedia Computer Science, 108 (2017), 1008–1018 | DOI

[15] Haidar A., Kabir K., Fayad D., Tomov S., Dongarra J., “Out Of Memory SVD Solver for Big Data”, 2017 IEEE High Performance Extreme Computing Conference (HPEC), 2017 | DOI

[16] Verzhbitskij V. M., Numerical Methods (Linear Algebra and Nonlinear Equations), Oniks 21 Century Publishing House, Moscow, 2005, 432 pp. (In Russian)