Discrete, linear approximation problems in polyhedral norms
From MaRDI portal
Publication:1229548
DOI10.1007/BF01395971zbMath0335.65003MaRDI 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
65D10: Numerical smoothing, curve fitting
41A10: Approximation by polynomials
65D15: Algorithms for approximation of functions
Related Items
Strong uniqueness and second order convergence in nonlinear discrete approximation, 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