Nacrtak This paper describes a program for optimizing forest road alignments using the Dijkstra shortest path method and a cubic spline function. We previously developed a method for optimizing forest road alignments once a series of intersection points (IPs) were selected manually using Tabu Search. The application of the program to a part of Capitol State Forest in Washington State, USA indic...

In the present article, a numerical method is proposed for the numerical solution of the KdV equation by using a new approach by combining cubic B-spline functions. In this paper we convert the KdV equation to system of two equations. The method is shown to be unconditionally stable using von-Neumann technique. To test accuracy the error norms L2, L∞ are computed. Three invariants of motion are...

In this paper, we construct a new numerical algorithm for the partial differential equation of up-and-out put barrier options under CEV model. method, use Crank-Nicolson scheme to discrete temporal variables and cubic B-spline collocation method spatial variables. The is stable has second-order convergence both time space analysis proposed discussed in detail. Finally, examples verify stability...

In this article, the cubic B-spline collocation method is implemented to find numerical solution of the problem arising from chemical reactor theory. The method is tested on some model problems from the literature, and the numerical results are compared with other methods.

This paper explores the intrinsic link between natural cubic splines and subdivision. Natural cubic splines are deened via the varia-tional problem of minimizing a simple approximation of bending energy. A subdivision scheme is derived which converges to the minimizer of this particular variational problem. x1. Introduction Geometric design is the study of the representation of shapes with math...