Iterative Processes in the Krylov–Sonneveld Subspaces
The paper presents a generalized block version of the Induced Dimension Reduction (IDR) methods in comparison with the Multi–Preconditioned Semi-Conjugate Direction (MPSCD) algorithms in Krylov subspaces with deflation and low-rank matrix approximation. General and individual orthogonality and variational properties of these two methodologies are analyzed. It is demonstrated, in particular, that for any sequence of Krylov subspaces with increasing dimensions there exists a sequence of the corresponding shrinking subspaces with decreasing dimensions. The main conclusion is that the IDR procedures, proposed by P. Sonneveld and other authors, are not an alternative to but a further development of the general principles of iterative processes in Krylov subspaces.
Unable to display preview. Download preview PDF.
- 4.Y. Onoue, S. Fujino, and N. Nakashima, “An overview of a family of new iterative methods based on IDR theorem and its estimation,” in: Proceedings of the International Multi-Conference of Engineers and Computer Scientists, 2009, Vol. 11, IMECS, Hong Kong (2009), pp. 2129–2134.Google Scholar
- 10.Y. Saad, Iterative Methods for Sparse Linear Systems (Second edition), Society for Industrial and Applied Mathematics (2003).Google Scholar
- 11.V. P. Il’in, Methods and Technologies of Finite Elements [in Russian], Izd. IVMiMG SO RAN, Novosibirsk (2007).Google Scholar
- 24.O. Coulaud, L. Giraud, P. Ramet, and X. Vasseur, Deflation and augmentation techniques in Krylov subspace methods for the solution of linear systems, INRIA, Bordeaux-Sud Ouest, France, Res. Rep. No. 8265 (2013).Google Scholar
- 27.V. P. Il’in, “Problems of parallel solution of large systems of linear algebraic equations,” Zap. Nauchn. Semin. POMI, 439, 112–127 (2015).Google Scholar
- 29.C. L. Lawson and R. J. Hanson, Solving Least Squares Problems [Russian translation], Nauka, Moscow (1986).Google Scholar