A new transvectant algorithm for nilpotent normal forms (Q2373820): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.jde.2007.03.016 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.JDE.2007.03.016 / rank
 
Normal rank

Latest revision as of 06:36, 18 December 2024

scientific article
Language Label Description Also known as
English
A new transvectant algorithm for nilpotent normal forms
scientific article

    Statements

    A new transvectant algorithm for nilpotent normal forms (English)
    0 references
    16 July 2007
    0 references
    From the authors' introduction: The authors propose an algorithm for putting a system of differential equations \[ \dot{x}=Ax+v(x) \] into normal form with repect to its linear part \(A\); here \(v\) is a formal power series. More precisely, given a nilpotent matrix \(A\) in Jordan form, they provide a procedure that solves the problem assuming the latter is already solved for each Jordan block of \(A\) taken separately. The problem refers to the description of the normal form space of \(A,\) that is, the set of all \(v\) such that \(Ax+v(x)\) is in normal form. The algorithm is based on the notion of transvectant, from classical invariant theory and the procedure is illustrated with several examples.
    0 references
    normal form
    0 references
    invariant theory
    0 references
    transvectant
    0 references
    nilpotent
    0 references
    0 references
    0 references

    Identifiers