Convergence Results for Invariant Curve Algorithms
Copyright policy )Convergence Results for Invariant Curve Algorithms
In this paper a convergence result for the algorithm described by Kevrekidis et al. [7] is given. It is shown that this algorithm for the approximation of an invariant curve converges provided the curve is attracting. The approximation error is estimated. Numerical examples for three different algorithms in this class and a closely related one illustrate the theory.
convergence, Numerical examples, Topological structure of integral curves, singular points, limit cycles of ordinary differential equations, Attractors and repellers of smooth dynamical systems and their topological structure, invariant curve, attracting algorithm, Stability and convergence of numerical methods for ordinary differential equations
convergence, Numerical examples, Topological structure of integral curves, singular points, limit cycles of ordinary differential equations, Attractors and repellers of smooth dynamical systems and their topological structure, invariant curve, attracting algorithm, Stability and convergence of numerical methods for ordinary differential equations
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).14 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!