A fast algorithm for LR-2 factorization of Toeplitz matrices

In this paper a new order recursive algorithm for the efficient −1 factorization of Toeplitz matrices is described. The proposed algorithm can be seen as a fast modified Gram-Schmidt method which recursively computes the orthonormal columns i, i = 1,2, …,p, of , as well as the elements of R−1, of a Toeplitz matrix with dimensions L × p. The factor estimation requires 8Lp MADS (multiplications and divisions). Matrix −1 is subsequently estimated using 3p2 MADS. A faster algorithm, based on a mixed and −1 updating scheme, is also derived. It requires 7Lp + 3.5p2 MADS. The algorithm can be efficiently applied to batch least squares FIR filtering and system identification. When determination of the optimal filter is the desired task it can be utilized to compute the least squares filter in an order recursive way. The algorithm operates directly on the experimental data, overcoming the need for covariance estimates. An orthogonalized version of the proposed −1 algorithm is derived. Matlab code implementing the algorithm is also supplied

Poincar\'e surfaces of section around a 3-D irregular body: The case of asteroid 4179 Toutatis

In general, small bodies of the solar system, e.g., asteroids and comets, have a very irregular shape. This feature affects significantly the gravitational potential around these irregular bodies, which hinders dynamical studies. The Poincar\'e surface of sec- tion technique is often used to look for stable and chaotic regions in two-dimensional dynamic cases. In this work, we show that this tool can be useful for exploring the surroundings of irregular bodies such as the asteroid 4179 Toutatis. Considering a rotating system with a particle, under the effect of the gravitational field computed three-dimensionally, we define a plane in the phase space to build the Poincar\'e surface of sections. Despite the extra dimension, the sections created allow us to find trajec- tories and classify their stabilities. Thus, we have also been able to map stable and chaotic regions, as well as to find correlations between those regions and the contri- bution of the third dimension of the system to the trajectory dynamics as well. As examples, we show details of periodic(resonant or not) and quasi-periodic trajectories

On the Erigone family and the z2z_2 secular resonance

The Erigone family is a C-type group in the inner main belt. Its age has been estimated by several researchers to be less then 300 My, so it is a relatively young cluster. Yarko-YORP Monte Carlo methods to study the chronology of the Erigone family confirm results obtained by other groups. The Erigone family, however, is also characterized by its interaction with the $z_2$ secular resonance. While less than 15% of its members are currently in librating states of this resonance, the number of objects, members of the dynamical group, in resonant states is high enough to allow to use the study of dynamics inside the $z_2$ resonance to set constraints on the family age. Like the ${\nu}_{6}$ and $z_1$ secular resonances, the $z_2$ resonance is characterized by one stable equilibrium point at $\sigma = 180^{\circ}$ in the $z_2$ resonance plane $(\sigma, \frac{d\sigma}{dt})$, where $\sigma$ is the resonant angle of the $z_2$ resonance. Diffusion in this plane occurs on timescales of $\simeq 12$ My, which sets a lower limit on the Erigone family age. Finally, the minimum time needed to reach a steady-state population of $z_2$ librators is about 90 My, which allows to impose another, independent constraint on the group age.Comment: This paper has 11 pages, 12 figures, and 1 table. Accepted for publication in MNRA

Architectures for block Toeplitz systems

In this paper efficient VLSI architectures of highly concurrent algorithms for the solution of block linear systems with Toeplitz or near-to-Toeplitz entries are presented. The main features of the proposed scheme are the use of scalar only operations, multiplications/divisions and additions, and the local communication which enables the development of wavefront array architecture. Both the mean squared error and the total squared error formulations are described and a variety of implementations are given

Simple and Efficient Local Codes for Distributed Stable Network Construction

In this work, we study protocols so that populations of distributed processes can construct networks. In order to highlight the basic principles of distributed network construction we keep the model minimal in all respects. In particular, we assume finite-state processes that all begin from the same initial state and all execute the same protocol (i.e. the system is homogeneous). Moreover, we assume pairwise interactions between the processes that are scheduled by an adversary. The only constraint on the adversary scheduler is that it must be fair. In order to allow processes to construct networks, we let them activate and deactivate their pairwise connections. When two processes interact, the protocol takes as input the states of the processes and the state of the their connection and updates all of them. Initially all connections are inactive and the goal is for the processes, after interacting and activating/deactivating connections for a while, to end up with a desired stable network. We give protocols (optimal in some cases) and lower bounds for several basic network construction problems such as spanning line, spanning ring, spanning star, and regular network. We provide proofs of correctness for all of our protocols and analyze the expected time to convergence of most of them under a uniform random scheduler that selects the next pair of interacting processes uniformly at random from all such pairs. Finally, we prove several universality results by presenting generic protocols that are capable of simulating a Turing Machine (TM) and exploiting it in order to construct a large class of networks.Comment: 43 pages, 7 figure

Comparison between Laplace-Lagrange Secular Theory and Numerical Simulation

The large increase in exoplanet discoveries in the last two decades showed a variety of systems whose stability is not clear. In this work we chose the $\upsilon$ Andromedae system as the basis of our studies in dynamical stability. This system has a range of possible masses, as a result of detection by radial velocity method, so we adopted a range of masses for the planets $c$ and $d$ and applied the secular theory. We also performed a numerical integration of the 3-body problem for the system over a time span of 30 thousand years. The results exposed similarities between the secular perturbation theory and the numerical integration, as well as the limits where the secular theory did not present good results. The analysis of the results provided hints for the maximum values of masses and eccentricities for stable planetary systems similar to $\upsilon$ Andromedae