On a class of algorithms for total approximation

DOI10.1016/0021-9045(85)90047-4zbMath0582.65006OpenAlexW2092086025MaRDI QIDQ1068508

G. Alistair Watson

Publication date: 1985

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(85)90047-4

zbMATH Keywords

global convergencelocal convergencelinear data fittingtotal approximation problem

Mathematics Subject Classification ID

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

Related Items

Nonlinear eigenvector algorithms for local optimization in multivariate data analysis, On a general class of matrix nearness problems, Optimal scaling by alternating length-constrained nonnegative least squares, with application to distance-based analysis, Structured total least squares and \(L_ 2\) approximation problems, Approximation in normed linear spaces

Cites Work

• Unnamed Item
• Unnamed Item
• An Analysis of the Total Least Squares Problem
• An Analysis of the Total Approximation Problem in Separable Norms, and an Algorithm for the Total $l_1 $ Problem
• Numerical Methods for Linear Orthogonal L_p Approximation