Conjugate gradient and minimal residual method for solving symmetric indefinite systems

DOI10.1016/S0377-0427(97)00127-1zbMath0888.65025OpenAlexW1976157534WikidataQ126382616 ScholiaQ126382616MaRDI QIDQ1372089

Wen-Wei Lin, Yu-Ling Lai, Dan'l Pierce

Publication date: 11 June 1998

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(97)00127-1

zbMATH Keywords

numerical examplesminimal residual methodlarge sparse linear systemsconjugate gradientKrylov subspacesymmetric indefinite systems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Related Items (1)

Conjugate gradient method for finding fundamental solitary waves

Uses Software

• Harwell-Boeing sparse matrix collection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• The convergence rate of the minimal residual method for the Stokes problem
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Solution of Sparse Indefinite Systems of Linear Equations
• Continuation and Local Perturbation for Multiple Bifurcations
• Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
• Deferment of Computation in the Method of Least Squares
• The Conjugate Residual Method for Constrained Minimization Problems
• Methods of conjugate gradients for solving linear systems

This page was built for publication: Conjugate gradient and minimal residual method for solving symmetric indefinite systems