Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms
نویسندگان
چکیده
منابع مشابه
Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms
We give a detailed study of the semiconvergence behavior of projected nonstationary simultaneous iterative reconstruction technique (SIRT) algorithms, including the projected Landweber algorithm. We also consider the use of a relaxation parameter strategy, proposed recently for the standard algorithms, for controlling the semiconvergence of the projected algorithms. We demonstrate the semiconve...
متن کاملSemi-convergence and Relaxation Parameters for a Class of Sirt Algorithms∗
This paper is concerned with the Simultaneous Iterative Reconstruction Technique (SIRT) class of iterative methods for solving inverse problems. Based on a careful analysis of the semi-convergence behavior of these methods, we propose two new techniques to specify the relaxation parameters adaptively during the iterations, so as to control the propagated noise component of the error. The advant...
متن کاملtechnical and legal parameters for determination of river boundary,( case study haraz river)
چکیده با توسعه شهر نشینی و دخل و تصرف غیر مجاز در حریم رودخانه ها خسارات زیادی به رودخانه و محیط زیست اطراف آن وارده می شود. در حال حاضر بر اساس آئین نامه اصلاح شده بستر و حریم رودخانه ها، حریم کمی رودخانه که بلافاصله پس از بستر قرار می گیرد از 1 تا20 متر از منتهی الیه طرفین بستر رودخانه تعیین، که مقدار دقیق آن در هر بازه از رودخانه مشخص نیست. در کشورهای دیگر روشهای متفاوتی من جمله: درصد ریسک...
15 صفحه اولProjected Gradient Flows for BV / Level Set Relaxation
This paper introduces a new level set method based on projected gradient flows for problems that can be solved by a recently introduced relaxation approach. For the class of problems the relaxation is exact, it can be shown that the solution of the flow converges to a solution of the relaxed problem for large time, and the level sets of the limit are solutions of the original problem. We introd...
متن کاملA Projected Gradient Algorithm for Solving the Maxcut Sdp Relaxation∗
In this paper, we develop a specialized algorithm for solving the semidefinite programming (SDP) relaxation of the maximum cut (maxcut) problem. The maxcut problem has many applications, e.g., in VLSI design and statistical physics (see [2, 4, 5, 19, 21]). Several algorithms have been proposed to find either exact or approximate solutions to this problem. As for many combinatorial optimization ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2012
ISSN: 1064-8275,1095-7197
DOI: 10.1137/110834640