Towards A Backward Perturbation Analysis For Data Least Squares Problems
نویسندگان
چکیده
Given an approximate solution to a data least squares (DLS) problem, we would like to know its minimal backward error. Here we derive formulas for what we call an “extended” minimal backward error, which is at worst a lower bound on the minimal backward error. When the given approximate solution is a good enough approximation to the exact solution of the DLS problem (which is the aim in practice), the extended minimal backward error is the actual minimal backward error, and this is also true in other easily assessed and common cases. Since it is computationally expensive to compute the extended minimal backward error directly, we derive a lower bound on it and an asymptotic estimate for it, both of which can be evaluated less expensively. Simulation results show that for reasonable approximate solutions the lower bound has the same order as the extended minimal backward error, and the asymptotic estimate is an excellent approximation to the extended minimal backward error.
منابع مشابه
Backward perturbation analysis for scaled total least-squares problems
The scaled total least-squares (STLS) method unifies the ordinary least-squares (OLS), the total leastsquares (TLS), and the data least-squares (DLS) methods. In this paper we perform a backward perturbation analysis of the STLS problem. This also unifies the backward perturbation analyses of the OLS, TLS and DLS problems. We derive an expression for an extended minimal backward error of the ST...
متن کاملBackward Perturbation Bounds for Linear Least Squares Problems
Recently, Higham and Wald en, Karlson, and Sun have provided formulas for computing the best backward perturbation bounds for the linear least squares problem. In this paper we provide several backward perturbation bounds that are easier to compute and optimal up to a factor less than 2. We also show that any least squares algorithm that is stable in the sense of Stewart is necessarily a backwa...
متن کاملEstimation of Backward Perturbation Bounds for Linear Least Squares Problem
Waldén, Karlson, and Sun found an elegant explicit expression of backward error for the linear least squares problem. However, it is difficult to compute this quantity as it involves the minimal singular value of certain matrix. In this paper we present a simple estimation to this bound which can be easily computed especially for large problems. Numerical results demonstrate the validity of the...
متن کاملEstimates of Optimal Backward Perturbations for Linear Least Squares Problems∗
Numerical tests are used to validate a practical estimate for the optimal backward errors of linear least squares problems. This solves a thirty-year-old problem suggested by Stewart and Wilkinson.
متن کاملOn the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem
The following linear inverse problem is considered: given a full column rank m n data matrix A and a length m observation vector b, nd the best least squares solution to Ax = b with at most r < n nonzero components. The backward greedy algorithm computes a sparse solution to Ax = b by removing greedily columns from A until r columns are left. A simple implementation based on a QR downdating sch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 30 شماره
صفحات -
تاریخ انتشار 2008