Algorithmic Derivation Of Centre Conditions

Authors:
J. M. Pearson;N. G. Lloyd;C. J. Christopher
Affiliations:
-;-;-
Venue:
SIAM Review
Year:
1996

Citing 0
Cited 7

Computer evaluation of cyclicity in planar cubic system

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Symmetry in planar dynamical systems

Journal of Symbolic Computation
Cited References

Computer algebra handbook
Implementation of a new algorithm of computation of the Poincaré-Liapunov constants

Journal of Computational and Applied Mathematics
Limit cycles of polynomial differential systems with homogeneous nonlinearities of degree 4 via the averaging method

Journal of Computational and Applied Mathematics
Limit cycles bifurcate from centers of discontinuous quadratic systems

Computers & Mathematics with Applications
Kukles revisited: Advances in computing techniques

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The conditions for a critical point of a polynomial differential system to be a centre are of particular significance because of the frequency with which they are required in applications. We demonstrate how computer algebra can be effectively employed in the search for necessary and sufficient conditions for critical points of such systems to be centres. We survey recent developments and illustrate our approach by means of examples.