Superfast Iterative Solvers for Linear Matrix Equations


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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.

作者简介

E. Mikrin

Bauman Moscow State Technical University; Korolev Rocket and Space Corporation “Energia,”

编辑信件的主要联系方式.
Email: mikrin.ea@gmail.com
俄罗斯联邦, Moscow, 105005; Korolev, Moscow oblast, 141070

N. Zubov

Bauman Moscow State Technical University; Korolev Rocket and Space Corporation “Energia,”

Email: mikrin.ea@gmail.com
俄罗斯联邦, Moscow, 105005; Korolev, Moscow oblast, 141070

D. Efanov

Bauman Moscow State Technical University

Email: mikrin.ea@gmail.com
俄罗斯联邦, Moscow, 105005

V. Ryabchenko

Bauman Moscow State Technical University; National Research University “Moscow Power Engineering Institute,”

Email: mikrin.ea@gmail.com
俄罗斯联邦, Moscow, 105005; Moscow, 111250


版权所有 © Pleiades Publishing, Ltd., 2018
##common.cookie##