On a class of algorithms for total approximation

Rate of convergence, degree of approximation (41A25) Approximation with constraints (41A29) Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Review text

Let A be a given \(m\times n\) matrix and let \(b\in {\mathbb{R}}^ n\) with \(m>n\) and define \(Z:=(A,b)\). The following total approximation problem is considered: Find \(v\in {\mathbb{R}}^{n+1}\) to minimize \(\| Zv\|_ p\) such that \(\| v'\|_ q=1\) where \(p+q=pq\) and v' is obtained from v by deleting the first k components (usually \(k=0)\). A class of algorithms is proposed and a local convergence analysis as well as a partial global convergence analysis for it are given.

Recommendations

Cites work

Cited in

(14)

This page was built for publication: On a class of algorithms for total approximation

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