Discrete, linear approximation problems in polyhedral norms

DOI10.1007/BF01395971zbMath0335.65003OpenAlexW4253424600MaRDI QIDQ1229548

D. H. Anderson, Michael R. Osborne

Publication date: 1976

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132408

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Approximation by polynomials (41A10) Algorithms for approximation of functions (65D15)

Related Items

Strong uniqueness and second order convergence in nonlinear discrete approximation, Voronoi polytopes for polyhedral norms on lattices, Linear best approximation using a class of polyhedral norms, Discrete, non-linear approximation problems in polyhedral norms, Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Über diskrete und lineare Tschebyscheff-Approximationen
• Note on Jordan elimination, linear programming and Tchebyscheff approximation
• Methods for Modifying Matrix Factorizations
• On the Best Linear Chebyshev Approximation
• On an algorithm for discrete nonlinear L1 approximation
• On the solution of nonlinear equations in interval arithmetic