A recursive approach to compute normal forms
From MaRDI portal
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
Cited in
(14)- Computation of normal forms
- Symbolic computation of normal forms for semi-simple cases
- Recursive bifurcation formulae for normal form and center manifold theory
- An explicit recursive formula for computing the normal forms associated with semisimple cases
- On Normal Form Computations
- Centre-manifold reduction of bifurcating flows
- Normal forms and computation for four-dimension of general nonlinear dynamical systems
- scientific article; zbMATH DE number 4058922 (Why is no real title available?)
- Computing Tiny Clause Normal Forms
- scientific article; zbMATH DE number 5176850 (Why is no real title available?)
- Underspecified computation of normal forms
- scientific article; zbMATH DE number 7324347 (Why is no real title available?)
- An algorithm for computing quasi-homogeneous formal normal forms under equivalence
- A canonical model for gradient frequency neural networks
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)
