A Linear Programming Algorithm for Curve Fitting in the L Infinity Norm

Abstract

The L sub 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 sub infinity norm. The algorithm is a special- purpose linear programming dual method which employs a reduced basis and multiple pivots. Results of the computational experience with a computer code version of the algorithm are presented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1979
Accession Number
ADA080454

Entities

People

  • M. G. Sklar
  • R. D. Armstrong

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Classification
  • Computations
  • Computer Programming
  • Computers
  • Curve Fitting
  • Data Analysis
  • Equations
  • Intervals
  • Iterations
  • Linear Programming
  • Mathematical Programming
  • Numerical Analysis
  • Operations Research
  • Regression Analysis
  • Simplex Method
  • United States Government

Readers

  • Approximation Theory.
  • Operations Research