Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An Algorithm for Computing Quasi-Homogeneous Formal Normal Forms under Equivalence

An Algorithm for Computing Quasi-Homogeneous Formal Normal Forms under Equivalence This paper presents a recursive algorithm which is useful for computing normal forms of vector fields using smooth orbital equivalence. The case of vector fields with a singularity corresponding to a triple-zero eigenvalue with geometric multiplicity one is considered in detail. The results obtained are applied to the study of a simple electronic device, with only one nonlinearity. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Applicandae Mathematicae Springer Journals

An Algorithm for Computing Quasi-Homogeneous Formal Normal Forms under Equivalence

Loading next page...
 
/lp/springer-journals/an-algorithm-for-computing-quasi-homogeneous-formal-normal-forms-under-MwsGqQfVEh

References (22)

Publisher
Springer Journals
Copyright
Copyright © 2004 by Kluwer Academic Publishers
Subject
Mathematics; Mathematics, general; Computer Science, general; Theoretical, Mathematical and Computational Physics; Complex Systems; Classical Mechanics
ISSN
0167-8019
eISSN
1572-9036
DOI
10.1023/B:ACAP.0000018769.73927.a4
Publisher site
See Article on Publisher Site

Abstract

This paper presents a recursive algorithm which is useful for computing normal forms of vector fields using smooth orbital equivalence. The case of vector fields with a singularity corresponding to a triple-zero eigenvalue with geometric multiplicity one is considered in detail. The results obtained are applied to the study of a simple electronic device, with only one nonlinearity.

Journal

Acta Applicandae MathematicaeSpringer Journals

Published: Oct 5, 2004

There are no references for this article.