Convergence acceleration of preconditioned conjugate gradient solver based on error vector sampling for a sequence of linear systems
نویسندگان
چکیده
In this article, we focus on solving a sequence of linear systems that have identical (or similar) coefficient matrices. For type problem, investigate subspace correction (SC) and deflation methods, which use an auxiliary matrix (subspace) to accelerate the convergence iterative method. practical simulations, these acceleration methods typically work well when range contains eigenspaces corresponding small eigenvalues matrix. We develop new algebraic construction method based error vector sampling in eigenvectors with are efficiently identified solution process. generated for following step. Numerical tests confirm both SC can process solver. Furthermore, examine applicability our technique estimation condition number also present algorithm preconditioned conjugate gradient estimation.
منابع مشابه
A fast algebraic multigrid preconditioned conjugate gradient solver
This work presents a new approach for selecting the coarse grids allowing a faster algebraic multigrid (AMG) preconditioned conjugate gradient solver. This approach is based on an appropriate choice of the parameter a considering the matrix density during the coarsening process which implies in a significant reduction in the matrix dimension at all AMG levels. 2005 Elsevier Inc. All rights rese...
متن کاملapplication of upfc based on svpwm for power quality improvement
در سالهای اخیر،اختلالات کیفیت توان مهمترین موضوع می باشد که محققان زیادی را برای پیدا کردن راه حلی برای حل آن علاقه مند ساخته است.امروزه کیفیت توان در سیستم قدرت برای مراکز صنعتی،تجاری وکاربردهای بیمارستانی مسئله مهمی می باشد.مشکل ولتاژمثل شرایط افت ولتاژواضافه جریان ناشی از اتصال کوتاه مدار یا وقوع خطا در سیستم بیشتر مورد توجه می باشد. برای مطالعه افت ولتاژ واضافه جریان،محققان زیادی کار کرده ...
15 صفحه اولA Parallel Preconditioned Conjugate Gradient Package for Solving Sparse Linear Systems on a Cray Y-mp *
In this paper we discuss current activities at Cray Research to develop general-purpose, production-quality software for the eecient solution of sparse linear systems. In particular, we discuss our development of a package of iterative methods that includes Conjugate Gradient and related methods (GMRES, ORTHOMIN and others) along with several preconditioners (incomplete Cholesky and LU factoriz...
متن کاملPreconditioned Conjugate Gradient
.. ................................................................................................................... ix Chapter 1. Introduction ..................................................................................................1 Chapter 2. Background ..................................................................................................6 2.1. Matrix Compu...
متن کاملPreconditioned Conjugate Gradient Schemes
The conjugate gradient method is a powerful algorithm to solve well-structured sparse linear systems that arise from partial diierential equations. We consider here three diierent conjugate gradient schemes for solving elliptic partial diierential equations that arise from 5-point diierence schemes: the classical CG, CG with a block diagonal-block incomplete Cholesky preconditioner and the redu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Linear Algebra With Applications
سال: 2023
ISSN: ['1070-5325', '1099-1506']
DOI: https://doi.org/10.1002/nla.2512