Superfast Iterative Solvers for Linear Matrix Equations
Е. А. Микрин, Nikolay E. Zubov, D. E. Efanov, Vladimir Nikolaevich Ryabchenko
Abstract
Е. А. Микрин, Nikolay E. Zubov, D. E. Efanov, Vladimir Nikolaevich Ryabchenko
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.
OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Mathematics, Algebraic equation, Linear system, Iterative method, System of linear equations, Applied mathematics, Convergence (economics), Linear equation