In this paper, the Bagley-Torvik equation is constructed. A model approach based on non-polynomial numerical methods spline interpolation is developed to solve some problems. We show that the approximate solutions of such problems obtained by the numerical algorithm developed using non-polynomial spline interpolation functions are better than those produced by other numerical methods. The aim o...

This paper presents a simple and fast recurrence equation-based method for solving the cubic spline interpolation problem. The computational complexity of the method is O(n), where n is the number of measurements. The recurrence equation-based method is illustrated by an example that estimates the movement of a moving object. The paper also describes a MATLAB implementation of the new method an...

In this paper a general theory for interpolation methods on a rectangular grid is introduced. By the use of this theory an efficient B-spline-based interpolation method for spectral codes is presented. The theory links the order of the interpolation method with its spectral properties. In this way many properties like order of continuity, order of convergence, and magnitude of errors can be exp...

In this paper we present a new method for the model of interpolation sweep surfaces by the C-continuous generalized quasicubic interpolation spline. Once given some key position, orientation and some points which are passed through by the spine and initial cross-section curves, the corresponding sweep surface can be constructed by the introduced spline function without calculating control point...

The cubic spline interpolation method, the Runge–Kutta method, and the Newton–Raphson method are extended to dual versions (developed in the context of dual numbers). This extension allows the calculation of the derivatives of complicated compositions of functions which are not necessarily defined by a closed form expression. The code for the algorithms has been written in Fortran and some exam...

This paper presents cubic spline interpolation based trajectory planning method which is aiming to achieve smooth biped robot walking trajectory. We first characterize the bipedal walking cycle and point out some major issues that need to be addressed to plan a continuous swing leg trajectory by using the concept of cubic polynomial and cubic spline interpolation. By applying these interpolatio...

In this article, we address the problem of interpolating data points lying on a regular grid by C 1-continuous L1-bicubic spline surfaces. Our algorithm is based on a local univariate L1 minimization method which enable us to calculate first derivative values for C 1-cubic spline curves. In order to construct the interpolation surface, we calculate four derivative values at each data point usin...