On the iterative solution of systems of the form ATA x=ATb+c

Abstract. Given a full column rank matrix A ∈ R (m ≥ n), we consider a special class of linear systems of the form AAx = Ab+ c with x, c ∈ R and b ∈ R. The occurrence of c in the right-hand side of the equation prevents the direct application of standard methods for least squares problems. Hence, we investigate alternative solution methods that, as in the case of normal equations, take advantage of the peculiar structure of the system to avoid unstable computations, such as forming AA explicitly. We propose two iterative methods that are based on specific reformulations of the problem and we provide explicit closed formulas for the structured condition number related to each problem. These formula allow us to compute a more accurate estimate of the forward error than the standard one used for generic linear systems, that does not take into account the structure of the perturbations. The relevance of our estimates is shown on a set of synthetic test problems. Numerical experiments highlight both the increased robustness and accuracy of the proposed methods compared to the standard conjugate gradient method. It is also found that the new methods can compare to standard direct methods in terms of solution accuracy.

[1]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[2]  Charles L. Lawson,et al.  Solving least squares problems , 1976, Classics in applied mathematics.

[3]  S. Gratton,et al.  Structured Backward Error and Condition Number for Linear Systems of the Type A* Ax = b , 2000 .

[4]  David Titley-Péloquin,et al.  Backward perturbation analysis for scaled total least-squares problems , 2009, Numer. Linear Algebra Appl..

[5]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[6]  Serge Gratton,et al.  On the condition number of linear least squares problems in a weighted Frobenius norm , 1996 .

[7]  A. Greenbaum Estimating the Attainable Accuracy of Recursively Computed Residual Methods , 1997, SIAM J. Matrix Anal. Appl..

[8]  Xiaojun Chen,et al.  Structured backward errors for generalized saddle point systems , 2012 .

[9]  J. Navarro-Pedreño Numerical Methods for Least Squares Problems , 1996 .

[10]  Henri Calandra,et al.  On High-Order Multilevel Optimization Strategies , 2019, SIAM J. Optim..

[11]  Ji-Guang Sun,et al.  Optimal backward perturbation bounds for the linear least squares problem , 1995, Numer. Linear Algebra Appl..

[12]  Michael A. Saunders,et al.  LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares , 1982, TOMS.

[13]  Mei Han An,et al.  accuracy and stability of numerical algorithms , 1991 .

[14]  Ji-guang Sun Structured backward errors for KKT systems , 1999 .

[15]  I. Duff,et al.  The factorization of sparse symmetric indefinite matrices , 1991 .

[16]  Ron Estrin,et al.  LNLQ: An Iterative Method for Least-Norm Problems with an Error Minimization Property , 2018, SIAM J. Matrix Anal. Appl..

[17]  J. Rice A Theory of Condition , 1966 .

[18]  Serge Gratton,et al.  A Partial Condition Number for Linear Least Squares Problems , 2007, SIAM J. Matrix Anal. Appl..

[19]  Henri Calandra,et al.  On the approximation of the solution of partial differential equations by artificial neural networks trained by a multilevel Levenberg-Marquardt method , 2019, ArXiv.

[20]  Å. Björck,et al.  Stability of Conjugate Gradient and Lanczos Methods for Linear Least Squares Problems , 1998, SIAM J. Matrix Anal. Appl..

[21]  Na Zhao,et al.  Linearization estimates of the backward errors for least squares problems , 2012, Numer. Linear Algebra Appl..

[22]  N. Higham,et al.  Backward Error Bounds for Constrained Least Squares Problems , 1999 .

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

[24]  Jorge J. Moré,et al.  Benchmarking optimization software with performance profiles , 2001, Math. Program..