Finding higher symmetries of differential equations using the MAPLE package DESOLVII

We present and describe, with illustrative examples, the MAPLE computer algebra package DESOLVII, which is a major upgrade of DESOLV. DESOLVII now includes new routines allowing the determination of higher symmetries (contact and Lie-Backlund) for systems of both ordinary and partial differential equations.

A comparative study of some computer algebra packages which determine the lie point symmetries of differential equations

The study seeks to determine which of five computer algebra packages is best at finding the Lie point symmetries of systems of partial differential equations with minimal user intervention. The chosen packages are LIEPDE and DIMSYM for REDUCE, LIE and BIGLIE for MUMATH, DESOLV for MAPLE, and MATHLIE for MATHEMATICA. A series of systems of partial differential equations are used in the study. The paper concludes that while all of the computer packages are useful, DESOLV appears to be the most successful system at determining the complete set of Lie point symmetries of systems of partial differential equations.

Similarity solutions of partial differential equations using DESOLV

We present and describe new reduction routines included in DESOLV which, in many cases, may allow the complete automation of the determination of similarity solutions of partial differential equations.

Lie symmetries of partial differential equations using symbolic computing

This study presents a theoretical basis for and outlines the method of finding the Lie point symmetries of systems of partial differential equations. It seeks to determine which of five computer algebra packages is best at finding these symmetries. The chosen packages are LIEPDE and DIMSYM for REDUCE, LIE and BIGLIE for MUMATH, DESOLV for MAPLE, and MATHLIE for MATHEMATICA. This work concludes that while all of the computer packages are useful, DESOLV appears to be the most successful system at determining the complete set of Lie symmetries. Also, the study describes REDUCEVAR, a new package for MAPLE, that reduces the number of independent variables in systems of partial differential equations, using particular Lie point symmetries. It outlines the results of some testing carried out on this package. It concludes that REDUCEVAR is a very useful tool in performing the reduction of independent variables according to Lie's theory and is highly accurate in identifying cases where the symmetries are not suitable for finding S/G equations.

Applications of symbolic computing for symmetry analysis of differential equations

 This thesis presents a number of applications of symbolic computing to the study of differential equations. In particular, three packages have been produced for the computer algebra system MAPLE and used to find a variety of symmetries (and corresponding invariant solutions) for a range of differential systems.

FracSym: automated symbolic computation of Lie symmetries of fractional differential equations

In this paper, we present an algorithm for the systematic calculation of Lie point symmetries for fractional order differential equations (FDEs) using the method as described by Buckwar & Luchko (1998) and Gazizov, Kasatkin & Lukashchuk (2007, 2009, 2011). The method has been generalised here to allow for the determination of symmetries for FDEs with n independent variables and for systems of partial FDEs. The algorithm has been implemented in the new MAPLE package FracSym (Jefferson and Carminati 2013) which uses routines from the MAPLE symmetry packages DESOLVII (Vu, Jefferson and Carminati, 2012) and ASP (Jefferson and Carminati, 2013). We introduce FracSym by investigating the symmetries of a number of FDEs; specific forms of any arbitrary functions, which may extend the symmetry algebras, are also determined. For each of the FDEs discussed, selected invariant solutions are then presented. © 2013 Elsevier B.V. All rights reserved.

Modeling of light propagation through biological tissues : a novel approach

An efficient numerical technique for modeling biological tissues using the radiative transfer equation is presented. Time dependence of the transient radiative transfer equation is approximated using Laguerre expansion. Azimuthal angle is discretized using the discrete ordinates method and the resulting set of ordinary differential equations is solved using the Runge-Kutta-Felhberg method.

CISR-ODE, A C plus plus framework with ODE solver for code based system dynamics simulation

Ordinary differential equations are used for modelling a wide range of dynamic systems. Even though there are many graphical software applications for this purpose, a fully customised solution for all problems is code-level programming of the model and solver. In this project, a free and open source C++ framework is designed to facilitate modelling in native code environment and fulfill the common simulation needs of control and many other engineering and science applications. The solvers of this project are obtained from ODEINT and specialised for Armadillo matrix library to provide an easy syntax and a fast execution. The solver code is minimised and its modification for users have become easier. There are several features added to the solvers such as controlling maximum step size, informing the solver about sudden input change and forcing custom times into the results and calling a custom method at these points. The comfort of the model designer, code readability, extendibility and model isolation have been considered in the structure of this framework. The application manages the output results, exporting and plotting them. Modifying the model has become more practical and a portion of corresponding codes are updated automatically. A set of libraries is provided for generation of output figures, matrix hashing, control system functions, profiling, etc. In this paper, an example of using this framework for a classical washout filter model is explained.

Semi-hyperbolic mappings in Banach spaces

