1982•SIAM Journal on Numerical AnalysisRequires access

A Fast Algorithm for Smoothing Data on a Rectangular Grid while Using Spline Functions

Paul Dierckx

Open publisher page 66 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 66 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Spline (mechanical), Mathematics, Smoothing spline, Smoothing, Polyharmonic spline, Algorithm, Hermite spline, Grid

Related papers

Back to paper searchBrowse research topicsOriginal source
A Fast Algorithm for Smoothing Data on a Rectangular Grid while Using Spline Functions — Research Paper | ScholarLens