Solving the full rank interval least squares problem

From MaRDI portal





The aim of the paper is to find an inclusion for the solutions of the interval least squares problem \(\|Ax-b\|_2\) where \(A\) is a full rank \(m\times n\) interval matrix and \(b\) an interval vector of length \(m\). That is, the inclusion has to contain the solutions of all point least squares problems which are covered by the interval problem. The proposed method for obtaining such an inclusion is based on an interval version of the QR factorization which is combined with preconditioning steps.











This page was built for publication: Solving the full rank interval least squares problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1602750)