Related papers: Successive Continuation for Locating Connecting Or…
The order in which plane-filling curves visit points in the plane can be exploited to design efficient algorithms. Typically, the curves are useful because they preserve locality: points that are close to each other along the curve tend to…
There is ever growing demand for satellite constellations that perform global positioning, remote sensing, earth-imaging and relay communication. In these highly prized orbits, there are many obsolete and abandoned satellites and components…
Iterated localization is considered where each node of a network needs to get localized (find its location on 2-D plane), when initially only a subset of nodes have their location information. The iterated localization process proceeds as…
In this article we discuss Bousfield localization, beginning with definitions in terms of mapping spaces and working up to a discussion of how they can be constructed when we have access to the small object argument. We also discuss…
The `lid' algorithm performs an exhaustive exploration of neighborhoods of local energy minima of energy landscapes. This paper describes an implementation of the algorithm, including issues of parallel performance and scalability. To…
For a continuous self-map of a compact metric space, we provide a sufficient condition for the orbit of a point to converge to a periodic orbit or an odometer. We show that if a continuous self-map of a compact metric space has the…
In this paper, we further consider the symmetry-based method for seeking nonlocally related systems for partial differential equations. In particular, we show that the symmetry-based method for partial differential equations is the natural…
Separation of variables by means of the orbit method is implemented to integrable systems on coadjoint orbits in an $\mathfrak{sl}(4)$ loop algebra. This is a development and a kind of explanation for Sklyanin's procedure of separation of…
We propose an algorithm for the Wireless Sensor Network localization problem, which is based on the well-known algorithmic framework of Alternating Minimization. We start with a non-smooth and non-convex minimization, and transform it into…
In this paper, an autonomous method of satellite detection and tracking in images is implemented using optical flow. Optical flow is used to estimate the image velocities of detected objects in a series of space images. Given that most…
From a group action on a space, define a variant of the configuration space by insisting that no two points inhabit the same orbit. When the action is almost free, this "orbit configuration space" is the complement of an arrangement of…
A simple procedure is developed to determine orbital elements of an object orbiting in a central force field which contribute more than three independent celestial positions. By manipulation of formal three point Gauss method of orbit…
The parallel orbital-updating approach is an orbital/eigenfunction iteration based approach for solving eigenvalue problems when many eigenpairs are required. It has been proven to be efficient, for instance, in electronic structure…
We study complex analytic (possibly singular) projective connections on the plane. We characterize some of them in terms of their families of integral curves. We also give a beginning of classification of second order odes polynomial in the…
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…
We present a novel algorithm for (i) detecting approximate symmetries inherently present among spatially localized molecular orbitals and (ii) enforcing these in numerically exact manners by means of unitary optimization techniques. The…
In this paper, we propose a novel trajectory learning method that exploits motion trajectories on topological map using recurrent neural network for temporally consistent geolocalization of object. Inspired by human's ability to both be…
A robust drift-safe rendezvous trajectory optimization tool is developed in this work, with applications to orbital rendezvous and proximity operations. The method is based on direct collocation and utilizes a sequential convex programming…
We consider the problem of classifying a map using a team of communicating robots. It is assumed that all robots have localized visual sensing capabilities and can exchange their information with neighboring robots. Using a graph…
Anderson localization provides a challenge to numerical approaches due to the inherent randomness, and hence absence of simple symmetries, in its discrete Hamiltonian representation. Numerous algorithmic approaches have been developed or…