会议专题

On Convergence Bounds of GMRES Algorithm

In this paper we first make a brief review of GMRES convergence results. Then we derive new bounds for the GMRES residual norm by making use of a unitary matrix U and a Hermitian positive definite matrix P which are GMRES-equivalent to the cofficient matrix A with respect to the initial residual r0. The existence of such U and P was proved by Leonid2. As a GMRES residual norm bound for linear systems with Hermitian positive definite cofficient matrices is known and a GMRES residual norm bound for linear systems with unitary cofficient matrices can be readily derived from Liesens work1, our new bounds follow from the fact that two GMRES-equivalent matrices make the same residual.

Gang Xie

Institute of Computer Applications, CAEP, China

国际会议

Proceedings of The Fourth International Conference on Parallel and Distribyted Computing,Applications and Technologies(第四届并行与分布式计算应用与技术国际会议)

成都

英文

750-753

2003-08-27(万方平台首次上网日期,不代表论文的发表时间)