2210

PETER SONNEVELD

CGS SOLVER FOR NONSYMMETRIC LINEAR SYSTEMS

Society for Industrial and Applied Mathematics

1989

10

1

36-52

preconditioned conjugate gradients , Lanczos algorithm , iterative methods , CG , CGS , SPD , Bi-CG

A Lanczos-type method is presented for nonsymmetric sparse linear systems as arising from discretisations of elliptic partial differential equations. The method is based on a polynomial variant of the conjugate gradients algorithm. Although related to the so-called bi-conjugate gradients (Bi-CG) algorithm, it does not involve adjoint matrix-vector multiplications, and the expected convergence rate is about twice that of the Bi-CG algorithm. Numerical comparison is made with other solvers, testing the method on a family of convection diffusion equations, on various grids, and with the use of two different preconditioning methods. Upwind as well as central differencing is used in the experiments.

,/DL/Data Entry/Edit/AddToCompilation.aspx,/DL/Data Entry/NewEdit/Documents/Math_English_Electronic_Articles_EditCompile_454.aspx