zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
The Lindstedt-Poincaré technique as an algorithm for computing periodic orbits. (English) Zbl 0979.65115
Summary: The Lindstedt-Poincaré technique in perturbation theory is used to calculate periodic orbits of perturbed differential equations. It uses a nearby periodic orbit of the unperturbed differential equation as the first approximation. We derive a numerical algorithm based upon this technique for computing periodic orbits of dynamical systems. The algorithm, unlike the Lindstedt-Poincaré technique, does not require the dynamical system to be a small perturbation of a solvable differential equation. This makes it more broadly applicable. The algorithm is quadratically convergent. It works with equal facility, as examples show, irrespective of whether the periodic orbit is attracting, or repelling, or a saddle. One of the examples presents what is possibly the most accurate computation of Hill’s orbit of lunation since its justly celebrated discovery in 1878.

65P10Numerical methods for Hamiltonian systems including symplectic integrators
37C27Periodic orbits of vector fields and flows
37M15Symplectic integrators (dynamical systems)
Full Text: DOI