相关论文: An efficient algorithm for locating and continuing…

A successive continuation method for locating connecting orbits in parametrized systems of autonomous ODEs is considered. A local convergence analysis is presented and several illustrative numerical examples are given.

We propose new methods for the numerical continuation of point-to-cycle connecting orbits in 3-dimensional autonomous ODE's using projection boundary conditions. In our approach, the projection boundary conditions near the cycle are…

In Part I of this paper we discussed new methods for the numerical continuation of point-to-cycle connecting orbits in 3-dimensional autonomous ODE's using projection boundary conditions. In this second part we extend the method to the…

Path finding algorithm addresses problem of finding shortest path from source to destination avoiding obstacles. There exist various search algorithms namely A*, Dijkstra's and ant colony optimization. Unlike most path finding algorithms…

An algorithm for detecting periodic orbits in chaotic systems [Phys. Rev. E, 60 (1999), pp.~6172--6175], which combines the set of stabilising transformations proposed by Schmelcher and Diakonos [Phys. Rev. Lett., 78 (1997), pp.~4733--4736]…

An algorithm for detecting unstable periodic orbits in chaotic systems [Phys. Rev. E, 60 (1999), pp. 6172-6175] which combines the set of stabilising transformations proposed by Schmelcher and Diakonos [Phys. Rev. Lett., 78 (1997), pp.…

We describe a simple algorithm for classifying orbits into orbit families. This algorithm works by finding patterns in the sign changes of the principal coordinates. Orbits in the logarithmic potential are studied as an application; we…

We present an algorithm based on continuation techniques that can be applied to solve numerically minimization problems with equality constraints. We focus on problems with a great number of local minima which are hard to obtain by local…

An alternative numerical method is developed to find stable and unstable periodic orbits of nonlinear dynamical systems. The method exploits the high-efficiency of the Levenberg-Marquardt algorithm for medium-sized problems and has the…

We present a novel orbit parameterization in spherical coordinates. This parameterization enables the mixing of varying and invariant orbital parameters, and clarifies the physics of the orbit. It also simplifies the process of placing…

We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we…

The surge of deep-space probes makes it unsustainable to navigate them with standard radiometric tracking. Self-driving interplanetary satellites represent a solution to this problem. In this work, a full vision-based navigation algorithm…

We describe how orbital graphs can be used to improve the practical performance of many algorithms for permutation groups, including intersection and stabilizer problems. First we explain how orbital graphs can be integrated in partition…

We present here a new method which applies well ordered symbolic dynamics to find unstable periodic and non-periodic orbits in a chaotic system. The method is simple and efficient and has been successfully applied to a number of different…

We introduce an approach for exploring eigenvector localization phenomena for a class of (unbounded) selfadjoint operators. More specifically, given a target region and a tolerance, the algorithm identifies candidate eigenpairs for which…

We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…

We propose a decentralized subspace algorithm for identification of large-scale, interconnected systems that are described by sparse (multi) banded state-space matrices. First, we prove that the state of a local subsystem can be…

A method for determining the orbital parameters of interacting pairs of galaxies is presented and evaluated using artificial data. The method consists of a genetic algorithm which can search efficiently through the very large space of…

In this paper we present efficient algorithmic solutions for several constrained resource allocation, management and discovery problems. We consider new types of resource allocation models and constraints, and we present new geometric…

A model of a geometric algorithm is introduced and methodology of its operation is presented for the dynamic partitioning of data spaces.