New Numerical Integration Formulations for Ordinary Differential Equations

An entirely new framework is established for developing various single- and multi-step formulations for the numerical integration of ordinary differential equations. Besides polynomials, unconventional base-functions with trigonometric and exponential terms satisfying different conditions are employed to generate a number of formulations. Performances of the new schemes are tested against well-known numerical integrators for selected test cases with quite satisfactory results. Convergence and stability issues of the new formulations are not addressed as the treatment of these aspects requires a separate work. The general approach introduced herein opens a wide vista for producing virtually unlimited number of formulations.

Continuous-Time Channel Prediction Based on Tensor Neural Ordinary Differential Equation

Channel prediction is critical to address the channel aging issue in mobile scenarios.Existing channel prediction techniques are mainly designed for discrete channel prediction,which can only predict the future channel in a fixed time slot per frame,while the other intra-frame channels are usually recovered by interpolation.However,these approaches suffer from a serious interpolation loss,especially for mobile millimeter-wave communications.To solve this challenging problem,we propose a tensor neural ordinary differential equation(TN-ODE)based continuous-time channel prediction scheme to realize the direct prediction of intra-frame channels.Specifically,inspired by the recently developed continuous mapping model named neural ODE in the field of machine learning,we first utilize the neural ODE model to predict future continuous-time channels.To improve the channel prediction accuracy and reduce computational complexity,we then propose the TN-ODE scheme to learn the structural characteristics of the high-dimensional channel by low-dimensional learnable transform.Simulation results show that the proposed scheme is able to achieve higher intra-frame channel prediction accuracy than existing schemes.

Higher-order differential variational principle and differential equations of motion for mechanical systems in event space

In this paper we study the higher-order differential variational principle and differential equations of motion for mechanical systems in event space. Based on the higher-order d＇Alembert principle of the system, the higher-order velocity energy and the higher-order acceleration energy of the system in event space are defined, the higher-order d＇Alembert- Lagrange principle of the system in event space is established, and the parametric forms of Euler-Lagrange, Nielsen and Appell for this principle are given. Finally, the higher-order differential equations of motion for holonomic systems in event space are obtained.

Solution of Laguerre’s Differential Equations via Modified Adomian Decomposition Method

This paper presents a technique for obtaining an exact solution for the well-known Laguerre’s differential equations that arise in the modeling of several phenomena in quantum mechanics and engineering. We utilize an efficient procedure based on the modified Adomian decomposition method to obtain closed-form solutions of the Laguerre’s and the associated Laguerre’s differential equations. The proposed technique makes sense as the attitudes of the acquired solutions towards the neighboring singular points are correctly taken care of.

New Derivation of Ordinary Differential Equations for Transient Free-Surface Green Functions

Based on the Laplace transform, a direct derivation of the ordinary differential equations for the three-dimensional transient free-surface Green function in marine hydrodynamics is presented. The results for the 3D Green function and all its spatial derivatives are a set of fourth-order ordinary differential equations, which are identical with that of Clement (1998). All of these results may be used to accelerate numerical computation for the time-domain boundary element method in marine hydrodynamics.

HIGH ACCURACY FINITE VOLUME ELEMENT METHOD FOR TWO-POINT BOUNDARY VALUE PROBLEM OF SECOND ORDER ORDINARY DIFFERENTIAL EQUATIONS

In this paper, a high accuracy finite volume element method is presented for two-point boundary value problem of second order ordinary differential equation, which differs from the high order generalized difference methods. It is proved that the method has optimal order error estimate O(h3) in H1 norm. Finally, two examples show that the method is effective.

On Exact Solutions of Second Order Nonlinear Ordinary Differential Equations

In this paper, a new approach for solving the second order nonlinear ordinary differential equation y’’ + p(x;y)y’ = G(x;y) is considered. The results obtained by this approach are illustrated by examples and show that this method is powerful for this type of equations.

A Novel Method for Solving Ordinary Differential Equations with Artificial Neural Networks

