We discuss the construction of C 2 cubic spline quasi-interpolation schemes defined on a refined partition. These are reduced in terms degrees freedom compared to those existing literature. Namely, we provide rule for reducing them by imposing super-smoothing conditions while preserving full smoothness and precision. In addition, subdivision rules means blossoming. The derived designed express ...

Data coding have emerged in different directions. Various real time applications focused towards the improvement of data codings for efficient and accurate usage of available resources. In such application where resources are constrained, data coding systems are facing the limitation of processing speed and accuracy. Applications where speed of computation for

Many papers describe techniques for evaluating spline curves and surfaces. While each paper provides some theoretical or empirical evidence with which to compare techniques, there exist few global comparisons Peters94]. Also, papers describing particular algorithms often provide few details, making implementation of the technique presented diicult or impossible. This report attempts to illumina...

We present a novel trajectory computation algorithm to smooth jerky collision-free paths computed by samplebased motion planners. Our approach uses cubic B-splines to generate G or curvature continuous trajectories. The algorithm performs local spline refinement to compute smooth, collision-free paths in narrow passages and satisfy velocity and acceleration constraints. We also present a fast a...

We present a novel trajectory computation algorithm to smooth piecewise linear collision-free trajectories computed by samplebased motion planners. Our approach uses cubic B-splines to generate trajectories which are C almost everywhere, except on a few isolated points. The algorithm performs local spline refinement to compute smooth, collision-free trajectories and it works well even in enviro...

A collocation procedure is developed for the linear and nonlinear Fredholm and Volterra integro-differential equations, using the globally defined B-spline and auxiliary basis functions.The solution is collocated by cubic B-spline and the integrand is approximated by the Newton-Cotes formula. The error analysis of proposed numerical method is studied theoretically. Numerical results are given t...

Taylor B-spline collocation method (TCM) is proposed to obtain the numerical solution of the nonlinear Schrödinger(NLS) equation with appropriate initial and boundary conditions. Time discretization is carried out with Taylor series expansion and resulting system of equation is fully-integrated using cubic B-spline collocation method. Test problems concerning single soliton motion, interaction ...

We consider the efficient estimation of the semiparametric additive transformation model with current status data. A wide range of survival models and econometric models can be incorporated into this general transformation framework. We apply the B-spline approach to simultaneously estimate the linear regression vector, the nondecreasing transformation function, and a set of nonparametric regre...

Bivariate cubic L1 smoothing splines are introduced. The coefficients of a cubic L1 smoothing spline are calculated by minimizing the weighted sum of the L1 norms of second derivatives of the spline and the 1 norm of the residuals of the data-fitting equations. Cubic L1 smoothing splines are compared with conventional cubic smoothing splines based on the L2 and 2 norms. Computational results fo...

Both the four-point and the uniform cubic B-spline refinement (i.e. subdivision) schemes double the number of vertices of a closed-loop polygonal curve P and respectively produce sequences of vertices fk and bk. The Js refinement proposed here produces vertices vk=(1–s)fk+sbk. Iterative applications of Js yield a family of curves parameterized by s. It includes the four-point curve (J0), the un...