Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
نویسندگان
چکیده
منابع مشابه
Nonsymmetric multigrid preconditioning for conjugate gradient methods
We numerically analyze the possibility of turning off post-smoothing (relaxation) in geometric multigrid used as a preconditioner in conjugate gradient linear and eigenvalue solvers for the 3D Laplacian. The geometric Semicoarsening Multigrid (SMG) method is provided by the hypre parallel software package. We solve linear systems using two variants (standard and flexible) of the preconditioned ...
متن کاملMcgs: a Modiied Conjugate Gradient Squared Algorithm for Nonsymmetric Linear Systems
The conjugate gradient squared (CGS) algorithm is a Krylov subspace algorithm that can be used to obtain fast solutions for linear systems (Ax = b) with complex nonsymmetric, very large, and very sparse coeecient matrices (A). By considering electromagnetic scattering problems as examples, a study of the performance and scalability of this algorithm on two MIMD machines is presented. A modiied ...
متن کاملAnalysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems
In this paper we analyze the bi-conjugate gradient algorithm in finite precision arithmetic, and suggest reasons for its often observed robustness. By using a tridiagonal structure, which is preserved by the finite precision bi-conjugate gradient iteration, we are able to bound its residual norm by a minimum polynomial of a perturbed matrix (i.e. the residual norm of the exact GMRES applied to ...
متن کاملMCGS A Modi ed Conjugate Gradient Squared Algorithm for Nonsymmetric Linear Systems
The conjugate gradient squared CGS algorithm is a Krylov subspace algorithm that can be used to obtain fast solutions for linear systems Ax b with complex nonsymmetric very large and very sparse coe cient matrices A By considering electromagnetic scattering problems as examples a study of the performance and scalability of this algorithm on two MIMD machines is presented A modi ed CGS MCGS algo...
متن کاملA Three-terms Conjugate Gradient Algorithm for Solving Large-Scale Systems of Nonlinear Equations
Nonlinear conjugate gradient method is well known in solving large-scale unconstrained optimization problems due to it’s low storage requirement and simple to implement. Research activities on it’s application to handle higher dimensional systems of nonlinear equations are just beginning. This paper presents a Threeterm Conjugate Gradient algorithm for solving Large-Scale systems of nonlinear e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1985
ISSN: 0025-5718
DOI: 10.2307/2007961