This research work investigates the use of Artificial Neural Network (ANN) based on models for solving first and second order linear constant coefficient ordinary differential equations with initial conditions. In particular, we employ a feed-forward Multilayer Perceptron Neural Network (MLPNN), but bypass the standard back-propagation algorithm for updating the intrinsic weights. A trial solution of the differential equation is written as a sum of two parts. The first part satisfies the initial or boundary conditions and contains no adjustable parameters. The second part involves a feed-forward neural network to be trained to satisfy the differential equation. Numerous works have appeared in recent times regarding the solution of differential equations using ANN, however majority of these employed a single hidden layer perceptron model, incorporating a back-propagation algorithm for weight updation. For the homogeneous case, we assume a solution in exponential form and compute a polynomial approximation using statistical regression. From here we pick the unknown coefficients as the weights from input layer to hidden layer of the associated neural network trial solution. To get the weights from hidden layer to the output layer, we form algebraic equations incorporating the default sign of the differential equations. We then apply the Gaussian Radial Basis function (GRBF) approximation model to achieve our objective. The weights obtained in this manner need not be adjusted. We proceed to develop a Neural Network algorithm using MathCAD software, which enables us to slightly adjust the intrinsic biases. We compare the convergence and the accuracy of our results with analytic solutions, as well as well-known numerical methods and obtain satisfactory results for our example ODE problems.

PROJECTION METHODS AND APPROXIMATIONS FOR ORDINARY DIFFERENTIAL EQUATIONS

A formulation of a differential equation as projection and fixed point pi-Mem alloivs approximations using general piecnvise functions. We prone existence and uniqueness of the up proximate solution* convergence in the L2 norm and nodal supercnnvergence. These results generalize those obtained earlier by Hulme for continuous piecevjise polynomials and by Delfour-Dubeau for discontinuous pieceuiise polynomials. A duality relationship for the two types of approximations is also given.

An Adaptive Time-Step Backward Differentiation Algorithm to Solve Stiff Ordinary Differential Equations: Application to Solve Activated Sludge Models

A backward differentiation formula (BDF) has been shown to be an effective way to solve a system of ordinary differential equations (ODEs) that have some degree of stiffness. However, sometimes, due to high-frequency variations in the external time series of boundary conditions, a small time-step is required to solve the ODE system throughout the entire simulation period, which can lead to a high computational cost, slower response, and need for more memory resources. One possible strategy to overcome this problem is to dynamically adjust the time-step with respect to the system’s stiffness. Therefore, small time-steps can be applied when needed, and larger time-steps can be used when allowable. This paper presents a new algorithm for adjusting the dynamic time-step based on a BDF discretization method. The parameters used to dynamically adjust the size of the time-step can be optimally specified to result in a minimum computation time and reasonable accuracy for a particular case of ODEs. The proposed algorithm was applied to solve the system of ODEs obtained from an activated sludge model (ASM) for biological wastewater treatment processes. The algorithm was tested for various solver parameters, and the optimum set of three adjustable parameters that represented minimum computation time was identified. In addition, the accuracy of the algorithm was evaluated for various sets of solver parameters.

Parallel Evolutionary Modeling for Nonlinear Ordinary Differential Equations

We introduce a new parallel evolutionary algorithm in modeling dynamic systems by nonlinear higher-order ordinary differential equations (NHODEs). The NHODEs models are much more universal than the traditional linear models. In order to accelerate the modeling process, we propose and realize a parallel evolutionary algorithm using distributed CORBA object on the heterogeneous networking. Some numerical experiments show that the new algorithm is feasible and efficient.

ASYMPTOTIC SOLUTIONS OF BOUNDARY VALUE PROBLEMS FOR THIRD-ORDER ORDINARY DIFFERENTIAL EQUATIONS WITH TURNING POINTS

