The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
Abstract
Conjugate gradient-type methods for the solution of large sparse linear systems $Ax = b$ with complex symmetric coefficient matrices $A = A^T $ are considered. 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. Conjugate gradient-type iterations which are based on a variant of the nonsymmetric Lanczos algorithm for complex symmetric matrices are investigated. In particular, a new approach with iterates defined by a quasi-minimal residual property is proposed. The resulting algorithm presents several advantages over the standard biconjugate gradient method. Some remarks are also included 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
Saad, Y., & Schultz, M. H. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907058 · Cited by 11,154
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Methods of conjugate gradients for solving linear systems
Hestenes, M. R., & Stiefel, E. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.044 · Cited by 8,132
Lanczos, C. (1950) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.045.026 · Cited by 4,391
Solution of Sparse Indefinite Systems of Linear Equations
Paige, C. C., & Saunders, M. A. (1975) · SIAM Journal on Numerical Analysis · doi:10.1137/0712047 · Cited by 1,620
CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
Sonneveld, P. (1989) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0910004 · Cited by 1,169
Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
Eisenstat, S. C., Elman, H. C., & Schultz, M. H. (1983) · SIAM Journal on Numerical Analysis · doi:10.1137/0720023 · Cited by 929
Solution of systems of linear equations by minimized iterations
Lanczos, C. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.006 · Cited by 929
Conjugate gradient methods for indefinite systems
Fletcher, R. (1976) · Lecture notes in mathematics · doi:10.1007/bfb0080116 · Cited by 802
Exact non-reflecting boundary conditions
Keller, J. B., & Givoli, D. (1989) · Journal of Computational Physics · doi:10.1016/0021-9991(89)90041-7 · Cited by 645
On the partial realization problem
Gragg, W. B., & Lindquist, A. (1983) · Linear Algebra and its Applications · doi:10.1016/0024-3795(83)90059-9 · Cited by 274
Cited by
Iterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790
The discrete-dipole-approximation code ADDA: Capabilities and known limitations
Yurkin, M. A., & Hoekstra, A. G. (2011) · Journal of Quantitative Spectroscopy and Radiative Transfer · doi:10.1016/j.jqsrt.2011.01.031 · Cited by 706
High-resolution tensor MR elastography for breast tumour detection
Sinkus, R., Lorenzen, J., Schrader, D., Lorenzen, M., Dargatz, M., & Holz, D. (2000) · Physics in Medicine and Biology · doi:10.1088/0031-9155/45/6/317 · Cited by 481
Iterative solution of linear systems
Freund, R. W., Golub, G. H., & Nachtigal, N. M. (1992) · Acta Numerica · doi:10.1017/s0962492900002245 · Cited by 434
Self-citationRecent computational developments in Krylov subspace methods for linear systems
Simoncini, V., & Szyld, D. B. (2007) · Numerical Linear Algebra with Applications · doi:10.1002/nla.499 · Cited by 375
Metadata
- Authors
- Freund, R. W.
- Venue
- SIAM Journal on Scientific and Statistical Computing
- Published
- 1992-01
- Volume
- 13
- Issue
- 1
- Pages
- 425-448
- ISSN
- 0196-5204 (ISSN-L)
- 2168-3417
- OpenAlex
- W2044180130
- Cited by
- 371
- References
- 11
- FWCI
- 19.54
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.