A Dual Method for Discrete Chebychev Curve Fitting with Linear Restrictions on the Parameters.

Abstract

The L at infinity norm has been widely studied as a criterion for curve fitting problems. This paper presents an algorithm to solve discrete approximation problems in the L at infinity norm when the parameters are restricted by linear constraints. The algorithm is a special-purpose linear programming dual method which employs a reduced bases and multiple pivots. Results of the computational experience with a computer code version of the algorithm are presented. (Author

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1979
Accession Number
ADA078623

Entities

People

  • Michael G. Sklar
  • Ronald D. Armstrong

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computers
  • Curve Fitting
  • Equations
  • Heuristic Methods
  • Intervals
  • Linear Programming
  • New York
  • Residuals
  • Simplex Method
  • Statistical Data
  • Vector Spaces

Readers

  • Approximation Theory.
  • Operations Research