A dual method for discrete Chebychev curve fitting

DOI10.1007/BF01581640zbMath0442.90052MaRDI QIDQ3885510

David S. Kung, Ronald D. Armstrong

Publication date: 1980

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

regressioncomputational comparisonmin-maxdual algorithmChebyshev approximationoverdetermined system of linear equationsChebyshev curve fitting problemcomputer code implementations

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Linear programming (90C05) Best approximation, Chebyshev systems (41A50) Iterative numerical methods for linear systems (65F10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (7)

A proximal point algorithm for minimax problems ⋮ Estimating the parameters in regression with uniformly distributed errors ⋮ Non-asymptotic bounds for the \(\ell_{\infty}\) estimator in linear regression with uniform noise ⋮ Computational Algorithms for Calculating Least Absolute Value and Chebyshev Estimates for Multiple Regression ⋮ An algorithm for discrete chebychev curve fitting for the simple model using a dual linear programming approach ⋮ The best parameter subset using the Chebychev curve fitting criterion ⋮ Approximation in normed linear spaces

Uses Software

• AS 135

Cites Work

• Unnamed Item
• Unnamed Item
• Über diskrete und lineare Tschebyscheff-Approximationen
• Note on Jordan elimination, linear programming and Tchebyscheff approximation
• Algorithm AS 135: Min-Max Estimates for a Linear Multiple Regression Problem
• A New Algorithm for the Chebyshev Solution of Overdetermined Linear Systems
• Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]
• A Descent Method for the Uniform Solution to Over-Determined Systems of Linear Equations
• Methods—Old and New—for Solving the Tchebycheff Approximation Problem
• Chebyshev Solution of n+1 Linear Equations in n + 1 n Unknowns
• 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

This page was built for publication: A dual method for discrete Chebychev curve fitting