Superoptimal Preconditioned Conjugate Gradient Iteration for Image Deblurring
نویسندگان
چکیده
منابع مشابه
Superoptimal Preconditioned Conjugate Gradient Iteration for Image Deblurring
We study the superoptimal Frobenius operators in the two-level circulant algebra. We consider two specific viewpoints: (1) the regularizing properties in imaging and (2) the computational effort in connection with the preconditioned conjugate gradient method. Some numerical experiments illustrating the effectiveness of the proposed technique are given and discussed.
متن کاملPreconditioned Conjugate Gradient Method for Boundary Artifact-Free Image Deblurring
Several methods have been proposed to reduce boundary artifacts in image deblurring. Some of those methods impose certain assumptions on image pixels outside the field-of-view; the most important of these assume reflective or anti-reflective boundary conditions. Boundary condition methods, including reflective and anti-reflective ones, however, often fail to reduce boundary artifacts, and, in s...
متن کاملInexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
An important variation of preconditioned conjugate gradient algorithms is inexact precon-ditioner implemented with inner-outer iterations 5], where the preconditioner is solved by an inner iteration to a prescribed precision. In this paper, we formulate an inexact preconditioned conjugate gradient algorithm for a symmetric positive deenite system and analyze its convergence property. We establi...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2005
ISSN: 1064-8275,1095-7197
DOI: 10.1137/s1064827503421653