The definition of semi-hyperbolic dynamical systems generated by Lipschitz continuous and not necessarily invertible mappings in Banach spaces is presented in this thesis. Like hyperbolic mappings, they involve a splitting into stable and unstable spaces, but a slight leakage from the strict invariance of the spaces is possible and the unstable subspaces are assumed to be finite dimensional. Bi-shadowing is a combination of the concepts of shadowing and inverse shadowing and is usually used to compare pseudo-trajectories calculated by a computer with the true trajectories. In this thesis, the concept of bi-shadowing in a Banach space is defined and proved for semi-hyperbolic dynamical systems generated by Lipschitz mappings. As an application to the concept of bishadowing, linear delay differential equations are shown to be bi-shadowing with respect to pseudo-trajectories generated by nonlinear small perturbations of the linear delay equation. This shows robustness of solutions of the linear delay equation with respect to small nonlinear perturbations. Complicated dynamical behaviour is often a consequence of the expansivity of a dynamical system. Semi-hyperbolic dynamical systems generated by Lipschitz mappings on a Banach space are shown to be exponentially expansive, and explicit rates of expansion are determined. The result is applied to a nonsmooth noninvertible system generated by delay differential equation. It is shown that semi-hyperbolic mappings are locally φ-contracting, where -0 is the Hausdorff measure of noncompactness, and that a linear operator is semi-hyperbolic if and only if it is φ-contracting and has no spectral values on the unit circle. The definition of φ-bi-shadowing is given and it is shown that semi-hyperbolic mappings in Banach spaces are φ-bi-shadowing with respect to locally condensing continuous comparison mappings. The result is applied to linear delay differential equations of neutral type with nonsmooth perturbations. Finally, it is shown that a small delay perturbation of an ordinary differential equation with a homoclinic trajectory is ‘chaotic’.

Computational aspects of the numerical solution of SDEs

In the last 30 to 40 years, many researchers have combined to build the knowledge base of theory and solution techniques that can be applied to the case of differential equations which include the effects of noise. This class of ``noisy'' differential equations is now known as stochastic differential equations (SDEs). Markov diffusion processes are included within the field of SDEs through the drift and diffusion components of the Itô form of an SDE. When these drift and diffusion components are moderately smooth functions, then the processes' transition probability densities satisfy the Fokker-Planck-Kolmogorov (FPK) equation -- an ordinary partial differential equation (PDE). Thus there is a mathematical inter-relationship that allows solutions of SDEs to be determined from the solution of a noise free differential equation which has been extensively studied since the 1920s. The main numerical solution technique employed to solve the FPK equation is the classical Finite Element Method (FEM). The FEM is of particular importance to engineers when used to solve FPK systems that describe noisy oscillators. The FEM is a powerful tool but is limited in that it is cumbersome when applied to multidimensional systems and can lead to large and complex matrix systems with their inherent solution and storage problems. I show in this thesis that the stochastic Taylor series (TS) based time discretisation approach to the solution of SDEs is an efficient and accurate technique that provides transition and steady state solutions to the associated FPK equation. The TS approach to the solution of SDEs has certain advantages over the classical techniques. These advantages include their ability to effectively tackle stiff systems, their simplicity of derivation and their ease of implementation and re-use. Unlike the FEM approach, which is difficult to apply in even only two dimensions, the simplicity of the TS approach is independant of the dimension of the system under investigation. Their main disadvantage, that of requiring a large number of simulations and the associated CPU requirements, is countered by their underlying structure which makes them perfectly suited for use on the now prevalent parallel or distributed processing systems. In summary, l will compare the TS solution of SDEs to the solution of the associated FPK equations using the classical FEM technique. One, two and three dimensional FPK systems that describe noisy oscillators have been chosen for the analysis. As higher dimensional FPK systems are rarely mentioned in the literature, the TS approach will be extended to essentially infinite dimensional systems through the solution of stochastic PDEs. In making these comparisons, the advantages of modern computing tools such as computer algebra systems and simulation software, when used as an adjunct to the solution of SDEs or their associated FPK equations, are demonstrated.

Exponential stabilization of non-autonomous delayed neural networks via Riccati equations

This paper concerns with the problem of exponential stabilization for a class of non-autonomous neural networks with mixed discrete and distributed time-varying delays. Two cases of discrete time-varying delay, namely (i) slowly time-varying; and (ii) fast time-varying, are considered. By constructing an appropriate Lyapunov-Krasovskii functional in case (i) and utilizing the Razumikhin technique in case (ii), we establish some new delay-dependent conditions for designing a memoryless state feedback controller which stabilizes the system with an exponential convergence of the resulting closed-loop system. The proposed conditions are derived through solutions of some types of Riccati differential equations. Applications to control a class of autonomous neural networks with mixed time-varying delays are also discussed in this paper. Some numerical examples are provided to illustrate the effectiveness of the obtained results.