论文信息 - Smooth-curve interpolation: A generalized spline-fit procedure

Smooth-curve interpolation: A generalized spline-fit procedure

A method is presented for finding the smoothest curve through a set of data points. “Smoothest” refers to the equilibrium, or minimum-energy configuration of an ideal elastic beam constrained to pass through the data points. The formulation of the smoothest curve is seen to involve a multivariable boundary-value minimization problem which makes use of a numerical solution of the beam non-linear differential equation. The method is shown to offer considerable improvement over the spline technique for smooth-curve interpolation.

J. Glass

[1] H. B. Curry. The method of steepest descent for non-linear minimization problems , 1944 .

[2] John C. Holladay,et al. A smoothest curve approximation , 1957 .

[3] L. Fox. The Numerical Solution of Two-Point Boundary Problems in Ordinary Differential Equations , 1957 .

[4] F. Theilheimer,et al. The Fairing of Ship Lines on a High-Speed Computer , 1961 .

[5] B. Asker. The spline curve, a smooth interpolating function used in numerical design of ship-lines , 1962 .

[6] Even Mehlum,et al. A curve-fitting method based on a variational criterion , 1964 .

[7] T. Greville. Numerical Procedures for Interpolation by Spline Functions , 1964 .

[8] Stig Nord,et al. Approximation properties of the spline fit , 1967 .