The Best Parameter Subset Using the Chebychev Curve Fitting Criterion.

Abstract

The Chebychev (also Minimax and L to infinity Norm) criterion has been widely studied as a method for curve fitting. Published computer codes are available to obtain the optimal parameter estimates to fit a linear function to a set of given points under the Chebychev criterion. The purpose of this paper is to study procedures for obtaining the best subset of k parameters from a given set of m parameters where k is less-than-or-equal-to m. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1981
Accession Number
ADA114327

Entities

People

  • Andrew Armstrong
  • P. Beck

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Computers
  • Curve Fitting
  • Decomposition
  • Iterations
  • Linear Programming
  • Simplex Method
  • Simulations
  • Statistical Analysis
  • Trees (Data Structures)
  • United States
  • United States Government
  • Universities

Fields of Study

  • Mathematics

Readers

  • Positioning, Navigation, and Timing (PNT) Technology.
  • Statistical inference.