Multivalue Collocation Methods for Ordinary and Fractional Differential Equations

The present paper illustrates some classes of multivalue methods for the numerical solution of ordinary and fractional differential equations. In particular, it focuses on two-step and mixed collocation methods, Nordsieck GLM collocation methods for ordinary differential equations, and on two-step spline collocation methods for fractional differential equations. The construction of the methods together with the convergence and stability analysis are reported and some numerical experiments are carried out to show the efficiency of the proposed methods.

A Metaheuristic Optimization Algorithm for Solving Higher-Order Boundary Value Problems

An effective metaheuristic algorithm to solve the higher-order boundary value problems, called a genetic programming technique is presented. In this paper, a genetic programming algorithm, which depends on the syntax tree representation, is employed to obtain the analytical solutions of higher- order differential equations with the boundary conditions. The proposed algorithm can be produce an exact or approximate solution when the classical methods lead to unsatisfactory results. To illustrate the efficiency and accuracy of the designed algorithm, several examples are tested. Finally, the obtained results are compared with the existing methods such as the homotopy analysis method, the B-Spline collocation method and the differential transform method.

Image segmentation and preserve the boundary of the image using b-spline basis

This paper focuses the knot insertion in the B-spline collocation matrix, with nonnegative determinants in all n x n sub-matrices. Further by relating the number of zeros in B-spline basis as well as changes (sign changes) in the sequence of its B-spline coefficients. From this relation, we obtained an accurate characterization when interpolation by B-splines correlates with the changes leads uniqueness and this ensures the optimal solution. Simultaneously we computed the knot insertion matrix and B-spline collocation matrix and its sub-matrices having nonnegative determinants. The totality of the knot insertion matrix and B-spline collocation matrix is demonstrated in the concluding section by using the input image and shows that these concepts are fit to apply and reduce the errors through mean square error and PSNR values

A new structure to n-dimensional trigonometric cubic B-spline functions for solving n-dimensional partial differential equations

In this paper, we present a new structure of the n-dimensional trigonometric cubic B-spline collocation algorithm, which we show in three different formats: one-, two-, and three-dimensional. These constructs are critical for solving mathematical models in different fields. We illustrate the efficiency and accuracy of the proposed method by its application to a few two- and three-dimensional test problems. We use other numerical methods available in the literature to make comparisons.