Add to ORKGAbstract- Spline approximation is often preferred over polynomial approximation. They require less numerical opera-tions, do not suffer from numerical conditioning problems and they can approximate functions with discontinuous deriv-atives. This paper presents a comparative study between cubic splines, polynomial and rational equi-ripple approximations in curve fitting. The cubic splines use an optimal knot placement method while the polynomial and ratio-nal approximations are computed using a modified Lawson algorithm. Numerical conditioning problems are avoided using Forsythe orthogonal polynomials. 1
Let s be a cubic spline, with equally spaced knots on [a,b], interpolating a given function y at the...
In Qi Duan et al. (Korean J. Comput. Appl. Math. 6 (1) (1999) 203–215), the authors have discussed c...
In a series of three articles, spline approximation is presented from a geodetic point of view. In p...
The problem of data approximation is of great interest. There are a lot of approaches to solve this ...
The problem of data approximation is of great interest. There are a lot of approaches to solve this ...
Readers of the Gazette will be familiar with the use of least squares to find the polynomial that be...
This paper presents a new framework for approximating data with smooth splines. The classical spline...
The splines covered in this thesis are piecewise polynomials. We pass a set of polynomials through t...
<p>A rational cubic spline, with one family of shape parameters, has been discussed with the view to...
The problem of data approximation is of great interest. There are a lot of approaches to solve this ...
AbstractThis paper addresses new algorithms for constructing weighted cubic splines that are very ef...
A rational cubic spline, with one family of shape parameters, has been discussed with the view to it...
While polynomial regression models on a one-dimensional interval have received broad attention in op...
AbstractThis paper is concerned with the cubic spline-on-spline procedure considered by Dolezal and ...
.M Prenter defines a cubic Spline function in an interval [a, b] as a piecewise cubic polynomial wh...
Let s be a cubic spline, with equally spaced knots on [a,b], interpolating a given function y at the...
In Qi Duan et al. (Korean J. Comput. Appl. Math. 6 (1) (1999) 203–215), the authors have discussed c...
In a series of three articles, spline approximation is presented from a geodetic point of view. In p...
The problem of data approximation is of great interest. There are a lot of approaches to solve this ...
The problem of data approximation is of great interest. There are a lot of approaches to solve this ...
Readers of the Gazette will be familiar with the use of least squares to find the polynomial that be...
This paper presents a new framework for approximating data with smooth splines. The classical spline...
The splines covered in this thesis are piecewise polynomials. We pass a set of polynomials through t...
<p>A rational cubic spline, with one family of shape parameters, has been discussed with the view to...
The problem of data approximation is of great interest. There are a lot of approaches to solve this ...
AbstractThis paper addresses new algorithms for constructing weighted cubic splines that are very ef...
A rational cubic spline, with one family of shape parameters, has been discussed with the view to it...
While polynomial regression models on a one-dimensional interval have received broad attention in op...
AbstractThis paper is concerned with the cubic spline-on-spline procedure considered by Dolezal and ...
.M Prenter defines a cubic Spline function in an interval [a, b] as a piecewise cubic polynomial wh...
Let s be a cubic spline, with equally spaced knots on [a,b], interpolating a given function y at the...
In Qi Duan et al. (Korean J. Comput. Appl. Math. 6 (1) (1999) 203–215), the authors have discussed c...
In a series of three articles, spline approximation is presented from a geodetic point of view. In p...