In this paper, we propose basic and improved algorithms based on polynomial B-spline form for constrained global optimization of multivariate functions. The proposed are a branch-and-bound framework. algorithm introduce several new ingredients, such as box consistency hull to prune the search regions make more efficient. performance is tested compared set test problems. results tests show super...

we present a sixth-order non-polynomial spline method for the solutions of two-point nonlinear boundary value problem u(4)+f(x,u)=0, u(a)=α1, u''(a)= α2, u(b)= β1,u''(b)= β2, in off step points. numerical method of sixth-order with end conditions of the order 6 is derived. the convergence analysis of the method has been discussed. numerical examples are presented to illustra...

in this paper, non-polynomial spline method for solving coupled burgers’ equations are presented. we take a new spline function. the stability analysis using von-neumann technique shows the scheme is unconditionally stable. to test accuracy the error norms2l, ∞l are computed and give two examples to illustrate the sufficiency of the method for solving such nonlinear partial differential equatio...

Spline methods provide an important tool to solve singularly perturbed boundary value problems. The present paper gives a comprehensive review of computational methods based on splines used in the solution of various classes of singularly perturbed problems such as self adjoint, linear, non-linear, semi-linear, quasi-linear, singular, single parameter and multi parameter. The spline based numer...

This paper studies the merits of using knot interval notation for B-spline curves, and presents formulae in terms of knot intervals for common B-spline operations such as knot insertion, differentiation, and degree elevation. Using knot interval notation, the paper introduces MD-splines, which are B-spline-like curves that are comprised of polynomial segments of various degrees (MD stands for “...

This essay reviews those basic facts about (univariate) B-splines that are of interest in CAGD. The intent is to give a self-contained and complete development of the material in as simple and direct a way as possible. For this reason, the B-splines are defined via the recurrence relations, thus avoiding the discussion of divided differences which the traditional definition of a B-spline as a d...

The non-polynomial spline method is proposed to solve a singular boundary value problems. Some model problems are solved and the numerical results are compared with B-spline approximation and the exact solution. Results obtained by the method indicate the method is simple and effective. Key–Words: Singular point; Singular two-point boundary value problems; Cubic spline

The definition of a B-spline is extended to unordered knot sequences. The added flexibility implies that the resulting piecewise polynomials, named U-splines, can be negative and locally linearly dependent. It is therefore remarkable that linear combinations of U-splines retain many properties of splines in B-spline form including smoothness, polynomial reproduction, and evaluation by recurrence.

It is well known that a cardinal B-spline of order m,m ∈ N, is a piecewise polynomial function. In this note we propose an effective method for calculating the coefficients of polynomials which constitute a cardinal B-spline. © 2010 Elsevier Ltd. All rights reserved.

This paper explores numerical solutions of optimal control problems using B–Spline curves. It is aimed to give a general framework on how to use B–Splines to formulate optimal control problems and to solve them numerically using Nonlinear Trajectory Generation software package. Effects of the selection of the B–Spline parameters, such as, number of intervals, smoothness, piecewise polynomial or...