Computation of normal forms
DOI10.1016/0377-0427(90)90353-2zbMATH Open0687.65075OpenAlexW2069800351MaRDI QIDQ1263255FDOQ1263255
Authors: Byron Drachman, Duo Wang, Shui-Nee Chow 
Publication date: 1990
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(90)90353-2
Recommendations
numerical examplescomputer algebranormal formnonlinear dynamicsdifferential systemsymbolic computationprogramsymbolic manipulator MACSYMA
Symbolic computation and algebraic computation (68W30) Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Dynamical systems and ergodic theory (37-XX)
Cites Work
- Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
- Title not available (Why is that?)
- A simple global characterization for normal forms of singular vector fields
- Singularities of vector fields
- Title not available (Why is that?)
- Asymptotics beyond All Orders in a Model of Crystal Growth
Cited In (43)
- HILBERT'S 16TH PROBLEM AND BIFURCATIONS OF PLANAR POLYNOMIAL VECTOR FIELDS
- System stability analysis via a perturbation technique
- Computing normal forms and formal invariants of dynamical systems by means of word series
- Title not available (Why is that?)
- Computing Tiny Clause Normal Forms
- Underspecified computation of normal forms
- Title not available (Why is that?)
- On the computation of the coefficients associated with high order normal forms
- On keys and normal forms
- Some computational problems related to Boyce-Codd normal form
- Simplest Normal Forms of Hopf–Neimark–Sacker Bifurcations
- Title not available (Why is that?)
- The limited effectiveness of normal forms: A critical review and extension of local bifurcation studies of the Brusselator PDE
- Determinacy of degenerate equilibria with linear part \(x'=y\), \(y'=0\) using MACSYMA
- Numeric deduction in symbolic computation. Application to normalizing transformations
- Practical normal form computations for vector fields
- An algorithm for computing a new normal form for dynamical systems
- A SUFFICIENT CONDITION FOR THE UNIQUENESS OF NORMAL FORMS AND UNIQUE NORMAL FORMS OF GENERALIZED HOPF SINGULARITIES
- Title not available (Why is that?)
- Normal forms
- Title not available (Why is that?)
- Computation of the normal form as well as the unfolding of the vector field with zero-zero-Hopf bifurcation at the origin
- Title not available (Why is that?)
- Normal forms for binary relations
- A recursive approach to compute normal forms
- Automated computation of robust normal forms of planar analytic vector fields
- The Method of Normal Forms
- SIMPLEST NORMAL FORMS OF HOPF AND GENERALIZED HOPF BIFURCATIONS
- Symbolic computation of normal forms for semi-simple cases
- An Algorithm for Construction of Normal Forms
- Symbolic computation of normal forms for nonlinear Hamiltonian systems
- Normal forms and computation for four-dimension of general nonlinear dynamical systems
- Symbolic-numerical methods for the computation of normal forms of PDEs
- Title not available (Why is that?)
- Computation of the normal forms for general M-DOF systems using multiple time scales. II: Non-autonomous systems
- Computation of focus values with applications
- Computation of the normal forms for general M-DOF systems using multiple time scales. I: Autonomous systems
- Computation of normal form and unfolding of codimension-3 zero-Hopf-Hopf bifurcation
- Normal form and unfolding of vector field with codimension-3 triple Hopf bifurcation
- Recursive bifurcation formulae for normal form and center manifold theory
- On Normal Form Computations
- Title not available (Why is that?)
- A matching pursuit technique for computing the simplest normal forms of vector fields
Uses Software
This page was built for publication: Computation of normal forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1263255)
