On the Meany inequality with applications to convergence analysis of several row-action iteration methods

The Meany inequality gives an upper bound in the Euclidean norm for a product of rank-one projection matrices. In this paper we further derive a lower bound related to this inequality. We discuss the internal relationship between the upper bounds given by the Meany inequality and by the inequality in Smith et al. (Bull Am Math Soc 83:1227–1270, 1977) in the finite dimensional real linear space. We also generalize the Meany inequality to the block case. In addition, by making use of the block Meany inequality, we improve existing results and establish new convergence theorems for row-action iteration schemes such as the block Kaczmarz and the Householder–Bauer methods used to solve large linear systems and least-squares problems.

[1]  A Matrix Inequality , 1969 .

[2]  Howard L. Weinert,et al.  Error bounds for the method of alternating projections , 1988, Math. Control. Signals Syst..

[3]  Yair Censor,et al.  Parallel application of block-iterative methods in medical imaging and radiation therapy , 1988, Math. Program..

[4]  Y. Saad,et al.  Iterative solution of linear systems in the 20th century , 2000 .

[5]  Wim Spakman,et al.  Imaging algorithms, accuracy and resolution in delay time tomography , 1988 .

[6]  Gene H. Golub,et al.  Matrix computations , 1983 .

[7]  Hein Hundal,et al.  The Rate of Convergence for the Method of Alternating Projections, II , 1997 .

[8]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[9]  Rainer Ansorge,et al.  Connections between the Cimmino-method and the Kaczmarz-method for the solution of singular and regular systems of equations , 1984, Computing.

[10]  F. Deutsch.  Rate of Convergence of the Method of Alternating Projections , 1984 .

[11]  Åke Björck,et al.  Numerical methods for least square problems , 1996 .

[12]  M. Trummer.  SMART — An algorithm for reconstructing pictures from projections , 1983 .

[13]  Jun-Feng Yin,et al.  GMRES Methods for Least Squares Problems , 2010, SIAM J. Matrix Anal. Appl..

[14]  Claude Brezinski,et al.  Acceleration procedures for matrix iterative methods , 2000, Numerical Algorithms.

[15]  Constantin Popa,et al.  Constrained Kaczmarz extended algorithm for image reconstruction , 2008 .

[16]  Y. Censor.  Row-Action Methods for Huge and Sparse Systems and Their Applications , 1981 .

[17]  Å. Björck,et al.  Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations , 1979 .

[18]  N. Aronszajn.  Theory of Reproducing Kernels. , 1950 .

[19]  C. Popa.  Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems , 1998 .

[20]  Kennan T. Smith,et al.  Practical and mathematical aspects of the problem of reconstructing objects from radiographs , 1977 .

[21]  C. Popa.  Block-Projections Algorithms with Blocks Containing Mutually Orthogonal Rows and Columns , 1999 .

[22]  T. Whitney,et al.  Two Algorithms Related to the Method of Steepest Descent , 1967 .

[23]  K. Tanabe.  Projection method for solving a singular system of linear equations and its applications , 1971 .

[24]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[25]  Ahmed H. Sameh,et al.  Row Projection Methods for Large Nonsymmetric Linear Systems , 1992, SIAM J. Sci. Comput..

[26]  Manfred R. Trummer.  Reconstructing pictures from projections: On the convergence of the ART algorithm with relaxation , 2005, Computing.

[27]  Claude Brezinski,et al.  Projection methods for systems of equations , 1997 .

[28]  Claude Brezinski,et al.  Projection methods for linear systems , 1997 .

[29]  Keiichi Morikuni,et al.  Inner-Iteration Krylov Subspace Methods for Least Squares Problems , 2013, SIAM J. Matrix Anal. Appl..

[30]  Alston S. Householder,et al.  On certain iterative methods for solving linear systems , 1960 .