A linear programming algorithm for curve fitting in the L∞norm

DOI10.1080/01630568008816053zbMath0448.65008MaRDI QIDQ3894859

Michael G. Sklar, Ronald D. Armstrong

Publication date: 1980

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630568008816053

zbMATH Keywords

algorithm; linear programming method; Chebyshev approximation; discrete approximation problems

Mathematics Subject Classification ID

65D10: Numerical smoothing, curve fitting

65F20: Numerical solutions to overdetermined systems, pseudoinverses

65K05: Numerical mathematical programming methods

90C05: Linear programming

65D15: Algorithms for approximation of functions

65-04: Software, source code, etc. for problems pertaining to numerical analysis

Related Items

L_∞norm estimation with linear restrictions on the parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Note on Jordan elimination, linear programming and Tchebyscheff approximation
• On L1 and Chebyshev estimation
• Chebyshev solution of overdetermined systems of linear equations
• Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]
• On the Best Linear Chebyshev Approximation
• An Explicit Solution of a Special Class of Linear Programming Problems
• The simplex method of linear programming using LU decomposition
• Applications of Linear Programming to Numerical Analysis
• Optimality and Degeneracy in Linear Programming