A Fast Algorithm for Smoothing Data on a Rectangular Grid while Using Spline Functions
Paul Dierckx
Abstract
Paul Dierckx
Abstract
An efficient computational method is presented for fitting a bivariate spline function to a set of measured data on a rectangular grid. The coefficients in the B-spline representation of this spline are obtained by the solution of a linear system which can be arranged in a matrix form, conformable withthe Kronecker product of two band matrices of small size and bandwidth. The number of knots of the spline and their positions are determined automatically. Instead the algorithm expects a parameter to control the tradeoff between closeness of fit and smoothness of fit.
OpenAlex reports 66 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An efficient computational method is presented for fitting a bivariate spline function to a set of measured data on a rectangular grid. The coefficients in the B-spline representation of this spline are obtained by the solution of a linear system which can be arranged in a matrix form, conformable withthe Kronecker product of two band matrices of small size and bandwidth. The number of knots of the spline and their positions are determined automatically. Instead the algorithm expects a parameter to control the tradeoff between closeness of fit and smoothness of fit.
Key concepts: Spline (mechanical), Mathematics, Smoothing spline, Smoothing, Polyharmonic spline, Algorithm, Hermite spline, Grid