Fetching the paper…
Reading the bibliography…
We present a systematic study on the linear convergence rates of the powers of (real or complex) matrices.
K. Hensel, Über Potenzreihen von Matrizen, J. Reine Angew. Math. 155, pp. 107–110, 1926
1926
Earlier work this paper cites.
R. Oldenburger, Infinite powers of matrices and characteristic roots, Duke Math. J. 6, pp. 357–361, 1940
1940
Earlier work this paper cites.
J. Douglas and H.H. Rachford, On the numerical solution of heat conduction problems in two and three space variables, Trans. Amer. Math. Soc. 82, pp. 421–439, 1956
1956
Earlier work this paper cites.
L.G. Gubin, B.T. Polyak, and E.V. Raik, The method of projections for finding the common point of convex sets, USSR Comp. Math. Math. Phys. 7, pp. 1–24, 1967
1967
Earlier work this paper cites.
A. Björck and G.H. Golub, Numerical methods for computing angles between linear subspaces, Math. Comp. 27, pp. 579–594, 1973
1973
Earlier work this paper cites.
C.D. Meyer and R.F. Plemmons, Convergent powers of a matrix with applications to iterative methods for singular linear systems, SIAM J. Numer. Anal. , pp. 669–705, 1977
1977
Earlier work this paper cites.
P.-L. Lions and B. Mercier, Splitting algorithms for the sum of two nonlinear operators, SIAM J. Numer. Anal. 16, pp. 964–979, 1979
1979
Earlier work this paper cites.
S. Nelson and M. Neumann, Generalizations of the projection method with applications to SOR theory for Hermitian positive semidefinite linear systems, Numer. Math. 51, pp. 123–141, 1987
1987
Earlier work this paper cites.
W.B. Gearhart and M. Koshy, Acceleration schemes for the method of alternating projections, J. Comp. Appl. Math. 26, pp. 235–249, 1989
1989
Earlier work this paper cites.
J. Eckstein and D.P. Bertsekas, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators, Math. Program. 55, pp. 293–318, 1992
1992
Earlier work this paper cites.
J. Miao and A. Ben-Israel, On principal angles between subspaces in ℝ n \mathbb{R}^{n} , Linear Algebra Appl. 171, pp. 81–98, 1992
1992
Earlier work this paper cites.
F. Deutsch, The angle between subspaces of a Hilbert space, in Approximation Theory, Wavelets and Applications , S.P. Singh (editor), Kluwer, 1995, pp. 107–130
1995
Cited alongside, same era.
H.H. Bauschke and J.M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Rev. 38, pp. 367–426, 1996
1996
Cited alongside, same era.
S. Kayalar and H. Weinert, Error bounds for the method of alternating projections, Math. Control Signals Systems 1, pp. 43–59, 1996
1996
Cited alongside, same era.
C.D. Meyer, Matrix Analysis and Applied Linear Algebra , SIAM, 2000
2000
Cited alongside, same era.
F. Deutsch, Best Approximation in Inner Product Spaces , Springer, 2001
2001
Cited alongside, same era.
A. Cegielski and A. Suchocka, Relaxed alternating projection methods, SIAM J. Optim. 19, pp. 1093–1106, 2008
2008
Later among the works it cites.
D.R. Luke, Finding best approximation pairs relative to a convex and prox-regular set in a Hilbert space, SIAM J. Optim. 19, pp. 714–739, 2008
2008
Later among the works it cites.
S. Kirkland, A cycle-based bound for subdominant eigenvalues of stochastic matrices, Linear Multilinear Algebra 57, pp. 247–266, 2009
2009
Later among the works it cites.
T. Elfving, P.C. Hansen and T. Nikazad, Semi-convergence and relaxation parameters for a class of SIRT algorithms, Electronic Transactions on Numerical Analysis 37, pp. 321–336, 2010
2010
Later among the works it cites.
H.H. Bauschke and P.L. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces , Springer, 2011
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
H.H. Bauschke, F. Deutsch, H. Hundal, and S.-H. Park, Accelerating the convergence of the method of alternating projections, Trans. Amer. Math. Soc. 355, pp. 3433–3461, 2003
2003
Cited alongside, same era.
Y. Saad, Iterative Methods for Sparse Linear Systems , SIAM, 2003
2003
Cited alongside, same era.
H.H. Bauschke and S.G. Kruk, Reflection-projection method for convex feasibility problems with an obtuse cone, J. Optim. Theory Appl. 120, pp. 503–531, 2004
2004
Cited alongside, same era.
H.H. Bauschke, P.L. Combettes, and S.G. Kruk, Extrapolation algorithm for affine-convex feasibility problems, Numer. Algorithms 4, pp. 239–274, 2006
2006
Cited alongside, same era.
Y. Censor, T. Elfving, G.T. Herman and T. Nikazad, On diagonally relaxed orthogonal projection methods, SIAM J. Sci. Comput. 30, pp. 473–504, 2007/08
2007
Cited alongside, same era.
GNU Plot, http://sourceforge.net/projects/gnuplot
Cited in the paper.
The Julia language, http://julialang.org/
Cited in the paper.
C. Badea, S. Grivaux, and V. Müller, The rate of convergence in the method of alternating projections, St. Petersburg Math. J. 23, pp. 673–686, 2012
2012
Later among the works it cites.
A. Cegielski, Iterative Methods for Fixed Point Problems in Hilbert Spaces
2012
Later among the works it cites.
H.H. Bauschke, J.Y. Bello Cruz, T.T.A. Nghia, H.M. Phan, and X. Wang, The rate of linear convergence of the Doughlas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle, J. Approx. Theory , in press (2014) DOI: 10.1016/j.jat.2014.06.002
2014
Closest in time.
L. Demanet and X. Zhang, Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit, Math. Comput. , in press, 2014
2014
Closest in time.