On the Convergence of Iterative Simulation-Based Methods for Singular Linear Systems

We consider simulation-based algorithms for linear systems of equations, Ax = b, where A is singular. The convergence properties of iterative solution methods can be impaired when the methods are implemented with simulation, as is often done in important classes of large-scale problems. We focus on special cases of singular systems, including some arising in approximate dynamic programming, where convergence of the residual sequence may be obtained without a stabilization mechanism, while the sequence of iterates may diverge. For some of these special cases, under additional assumptions, we show that the sequence is guaranteed to converge. For situations where the sequence of iterates diverges, we propose schemes for extracting from the divergent sequence another sequence that converges to a solution of Ax = b. LIDS Report 2879, December 2011 (Revised March 2012) Massachusetts Institute of Technology, Cambridge, MA Laboratory for Information and Decision Systems

[1]  H. Keller On the Solution of Singular and Semidefinite Linear Systems by Iteration , 1965 .

[2]  P. Wedin Perturbation bounds in connection with singular value decomposition , 1972 .

[3]  D. Young On the Consistency of Linear Stationary Iterative Methods , 1972 .

[4]  G. Stewart Introduction to matrix computations , 1973 .

[5]  K. Tanabe Characterization of linear stationary iterative processes for solving a singular system of linear equations , 1974 .

[6]  G. Stewart Perturbation theory for the singular value decomposition , 1990 .

[7]  Achiya Dax The Convergence of Linear Stationary Iterative Processes for Solving Singular Unstructured Systems of Linear Equations , 1990, SIAM Rev..

[8]  G. Stewart,et al.  Matrix Perturbation Theory , 1990 .

[9]  V. N. Bogaevski,et al.  Matrix Perturbation Theory , 1991 .

[10]  Andrew G. Barto,et al.  Linear Least-Squares Algorithms for Temporal Difference Learning , 2005, Machine Learning.

[11]  Dimitri P. Bertsekas,et al.  Least Squares Policy Evaluation Algorithms with Linear Function Approximation , 2003, Discret. Event Dyn. Syst..

[12]  Justin A. Boyan,et al.  Technical Update: Least-Squares Temporal Difference Learning , 2002, Machine Learning.

[13]  Li-Xin Zhang,et al.  A note on the invariance principle of the product of sums of random variables , 2006, math/0610515.

[14]  S. Muthukrishnan,et al.  Sampling algorithms for l2 regression and applications , 2006, SODA '06.

[15]  Dimitri P. Bertsekas,et al.  Convergence Results for Some Temporal Difference Methods Based on Least Squares , 2009, IEEE Transactions on Automatic Control.

[16]  Kamil Marcin Kosi'nski On the functional limits for sums of a function of partial sums , 2009, 1006.0620.

[17]  D. Bertsekas,et al.  Journal of Computational and Applied Mathematics Projected Equation Methods for Approximate Solution of Large Linear Systems , 2022 .

[18]  D. Bertsekas Approximate policy iteration: a survey and some new methods , 2011 .

[19]  Dimitri P. Bertsekas,et al.  Temporal Difference Methods for General Projected Equations , 2011, IEEE Transactions on Automatic Control.