Algorithms using the second order of B -splines [B (x)] and the third order of B -splines [B,3(x)] are derived to solve 1' , 2nd and 3rd linear Fredholm integro-differential equations (F1DEs). These new procedures have all the useful properties of B -spline function and can be used comparatively greater computational ease and efficiency.The results of these algorithms are compared with the cubic spline function.Two numerical examples are given for conciliated the results of this method.
The fractional order partial differential equations (FPDEs) are generalizations of classical partial differential equations (PDEs). In this paper we examine the stability of the explicit and implicit finite difference methods to solve the initial-boundary value problem of the hyperbolic for one-sided and two sided fractional order partial differential equations (FPDEs). The stability (and convergence) result of this problem is discussed by using the Fourier series method (Von Neumanns Method).
This paper presents a comparative study of two learning algorithms for the nonlinear PID neural trajectory tracking controller for mobile robot in order to follow a pre-defined path. As simple and fast tuning technique, genetic and particle swarm optimization algorithms are used to tune the nonlinear PID neural controller's parameters to find the best velocities control actions of the right wheel and left wheel for the real mobile robot. Polywog wavelet activation function is used in the structure of the nonlinear PID neural controller. Simulation results (Matlab) and experimental work (LabVIEW) show that the proposed nonlinear PID controller with PSO
learning algorithm is more effective and robust than genetic learning algorithm; thi
In this research، a comparison has been made between the robust estimators of (M) for the Cubic Smoothing Splines technique، to avoid the problem of abnormality in data or contamination of error، and the traditional estimation method of Cubic Smoothing Splines technique by using two criteria of differentiation which are (MADE، WASE) for different sample sizes and disparity levels to estimate the chronologically different coefficients functions for the balanced longitudinal data which are characterized by observations obtained through (n) from the independent subjects، each one of them is measured repeatedly by group of specific time points (m)،since the frequent measurements within the subjects are almost connected an
... Show MoreThe main intention of this study was to investigate the development of a new optimization technique based on the differential evolution (DE) algorithm, for the purpose of linear frequency modulation radar signal de-noising. As the standard DE algorithm is a fixed length optimizer, it is not suitable for solving signal de-noising problems that call for variability. A modified crossover scheme called rand-length crossover was designed to fit the proposed variable-length DE, and the new DE algorithm is referred to as the random variable-length crossover differential evolution (rvlx-DE) algorithm. The measurement results demonstrate a highly efficient capability for target detection in terms of frequency response and peak forming that was isola
... Show MoreThe techniques of fractional calculus are applied successfully in many branches of science and engineering, one of the techniques is the Elzaki Adomian decomposition method (EADM), which researchers did not study with the fractional derivative of Caputo Fabrizio. This work aims to study the Elzaki Adomian decomposition method (EADM) to solve fractional differential equations with the Caputo-Fabrizio derivative. We presented the algorithm of this method with the CF operator and discussed its convergence by using the method of the Cauchy series then, the method has applied to solve Burger, heat-like, and, couped Burger equations with the Caputo -Fabrizio operator. To conclude the method was convergent and effective for solving this type of
... Show MoreThe expanding use of multi-processor supercomputers has made a significant impact on the speed and size of many problems. The adaptation of standard Message Passing Interface protocol (MPI) has enabled programmers to write portable and efficient codes across a wide variety of parallel architectures. Sorting is one of the most common operations performed by a computer. Because sorted data are easier to manipulate than randomly ordered data, many algorithms require sorted data. Sorting is of additional importance to parallel computing because of its close relation to the task of routing data among processes, which is an essential part of many parallel algorithms. In this paper, sequential sorting algorithms, the parallel implementation of man
... Show MoreIn this paper, a new third kind Chebyshev wavelets operational matrix of derivative is presented, then the operational matrix of derivative is applied for solving optimal control problems using, third kind Chebyshev wavelets expansions. The proposed method consists of reducing the linear system of optimal control problem into a system of algebraic equations, by expanding the state variables, as a series in terms of third kind Chebyshev wavelets with unknown coefficients. Example to illustrate the effectiveness of the method has been presented.
This work discusses the beginning of fractional calculus and how the Sumudu and Elzaki transforms are applied to fractional derivatives. This approach combines a double Sumudu-Elzaki transform strategy to discover analytic solutions to space-time fractional partial differential equations in Mittag-Leffler functions subject to initial and boundary conditions. Where this method gets closer and closer to the correct answer, and the technique's efficacy is demonstrated using numerical examples performed with Matlab R2015a.
The method of operational matrices based on different types of polynomials such as Bernstein, shifted Legendre and Bernoulli polynomials will be presented and implemented to solve the nonlinear Blasius equations approximately. The nonlinear differential equation will be converted into a system of nonlinear algebraic equations that can be solved using Mathematica®12. The efficiency of these methods has been studied by calculating the maximum error remainder ( ), and it was found that their efficiency increases as the polynomial degree (n) increases, since the errors decrease. Moreover, the approximate solutions obtained by the proposed methods are compared with the solution of the 4th order Runge-Kutta method (RK4), which gives very
... Show More