A numerical algorithm for nonlinear multi-point boundary value problems

AbstractIn this paper, an algorithm is presented for solving second-order nonlinear multi-point boundary value problems (BVPs). The method is based on an iterative technique and the reproducing kernel method (RKM). Two numerical examples are provided to show the reliability and efficiency of the present method

Modified Variational Iteration Method for Second Order Initial Value Problems

In this paper, we introduce a modified variational iteration method for second order initial value problems by transforming the integral of iteration process. The main advantages of this modification are that it can overcome the restriction of the form of nonlinearity term in differential equations and improve the iterative speed of conventional variational iteration method. The method is applied to some nonlinear second order initial value problems and the numerical results reveal that the modified method is accurate and efficient for second order initial value problems

Sampling and Reconstruction of Shapes with Algebraic Boundaries

We present a sampling theory for a class of binary images with finite rate of innovation (FRI). Every image in our model is the restriction of \mathds{1}_{\{p\leq0\}} to the image plane, where \mathds{1} denotes the indicator function and $p$ is some real bivariate polynomial. This particularly means that the boundaries in the image form a subset of an algebraic curve with the implicit polynomial $p$. We show that the image parameters --i.e., the polynomial coefficients-- satisfy a set of linear annihilation equations with the coefficients being the image moments. The inherent sensitivity of the moments to noise makes the reconstruction process numerically unstable and narrows the choice of the sampling kernels to polynomial reproducing kernels. As a remedy to these problems, we replace conventional moments with more stable \emph{generalized moments} that are adjusted to the given sampling kernel. The benefits are threefold: (1) it relaxes the requirements on the sampling kernels, (2) produces annihilation equations that are robust at numerical precision, and (3) extends the results to images with unbounded boundaries. We further reduce the sensitivity of the reconstruction process to noise by taking into account the sign of the polynomial at certain points, and sequentially enforcing measurement consistency. We consider various numerical experiments to demonstrate the performance of our algorithm in reconstructing binary images, including low to moderate noise levels and a range of realistic sampling kernels.Comment: 12 pages, 14 figure

New Challenges Arising in Engineering Problems with Fractional and Integer Order

Mathematical models have been frequently studied in recent decades, in order to obtain the deeper properties of real-world problems. In particular, if these problems, such as finance, soliton theory and health problems, as well as problems arising in applied science and so on, affect humans from all over the world, studying such problems is inevitable. In this sense, the first step in understanding such problems is the mathematical forms. This comes from modeling events observed in various fields of science, such as physics, chemistry, mechanics, electricity, biology, economy, mathematical applications, and control theory. Moreover, research done involving fractional ordinary or partial differential equations and other relevant topics relating to integer order have attracted the attention of experts from all over the world. Various methods have been presented and developed to solve such models numerically and analytically. Extracted results are generally in the form of numerical solutions, analytical solutions, approximate solutions and periodic properties. With the help of newly developed computational systems, experts have investigated and modeled such problems. Moreover, their graphical simulations have also been presented in the literature. Their graphical simulations, such as 2D, 3D and contour figures, have also been investigated to obtain more and deeper properties of the real world problem

An attractive numerical algorithm for solving nonlinear Caputo-Fabrizio fractional Abel differential equation in a Hilbert space

Our aim in this paper is presenting an attractive numerical approach giving an accurate solution to the nonlinear fractional Abel differential equation based on a reproducing kernel algorithm with model endowed with a Caputo-Fabrizio fractional derivative. By means of such an approach, we utilize the Gram-Schmidt orthogonalization process to create an orthonormal set of bases that leads to an appropriate solution in the Hilbert space H-2[a, b]. We investigate and discuss stability and convergence of the proposed method. The n-term series solution converges uniformly to the analytic solution. We present several numerical examples of potential interests to illustrate the reliability, efficacy, and performance of the method under the influence of the Caputo-Fabrizio derivative. The gained results have shown superiority of the reproducing kernel algorithm and its infinite accuracy with a least time and efforts in solving the fractional Abel-type model. Therefore, in this direction, the proposed algorithm is an alternative and systematic tool for analyzing the behavior of many nonlinear temporal fractional differential equations emerging in the fields of engineering, physics, and sciences