A Lanczos-type method for solving nonsymmetric linear systems with multiple right-hand sides-matrix and polynomial interpretation

被引:0
|
作者
Musschoot, C [1 ]
机构
[1] Univ Sci & Technol, IEEA M3, UFR, Lab Analyse Numer & Optimisat, F-59655 Villeneuve Dascq, France
关键词
nonsymmetric systems; Krylov subspace; multiple right-hand sides; Lanczos' method; Bi-orthogonality; Hankel matrix; orthogonal polynomials; transpose-free algorithm; BiCGSTAB;
D O I
10.1016/S0377-0427(98)00195-2
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we propose a method with a finite termination property for solving the linear system AX = B where A is a nonsymmetric complex nxn matrix and B is an arbitrary nxs rectangular matrix. s does not have to be small. The method is based on a single Krylov subspace where all the systems are picking informations. A polynomial and a single matrix interpretation is given which seems to be new from a theoretical point of view. Numerical experiments show that the convergence is usually quite good even if s is relatively large. The memory requirements and the computational costs seem to be interesting too. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:61 / 85
页数:25
相关论文
共 50 条