AbstractApproximating a function with prescribed values at given points on a real interval by a cubic spline is based on the minimum curvature property of the approximation. This essential feature can be used as the criterion to determine the cubic polynomial approximation in each interval in a sequential manner by methods of dynamic programming. A stable system of recurrence relations for the coefficients of the spline in successive intervals is obtained by the methods of dynamic programming and they are shown to be identical with the usual relations of the spline approximation. Extension of this method to other types of splines is also considered
The use of polynomial splines as a basis for the interpolation of discrete data can be theoretically...
Abstract: The problem is emerged from the tasks of designing smooth curves in real objects...
Abstract- Spline approximation is often preferred over polynomial approximation. They require less n...
AbstractApproximating a function with prescribed values at given points on a real interval by a cubi...
AbstractThe approximation to a specified function on the real line by fitting a cubic in a piecewise...
AbstractA method of obtaining the mean-square spline approximation by the use of dynamic programming...
AbstractA method of obtaining the mean-square spline approximation by the use of dynamic programming...
Under study is a problem of the line structure routing of roads, railways and other linear construct...
The splines covered in this thesis are piecewise polynomials. We pass a set of polynomials through t...
AbstractDynamic programming techniques were used to obtain the spline approximation for a function w...
AbstractDynamic programming techniques were used to obtain the spline approximation for a function w...
AbstractIt is shown how one can use splines, represented in the B-spline basis, to reduce the diffic...
The unknown functions for data points are studied. We need to obtain the physically correct results....
AbstractThis paper addresses new algorithms for constructing weighted cubic splines that are very ef...
.M Prenter defines a cubic Spline function in an interval [a, b] as a piecewise cubic polynomial wh...
The use of polynomial splines as a basis for the interpolation of discrete data can be theoretically...
Abstract: The problem is emerged from the tasks of designing smooth curves in real objects...
Abstract- Spline approximation is often preferred over polynomial approximation. They require less n...
AbstractApproximating a function with prescribed values at given points on a real interval by a cubi...
AbstractThe approximation to a specified function on the real line by fitting a cubic in a piecewise...
AbstractA method of obtaining the mean-square spline approximation by the use of dynamic programming...
AbstractA method of obtaining the mean-square spline approximation by the use of dynamic programming...
Under study is a problem of the line structure routing of roads, railways and other linear construct...
The splines covered in this thesis are piecewise polynomials. We pass a set of polynomials through t...
AbstractDynamic programming techniques were used to obtain the spline approximation for a function w...
AbstractDynamic programming techniques were used to obtain the spline approximation for a function w...
AbstractIt is shown how one can use splines, represented in the B-spline basis, to reduce the diffic...
The unknown functions for data points are studied. We need to obtain the physically correct results....
AbstractThis paper addresses new algorithms for constructing weighted cubic splines that are very ef...
.M Prenter defines a cubic Spline function in an interval [a, b] as a piecewise cubic polynomial wh...
The use of polynomial splines as a basis for the interpolation of discrete data can be theoretically...
Abstract: The problem is emerged from the tasks of designing smooth curves in real objects...
Abstract- Spline approximation is often preferred over polynomial approximation. They require less n...