Convergence and Semi-Convergence of a Class of Constrained Block Iterative Methods

نویسندگان

چکیده

In this paper, we analyze the convergence properties of projected non-stationary block iterative methods (P-BIM) aiming to find a constrained solution large linear, usually both noisy and ill-conditioned, systems equations. We split error kth iterate into noise iteration error, consider each separately. The is treated for more general algorithm, also suited solving feasibility problems in Hilbert space. results P-BIM come out as special case. algorithmic step involves projecting onto closed convex sets. When these sets are polyhedral, finite dimension, it shown that algorithm converges linearly. further derive an upper bound P-BIM. Based on bound, suggest new strategy choosing relaxation parameters, which assist speeding up reconstruction process improving quality obtained images. parameters may depend noise. performance suggested by examples taken from field image projections.

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

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

منابع مشابه

Convergence of the Iterative Methods

In a previous paper, we introduced a coordinate-splitting (CS) form of the equations of motion for multibody systems which together with a modiied nonlinear iteration (CM), is particularly eeective in the solution of certain nonlinear highly oscillatory systems. In this paper, we examine the convergence of the CS and CM iterations and explain the improved convergence of the CM iteration. An exa...

متن کامل

Semi-convergence of an Iterative Algorithm

An iterative method is introduced for solving noisy, ill-conditioned inverse problems. Analysis of the semi-convergence behavior identifies three error components iteration error, noise error, and initial guess error. A derived expression explains how the three errors are related to each other relative to the number of iterations. The Standard Tikhonov regularization method is just the first it...

متن کامل

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


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

ژورنال

عنوان ژورنال: Numerical Functional Analysis and Optimization

سال: 2021

ISSN: ['1532-2467', '0163-0563']

DOI: https://doi.org/10.1080/01630563.2021.2001822