Ways of computing a normal form
The system of ordinary differential equation \(\dot X= AX+F(x)\) is considered, where \(X\in\mathbb{C}^n\), \(A\) is a constant matrix and the components \(f_i\) of the vector \(F\) are formal power series having neither free nor linear terms. The author considers formal changes of coordinates of the form \(X= Y+G(Y)\), where \(G\) has the same properties as \(F\), when this change transforms the starting system into the formal system \(\dot Y= AY+H(Y)\), where \(H=H'\) (\(H'\) is the resonant part of \(H\)). In this paper, one can find a survey of the author's results on different ways on computing the described transformations. At the end these ways are compared.
- Power geometry and four applications
- On transformations into normal form
- Normal forms
- Some methods for ``normalizing patterns
- scientific article; zbMATH DE number 5944345 (Why is no real title available?)
- On Normal Form Computations
- scientific article; zbMATH DE number 4177591 (Why is no real title available?)
- scientific article; zbMATH DE number 5008071 (Why is no real title available?)
- scientific article; zbMATH DE number 17895 (Why is no real title available?)
- Algorithms of the local nonlinear analysis
- The Method of Normal Forms
- Underspecified computation of normal forms
- The applications of a modified normal form approach.
This page was built for publication: Ways of computing a normal form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363264)