J. Comp. Math., 16 (1998), pp. 539-550.


Total Generalized Minimum Backward Error Algorithm For Solving Nonsymmetric Linear Systems

Zhi-hao Cao 1

1 Department of Mathematics, Fudan University, Shanghai 200433, China


Abstract

This paper extendes the results by E.M. Kasenally$^{[7]}$ on a Generalized Minimum Backward Error Algorithm for nonsymmetric linear systems $Ax=b$ to the problem in which pertubations are simultaneously permitted on $A$ and $b$. The approach adopted by Kasenally has been to view the approximate solution as the exact solution to a perturbed linear system in which changes are permitted to the matrix $A$ only. The new method introduced in this paper is a Krylov subspace iterative method which minimizes the norm of the perturbations to both the observation vector $b$ and the data matrix $A$ and has better performance than the Kasenally’s method and the restarted GMRES method$^{[12]}$. The minimization problem amounts to computing the smallest singular value and the corresponding right singular vector of a low-order upper-Hessenberg matrix. Theoratical properties of the algorithm are discussed and practical implementation issues are considered. The numerical examples are also given.

Key words: Nonsymmetric linear systems; Iterative methods; Backward error.


 

The Global Science Journal