Email this article Superfast Iterative Solvers for Linear Matrix Equations
- Authors: Mikrin E.A.1,2, Zubov N.E.1,2, Efanov D.E.1, Ryabchenko V.N.1,3
-
Affiliations:
- Bauman Moscow State Technical University
- Korolev Rocket and Space Corporation “Energia,”
- National Research University “Moscow Power Engineering Institute,”
- Issue: Vol 98, No 2 (2018)
- Pages: 444-447
- Section: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225554
- DOI: https://doi.org/10.1134/S1064562418060145
- ID: 225554
Cite item
Open Access
Access granted
Subscription Access
Abstract
Superfast algorithms for solving large systems of linear equations are developed on the basis of an original method for multistep decomposition of a linear multidimensional dynamical system. Examples of analytical synthesis of iterative solvers for matrices of the general form and for large numerical systems of linear algebraic equations are given. For the analytical case, it is shown that convergence occurs at the second iteration.
About the authors
E. A. Mikrin
Bauman Moscow State Technical University; Korolev Rocket and Space Corporation “Energia,”
Author for correspondence.
Email: mikrin.ea@gmail.com
Russian Federation, Moscow, 105005; Korolev, Moscow oblast, 141070
N. E. Zubov
Bauman Moscow State Technical University; Korolev Rocket and Space Corporation “Energia,”
Email: mikrin.ea@gmail.com
Russian Federation, Moscow, 105005; Korolev, Moscow oblast, 141070
D. E. Efanov
Bauman Moscow State Technical University
Email: mikrin.ea@gmail.com
Russian Federation, Moscow, 105005
V. N. Ryabchenko
Bauman Moscow State Technical University; National Research University “Moscow Power Engineering Institute,”
Email: mikrin.ea@gmail.com
Russian Federation, Moscow, 105005; Moscow, 111250
