A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
复制标题
DOI:
10.1137/s0895479890188803
复制
发表时间:
1994
期刊:
影响因子:
--
通讯作者:
M. Gutknecht
中科院分区:
文献类型:
--
作者:
M. Gutknecht
This paper is a continuation of Part I [M. H. Gutknecht, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 594--639], where the theory of the "unsymmetric" Lanczos biorthogonalization (BO) algorithm and the corresponding iterative method BIORES for non-Hermitian linear systems was extended to the nongeneric case. The analogous extension is obtained here for the biconjugate gradient (or BIOMIN) method and for the related BIODIR method. Here, too, the breakdowns of these methods can be cured. As a preparation, mixed recurrence formulas are derived for a pair of sequences of formal orthogonal polynomials belonging to two adjacent diagonals in a nonnormal Pade table, and a matrix interpretation of these recurrences is developed. This matrix interpretation leads directly to a completed formulation of the progressive qd algorithm, valid also in the case of a nonnormal Pade table. Finally, it is shown how the cure for exact breakdown can be extended to near-breakdown in such a way that (in exact arithmetic) the well-conditioned formal orthogonal polynomials and the corresponding Krylov space vectors do not depend on the threshold specifying the near-breakdown.