Superfast Iterative Solvers for Linear Matrix Equations
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.
Unable to display preview. Download preview PDF.
- 1.U. Helmke and J. Jordan, “Control and stabilization of linear equation solvers,” Lecture Notes in Control and Information Sciences (Springer-Verlag, Berlin, 2010), pp. 73–82.Google Scholar
- 4.N. E. Zubov, E. A. Mikrin, and V. N. Ryabchenko, Matrix Methods in the Theory and Practice of Aircraft Control Systems (Mosk. Gos. Tekh. Univ. im. N.E. Baumana, Moscow), 2016) [in Russian].Google Scholar
- 9.U. Helmke, J. Jordan, and A. Lanzon, “A control theory approach to linear equation solvers,” Proceedings of 17th International Symposium on Mathematical Theory of Network and Systems (MTNS), Kyoto, Japan, 2006.Google Scholar
- 13.Y. Wakasa and Y. Yamamoto, “An iterative method for solving linear equations by using robust methods,” Proceedings of SICE First Annual Conference on Control Systems (2001), pp. 451–454.Google Scholar
- 14.B. T. Polyak and P. S. Shcherbakov, Robust Stability and Control (Nauka, Moscow, 2002) [in Russian].Google Scholar