An Algorithm for Computing a New Normal Form for Dynamical Systems
โ Scribed by Guoting Chen; Jean Della Dora
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 378 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
โฆ Synopsis
We propose in this paper a new normal form for dynamical systems or vector fields which improves the classical normal forms in the sense that it is a further reduction of the classical normal forms. We give an algorithm for an effective computation of these normal forms. Our approach is rational in the sense that if the coefficients of the system are in a field K (which, in practice, is Q, R), so is the normal form and all computations are done in K. As a particular case, if the matrix of the linear part is a companion matrix then we reduce the dynamical system to a single differential equation. Our method is applicable for both the nilpotent and the non-nilpotent cases. We have implemented our algorithm in Maple V and obtained many examples of the further reduced normal forms up to some finite order.
๐ SIMILAR VOLUMES
We consider the problem of finding an optimal and sub-optimal allocation of program modules onto processors of a distributed computing system. A module causes two types of cost to be incurred at the processor to which it is allocated-an execution cost for processing the module, and a communication c
There is increasing use of high-resolution NMR spectroscopy to examine variations in cell metabolism and/or structure in response to numerous physical, chemical, and biological agents. In these types of studies, in order to obtain relative quantitative information, a comparison between signal intens
In this paper, a modified approach for obtaining normal forms of non-linear dynamical systems is described. This approach provides a number of significant advantages over the existing normal form theory, and improves the associated calculations. A brief discussion concerning the application of the n
A new algorithm is presented for the computation of canonical forms of matrices over fields. These are the Primary Rational, Rational, and Jordan canonical forms. The algorithm works by obtaining a decomposition of the vector space acted on by the given matrix into primary cyclic spaces (spaces whos
This paper reports on a new algorithm to compute the asymptotic solutions of a linear differential system. A feature of the algorithm is the ability to accommodate periodic coefficients.