T-spline has been recently developed to represent objects of arbitrary shapes using a smaller number of control points than the conventional NURBS or B-spline representations in computer aided design, computer graphics, and reverse engineering. However, existing methods for fitting a T-spline over a point cloud are slow. By shifting away from the conventional iterative fitand-refine paradigm, w...

The collocation method based on cubic B-spline, is developed to approximate the solution of second kind nonlinear Fredholm integral equations. First of all, we collocate the solution by B-spline collocation method then the Newton-Cotes formula use to approximate the integrand. Convergence analysis has been investigated and proved that the quadrature rule is third order convergent. The presented...

A domain decomposition method for solving large bivariate scattered data fitting problems with bivariate minimal energy, discrete least-squares, and penalized least-squares splines is described. The method is based on splitting the domain into smaller domains, solving the associated smaller fitting problems, and combining the coefficients to get a global fit. Explicit error bounds are establish...

A constructive approach is adopted to build B-spline like basis for cubic spline curves with a more general continuity than beta-continuity. This method provides not only a large variety of very interesting shape controls like biased, point, and interval tensions but, as a special case, also recovers a number of spline methods like nu-spline of Nielson[9], beta-splines[1], gamma-splines of Boeh...

Smoothing splines with generalized cross-validation parameter selection (GCV-spline) provide a method to find an optimal smoother for an fMRI time series. The purpose of this study was to compare the variance of parameter estimates and the bias of the variance estimator for a linear regression model smoothed with GCV-spline and the low-pass filter in SPM99 (SPM-HRF). The mean bias with the SPM-...

Based on analysis of cubic spline interpolation, the differentiation formulas of the cubic spline interpolation on the three boundary conditions are put up forward in this paper. At last, this calculation method is illustrated through an example. The numerical results show that the spline numerical differentiations are quite effective for estimating first and higher derivatives of equally and u...

We consider the self-adjoint singularly perturbed two-point boundary value problems. We know that the numerical methods for solution of such problems based on nonpolynomial spline in grid points, can produce the fourth order method only. So that we look for an alternative to obtain higher order methods. We develop the non-polynomial spline in off-step points to rise the order of accuracy. Based...

A new algorithm for Computer Aided Geometric Design of least squares (LS) splines with variable knots, named GeDS, is presented. It is based on interpreting functional spline regression as a parametric B-spline curve, and on using the shape preserving property of its control polygon. The GeDS algorithm includes two major stages. For the first stage, an automatic adaptive, knot location algorith...