Discrete, linear approximation problems in polyhedral norms

DOI10.1007/BF01395971zbMATH Open0335.65003OpenAlexW4253424600MaRDI QIDQ1229548FDOQ1229548

Authors: 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)

Cites Work

• Methods for Modifying Matrix Factorizations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Note on Jordan elimination, linear programming and Tchebyscheff approximation
• On the Best Linear Chebyshev Approximation
• Über diskrete und lineare Tschebyscheff-Approximationen
• On an algorithm for discrete nonlinear L1 approximation
• On the solution of nonlinear equations in interval arithmetic

Cited In (5)

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

This page was built for publication: Discrete, linear approximation problems in polyhedral norms

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