A recursive approach to compute normal forms
DOI10.1006/JSVI.2000.3422zbMATH Open1237.34002OpenAlexW2044771992MaRDI QIDQ2882076FDOQ2882076
Authors: L. Hsu, L. J. Min, L. Favretto 
Publication date: 3 May 2012
Published in: Journal of Sound and Vibration (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsvi.2000.3422
Recommendations
- Computation of normal forms
- An explicit recursive formula for computing the normal forms associated with semisimple cases
- Recursive bifurcation formulae for normal form and center manifold theory
- AN EFFICIENT METHOD FOR COMPUTING THE SIMPLEST NORMAL FORMS OF VECTOR FIELDS
- Symbolic computation of normal forms for semi-simple cases
Transformation and reduction of ordinary differential equations and systems, normal forms (34C20) Normal forms for dynamical systems (37G05) Software, source code, etc. for problems pertaining to ordinary differential equations (34-04)
Cited In (14)
- A canonical model for gradient frequency neural networks
- Computing Tiny Clause Normal Forms
- Underspecified computation of normal forms
- An algorithm for computing quasi-homogeneous formal normal forms under equivalence
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computation of normal forms
- Centre-manifold reduction of bifurcating flows
- Title not available (Why is that?)
- Symbolic computation of normal forms for semi-simple cases
- Normal forms and computation for four-dimension of general nonlinear dynamical systems
- Recursive bifurcation formulae for normal form and center manifold theory
- On Normal Form Computations
- An explicit recursive formula for computing the normal forms associated with semisimple cases
Uses Software
This page was built for publication: A recursive approach to compute normal forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2882076)
