The aim of this paper is to present a method for solving high order ordinary differential equations with two point's boundary condition, we propose semi-analytic technique using two-point oscillatory interpolation to construct polynomial solution. The original problem is concerned using two-point oscillatory interpolation with the fit equal numbers of derivatives at the end points of an interval [0 , 1] . Also, many examples are presented to demonstrate the applicability, accuracy and efficiency of the method by comparing with conventional methods.
in this paper fourth order kutta method has been used to find the numerical solution for different types of first liner
The linear segment with parabolic blend (LSPB) trajectory deviates from the specified waypoints. It is restricted to that the acceleration must be sufficiently high. In this work, it is proposed to engage modified LSPB trajectory with particle swarm optimization (PSO) so as to create through points on the trajectory. The assumption of normal LSPB method that parabolic part is centered in time around waypoints is replaced by proposed coefficients for calculating the time duration of the linear part. These coefficients are functions of velocities between through points. The velocities are obtained by PSO so as to force the LSPB trajectory passing exactly through the specified path points. Also, relations for velocity correction and exact v
... Show Morein this paper the second order neutral differential equations are incestigated are were we give some new suffucient conditions for all nonoscillatory
The quality of Global Navigation Satellite Systems (GNSS) networks are considerably influenced by the configuration of the observed baselines. Where, this study aims to find an optimal configuration for GNSS baselines in terms of the number and distribution of baselines to improve the quality criteria of the GNSS networks. First order design problem (FOD) was applied in this research to optimize GNSS network baselines configuration, and based on sequential adjustment method to solve its objective functions.
FOD for optimum precision (FOD-p) was the proposed model which based on the design criteria of A-optimality and E-optimality. These design criteria were selected as objective functions of precision, whic
... Show MoreRecently, the financial mathematics has been emerged to interpret and predict the underlying mechanism that generates an incident of concern. A system of differential equations can reveal a dynamical development of financial mechanism across time. Multivariate wiener process represents the stochastic term in a system of stochastic differential equations (SDE). The standard wiener process follows a Markov chain, and hence it is a martingale (kind of Markov chain), which is a good integrator. Though, the fractional Wiener process does not follow a Markov chain, hence it is not a good integrator. This problem will produce an Arbitrage (non-equilibrium in the market) in the predicted series. It is undesired property that leads to erroneous conc
... Show MoreIn this paper, we consider a new approach to solve type of partial differential equation by using coupled Laplace transformation with decomposition method to find the exact solution for non–linear non–homogenous equation with initial conditions. The reliability for suggested approach illustrated by solving model equations such as second order linear and nonlinear Klein–Gordon equation. The application results show the efficiency and ability for suggested approach.
The main object of this study is to solve a system of nonlinear ordinary differential equations (ODE) of the first order governing the epidemic model using numerical methods. The application under study is a mathematical epidemic model which is the influenza model at Australia in 1919. Runge-kutta methods of order 4 and of order 45 for solving this initial value problem(IVP) problem have been used. Finally, the results obtained have been discussed tabularly and graphically.
Recently Genetic Algorithms (GAs) have frequently been used for optimizing the solution of estimation problems. One of the main advantages of using these techniques is that they require no knowledge or gradient information about the response surface. The poor behavior of genetic algorithms in some problems, sometimes attributed to design operators, has led to the development of other types of algorithms. One such class of these algorithms is compact Genetic Algorithm (cGA), it dramatically reduces the number of bits reqyuired to store the poulation and has a faster convergence speed. In this paper compact Genetic Algorithm is used to optimize the maximum likelihood estimator of the first order moving avergae model MA(1). Simulation results
... Show MoreA method for Approximated evaluation of linear functional differential equations is described. where a function approximation as a linear combination of a set of orthogonal basis functions which are chebyshev functions .The coefficients of the approximation are determined by (least square and Galerkin’s) methods. The property of chebyshev polynomials leads to good results , which are demonstrated with examples.