Fixed- and Free-Knot Univariate Least-Squares Data Approximation by Polynomial Splines

Abstract

Fixed- and free-knot least-squares data approximation by polynomial splines is considered. Classes of knot-placement algorithms are discussed. A practical example of knot placement is presented, and future possibilities in free-knot spline approximation are addressed.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 2001
Accession Number
ADP013744

Entities

People

  • Maurice Cox
  • Paul Kenward
  • Peter Harris

Organizations

  • National Physical Laboratory

Tags

Communities of Interest

  • Engineered Resilient Systems

DTIC Thesaurus Topics

  • Algorithms
  • Band Structures
  • Coefficients
  • Computational Complexity
  • Computational Science
  • Computers
  • Curve Fitting
  • Data Sets
  • Differential Equations
  • Floating Point Operations
  • Interpolation
  • Measurement
  • Numerical Analysis
  • Optimization
  • Polynomials
  • Standards
  • Thermophysical Properties

Readers

  • Approximation Theory.