A minimal residual method for linear polynomials in unitary matrices |
| |
Authors: | M. Dana Kh. D. Ikramov |
| |
Affiliation: | (1) Faculty of Mathematics, University of Kurdistan, Sanandage, 66177, Islamic Republic of Iran;(2) Faculty of Computational Mathematics and Cybernetics, Moscow State University, Leninskie gory, Moscow, 119992, Russia |
| |
Abstract: | A minimal residual method, called MINRES-N2, that is based on the use of unconventional Krylov subspaces was previously proposed by the authors for solving a system of linear equations Ax = b with a normal coefficient matrix whose spectrum belongs to an algebraic second-degree curve Γ. However, the computational scheme of this method does not cover matrices of the form A = αU + βI, where U is an arbitrary unitary matrix; for such matrices, Γ is a circle. Systems of this type are repeatedly solved when the eigenvectors of a unitary matrix are calculated by inverse iteration. In this paper, a modification of MINRES-N2 suitable for linear polynomials in unitary matrices is proposed. Numerical results are presented demonstrating the significant superiority of the modified method over GMRES as applied to systems of this class. |
| |
Keywords: | linear polynomials in unitary matrices minimal residual method modification of the MINRES-N2 algorithm |
本文献已被 SpringerLink 等数据库收录! |
|