On diagonally relaxed orthogonal projection methods

108Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose and study a block-iterative projection method for solving linear equations and/or inequalities. The method allows diagonal componentwise relaxation in conjunction with orthogonal projections onto the individual hyperplanes of the system, and is thus called diagonally relaxed orthogonal projections (DROP). Diagonal relaxation has proven useful in accelerating the initial convergence of simultaneous and block-iterative projection algorithms, but until now it was available only in conjunction with generalized oblique projections in which there is a special relation between the weighting and the oblique projections. DROP has been used by practitioners, and in this paper a contribution to its convergence theory is provided. The mathematical analysis is complemented by some experiments in image reconstruction from projections which illustrate the performance of DROP. © 2008 Society for Industrial and Applied Mathematics.

Cite

CITATION STYLE

APA

Censor, Y., Elfving, T., Herman, G. T., & Nikazad, T. (2007). On diagonally relaxed orthogonal projection methods. SIAM Journal on Scientific Computing, 30(1), 473–504. https://doi.org/10.1137/050639399

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free