| タイトル | Conjugate gradient type methods for linear systems with complex symmetric coefficient matrices |
| 本文（外部サイト） | http://hdl.handle.net/2060/19920004458 |
| 著者（英） | Freund, Roland |
| 著者所属（英） | Research Inst. for Advanced Computer Science |
| 発行日 | 1989-12-01 |
| 言語 | eng |
| 内容記述 | We consider conjugate gradient type methods for the solution of large sparse linear system Ax equals b with complex symmetric coefficient matrices A equals A(T). Such linear systems arise in important applications, such as the numerical solution of the complex Helmholtz equation. Furthermore, most complex non-Hermitian linear systems which occur in practice are actually complex symmetric. We investigate conjugate gradient type iterations which are based on a variant of the nonsymmetric Lanczos algorithm for complex symmetric matrices. We propose a new approach with iterates defined by a quasi-minimal residual property. The resulting algorithm presents several advantages over the standard biconjugate gradient method. We also include some remarks on the obvious approach to general complex linear systems by solving equivalent real linear systems for the real and imaginary parts of x. Finally, numerical experiments for linear systems arising from the complex Helmholtz equation are reported. |
| NASA分類 | COMPUTER PROGRAMMING AND SOFTWARE |
| レポートNO | 92N13676
RIACS-TR-89-54
NAS 1.26:188893
NASA-CR-188893 |
| 権利 | No Copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/129587 |
