Search

In recent years, intensive research has been done at the Brno University of Technology Faculty of Information Technology Department of Intelligent Systems in the field of numerical solutions of systems of ordinary and partial differential equations. The basic numerical method employed is the so-called Modern Taylor Series Method (MTSM). It has been described, studied, and numerous aspects have been investigated such as processing in parallel systems. Also a simulation system TKSL has been developed which is based on the Taylor series method. For some results see [1], [2]. Although there have been considerable practical results, theoretical issues are yet to be investigated since the underlying method has been devised by analogy with analogue solvers of such systems. In this paper we provide only a basic idea of a theoretical background. The MTSM is based on a transformation of the initial problem into another initial problem with polynomials on the right-hand sides. This is a precondition for a Taylor series method to be successfully applied to the task of finding a numerical solution. The solution of the transformed initial problem then includes the solution of the original original system. A transformation similar to that described in this paper can be found in [3]. Practical aspects are discussed in [4], and [1]. An outline of the special type transformations for functions commonly encountered in initial problems can be found in [5]. The MTSM uses various types of recurrent formulae that can be used to calculate the Taylor series terms of the unknown functions. They include the detection of polynomial solutions.Another type of recurrent formulae clears the way for parallel programs to be used for solving. This type might also be of some interest for further research since it defines another type of initial problem where the right-hand sides include only powers of unknown functions. [ABSTRACT FROM AUTHOR]

This article describes a parallel computational technique to accelerate radial point interpolation method (RPIM)-based meshfree method using graphics hardware. RPIM is one of the meshfree partial differential equation solvers that do not require the mesh structure of the analysis targets. In this paper, a technique for accelerating RPIM using graphics hardware is presented. In the method, the computation process is divided into small processes suitable for processing on the parallel architecture of the graphics hardware in a single instruction multiple data manner. [ABSTRACT FROM AUTHOR]

This paper deals with ADI type schemes in the numerical solution of the large systems of stiff ODEs that arise after spatial discretization of the Heston PDE from financial option pricing. A feature of this well-known two-dimensional PDE is the presence of a mixed spatial derivative term, and ADI schemes were not originally developed to handle such terms. We discuss how to adapt three ADI schemes and next we review theoretical results and perform numerical experiments. [ABSTRACT FROM AUTHOR]

This symposium brings together a number of researchers from all over the world who have been working on the development and testing of high order finite difference schemes for a variety of partial differential equations, with applications including problems of viscous fluid flows. [ABSTRACT FROM AUTHOR]

The simulation of complex systems describing different physical effects becomes more and more of interest in various applications. Examples are couplings describing interactions between circuits and semiconductor devices, circuits and electromagnetic fields, fluids and structures. The modeling of such complex processes [1, 2, 3, 4, 7, 8] often leads to coupled systems that are composed of ordinary differential equations (ODEs), differential-algebraic equations (DAEs) and partial differential equations (PDEs). Such coupled systems can be regarded in the general framework of abstract differential-algebraic equations. Here, we discuss a Galerkin approach for handling linear abstract differential-algebraic equations with monotone operators. It is shown to provide solutions that converge to the unique solution of the abstract differential-algebraic system. Furthermore, the solution is proved to depend continuously on the data. The most interesting point of the Galerkin approach is the choice of basis functions. They have to be chosen in proper subspaces in order to guarantee that the solution satisfies the non-dynamic constraints. In contrast to other approaches as e.g. [5, 6], this approach allows time dependent operators but needs monotonicity. [ABSTRACT FROM AUTHOR]

A simple elliptic equation method is used for constructing exact trevelling wave solutions of nonlinear partial differential equations(PDEs) in a unified way. With the aid of Maple, more new travelling solitary wave and periodic solutions are obtained for the generalized Kawahara equation. [ABSTRACT FROM AUTHOR]

We fully utilize Peano kernels theorem to the error estimates of bivariate self-validating integration based on product cubature rules. This application enable adaptive local error estimates. We demonstrate the characteristics and effectiveness of our methods by comparing it with a conventional integrator. [ABSTRACT FROM AUTHOR]