Knot selection for least squares Thin Plate Splines
By: by John R. McMahon [and] Richard Franke
Contributors: Franke, Richard H.; Naval Postgraduate School (U.S.)
Publisher: Naval Postgraduate School
Published: 1987
Place of publication: Monterey, California
Language: eng
Number of pages: 22
Subjects: Spline theory; Splines; Approximation theory
Description: 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)
Notes: Title from cover.

"Prepared for: Office of Naval Research"--Cover.

"September 1987."

"Technical report for period January 1986 - July 1987"--Cover.

"NPS-53-87-005"--Cover.

Author(s) key words: Approximation, interpolation, scattered data, least squares, knot selection, thin plate splines.

Includes bibliographical references (p. 14-15)

"Approved for public release; distribution unlimited"--Cover.

Technical report; 1987.