Boundary value problem; for third-order ordinary differential equations with turning points are studied as follows : epsilon gamma ' ' + f(x ; epsilon) gamma ' + g(x ; epsilon) gamma ' +h(x ; epsilon) gamma = 0 (- a < x < b, 0 epsilon 1), where f(x ; 0) has several multiple zero points in ( - n, b). the necessary conditions for exhibiting resonance is given, and the uniformly valid asymptotic solutions and the estimations of remainder terms are obtained.

THE ESTIMATION OF SOLUTION OF THE BOUNDARY VALUE PROBLEM OF THE SYSTEMS FOR QUASI-LINEAR ORDINARY DIFFERENTIAL EQUATIONS

This paper deals with the singular perturbation of the boundary value problem of the systems for quasi-linear ordinary differential equationswhere x,f, y , h, A, B and C all belong to Rn , and g is an n×n matrix function. Under suitable conditions we prove the existence of the solutions by diagonalization and the fixed point theorem and also estimate the remainder.

ON THE BOUNDARY VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL EQUATIONS WITH TURNING POINTS

In this paper, we consider the boundary value problems of the form ey″ - f(x, e)y′ + g(x, e)y=0 (-a&lex&leb, 0<e1) y(-a)=a, y(b)=β where f(x,0) has several and multiple zeros on the interval [-a,b]. The conditions for exhibiting boundary and interior layers are given, and the corresponding asymptotic expansions of solutions are constructed.

Parallel Implementations of Modeling Dynamical Systems by Using System of Ordinary Differential Equations

First, an asynchronous distributed parallel evolutionary modeling algorithm (PEMA) for building the model of system of ordinary differential equations for dynamical systems is proposed in this paper. Then a series of parallel experiments have been conducted to systematically test the influence of some important parallel control parameters on the performance of the algorithm. A lot of experimental results are obtained and we make some analysis and explanations to them.

Criteria for System of Three Second-Order Ordinary Differential Equations to Be Reduced to a Linear System via Restricted Class of Point Transformation

This paper is devoted to the study of the linearization problem of system of three second-order ordinary differential equations and . The necessary conditions for linearization by general point transformation and are found. The sufficient conditions for linearization by restricted class of point transformation and are obtained. Moreover, the procedure for obtaining the linearizing transformation is provided in explicit forms. Examples demonstrating the procedure of using the linearization theorems are presented.

Solution of Some Second Order Ordinary Differential Equations Using a Derived Algorithm

We emphasized explicitly on the derivation and implementation of a new numerical algorithm scheme which gave stable results that show the applicability of the method. In this paper, we aimed to solve some second order initial value problems of ordinary differential equations and compare the results with the theoretical solution. Using this method to solve some initial value problems of second order ordinary differential equations, we discovered that the results compared favorably with the theoretical solution which led to the conclusion that the new numerical algorithm scheme derived in the research is approximately correct and can be prescribed for any related ordinary differential equations.

Several New Types of Fixed Point Theorems and Their Applications to Two-Point Ordinary Differential Equations

The present paper is mainly concerned with several new types of fixed point theorems in different spaces such as cone metric spaces and fuzzy metric spaces. By using these obtained fixed point theorems, we then prove the existence and uniqueness of the solutions to two classes of two-point ordinary differential equation problems.

STUDYING THE FOCAL VALUE OF ORDINARY DIFFERENTIAL EQUATIONS BY NORMAL FORM THEORY

We present a new method to calculate the focal value of ordinary differential equation by applying the theorem defined the relationship between the normal form and focal value,with the help of a symbolic computation language M ATHEMATICA,and extending the matrix representation method.This method can be used to calculate the focal value of any high order terms.This method has been verified by an example.The advantage of this method is simple and more readily applicable.the result is directly obtained by substitution.

Solution of Second-Order Ordinary Differential Equations via Simulated Annealing

In this paper, we approach the problem of obtaining approximate solution of second-order initial value problems by converting it to an optimization problem. It is assumed that the solution can be approximated by a polynomial. The coefficients of the polynomial are then optimized using simulated annealing technique. Numerical examples with good results show the accuracy of the proposed approach compared with some existing methods.