Knot Selection for Least Squares Thin Plate Splines.

Abstract

An algorithm for selection of knot point locations for approximation of functions from large sets of scattered data by least squares Thin Plate Splines is given. The algorithm is based on the idea that each data point is equally important in defining the surface, which allows the knot selection process to be decoupled from the least squares. Properties of the algorithm are investigated, and examples demonstrating it are given. Results of some least squares approximate are given and compared with other approximation methods. Keywords: Variables; Knot selection, Least squares, Thin plate splines, Dirichlet tesselation; Scattered data. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1987
Accession Number
ADA185681

Entities

People

  • John R. Mcmahon
  • Richard Franke

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programs
  • Computer Science
  • Computers
  • Data Science
  • Data Sets
  • Differential Equations
  • Equations
  • Information Science
  • Mathematics
  • Military Research
  • Research Facilities
  • Schools
  • Standards
  • Statistics
  • United States
  • United States Military Academy

Readers

  • Electromagnetic Wave Scattering and Antenna Radiation Engineering
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Graph Algorithms and Convex Optimization.