An algorithm for symbolic computation of center manifolds

16Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A useful technique for the study of local bifurcations is the center manifold theory because a dimensional reduction is achieved. The computation of Taylor series approximations of center manifolds gives rise to several difficulties regarding the operational complexity and the computational effort. Previous works proceed in such a way that the computational effort is not optimized. In this paper an algorithm for center manifolds well suited to symbolic computation is presented. The algorithm is organized according to an iterative scheme making good use of the previous steps, thereby minimizing the number of operations. The results of two examples obtained through a REDUCE 3.2 implementation of the algorithm are included.

Cite

CITATION STYLE

APA

Freire, E., Gamero, E., Ponce, E., & Franquelo, L. G. (1989). An algorithm for symbolic computation of center manifolds. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 358 LNCS, pp. 218–230). Springer Verlag. https://doi.org/10.1007/3-540-51084-2_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free