Synthesis of Fast and Superfast Solvers of Large Systems of Linear Algebraic Equations Using Control Theory Methods


Цитировать

Полный текст

Открытый доступ Открытый доступ
Доступ закрыт Доступ предоставлен
Доступ закрыт Только для подписчиков

Аннотация

Algorithms for fast and superfast solvers of large systems of linear algebraic equations are proposed. These algorithms are constructed based on a novel method of multistep decomposition of a multidimensional linear dynamic system. Examples of the analytical synthesis of iterative solvers for matrices of the general form and for large numerical systems of linear algebraic equations are presented. Analytical calculations show that the exact solution in iterative processes with zero initial conditions is obtained already at the second iteration step. Investigation of the synthesized solvers of large linear equations with numerical matrices and vectors the elements of which are normally distributed showed that the iterative processes converge at the third or fourth iteration step to a highly accurate solution independently of the problem size.

Об авторах

M. Gadzhiev

Moscow Power Engineering Institute (National Research University)

Email: nik.zubov@gmail.com
Россия, Moscow

K. Zhgun

Moscow Power Engineering Institute (National Research University)

Email: nik.zubov@gmail.com
Россия, Moscow

N. Zubov

Bauman State Technical University

Автор, ответственный за переписку.
Email: nik.zubov@gmail.com
Россия, Moscow, 105005

V. Ryabchenko

Moscow Power Engineering Institute (National Research University); Bauman State Technical University

Email: nik.zubov@gmail.com
Россия, Moscow; Moscow, 105005


© Pleiades Publishing, Ltd., 2019

Данный сайт использует cookie-файлы

Продолжая использовать наш сайт, вы даете согласие на обработку файлов cookie, которые обеспечивают правильную работу сайта.

О куки-файлах