Superfast Iterative Solvers for Linear Matrix Equations
- Autores: Mikrin E.1,2, Zubov N.1,2, Efanov D.1, Ryabchenko V.1,3
-
Afiliações:
- Bauman Moscow State Technical University
- Korolev Rocket and Space Corporation “Energia,”
- National Research University “Moscow Power Engineering Institute,”
- Edição: Volume 98, Nº 2 (2018)
- Páginas: 444-447
- Seção: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225554
- DOI: https://doi.org/10.1134/S1064562418060145
- ID: 225554
Citar
Resumo
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.
Sobre autores
E. Mikrin
Bauman Moscow State Technical University; Korolev Rocket and Space Corporation “Energia,”
Autor responsável pela correspondência
Email: mikrin.ea@gmail.com
Rússia, Moscow, 105005; Korolev, Moscow oblast, 141070
N. Zubov
Bauman Moscow State Technical University; Korolev Rocket and Space Corporation “Energia,”
Email: mikrin.ea@gmail.com
Rússia, Moscow, 105005; Korolev, Moscow oblast, 141070
D. Efanov
Bauman Moscow State Technical University
Email: mikrin.ea@gmail.com
Rússia, Moscow, 105005
V. Ryabchenko
Bauman Moscow State Technical University; National Research University “Moscow Power Engineering Institute,”
Email: mikrin.ea@gmail.com
Rússia, Moscow, 105005; Moscow, 111250