Exact and inexact breakdowns in the block GMRES method

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Block GMRES Method with Inexact Breakdowns and Deflated Restarting

We consider the solution of large linear systems with multiple right-hand sides using a block GMRES approach. We introduce a new algorithm that effectively handles the situation of almost rank deficient block generated by the block Arnoldi procedure and that enables the recycling of spectral information at restart. The first feature is inherited from an algorithm introduced by Robbé and Sadkane...

متن کامل

Dynamic block GMRES: an iterative method for block linear systems

We present variants of the block-GMRES(m) algorithms due to Vital and the block-LGMRES(m,k) by Baker, Dennis and Jessup, obtained with replacing the standard QR factorization by a rank-revealing QR factorization in the Arnoldi process. The resulting algorithm allows for dynamic block deflation whenever there is a linear dependency between the Krylov vectors or the convergence of a right-handsid...

متن کامل

Inexact GMRES for singular linear systems

Inexact Krylov subspace methods have been shown to be practical alternatives for the solution of certain linear systems of equations. In this paper, the solution of singular systems with inexact matrix-vector products is explored. Criteria are developed to prescribe how inexact the matrix-vector products can be, so that the computed residual remains close to the true residual, thus making the i...

متن کامل

Restarted GMRES with Inexact Matrix-Vector Products

This paper discusses how to control the accuracy of inexact matrix-vector products in restarted GMRES. We will show that the GMRES iterations can be performed with relatively low accuracy. Furthermore, we will study how to compute the residual at restart and propose suitable strategies to control the accuracy of the matrix-vector products in this computation.

متن کامل

Inexact uniformization and GMRES methods for large Markov chains

Inexact algorithms allow certain operations (typically matrix–vector products or certain function evaluations) to be performed inexactly, either out of necessity or deliberately, in view of trading accuracy for speed. We review recent findings that show the impact of the inexact approach in the uniformization and generalized minimal residual (GMRES) methods when computing the transient, station...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2006

ISSN: 0024-3795

DOI: 10.1016/j.laa.2006.04.018