Related papers: Geodesic continued fractions and LLL
We examine a pair of dynamical systems on the plane induced by a pair of spanning trees in the Cayley graph of the Super-Apollonian group of Graham, Lagarias, Mallows, Wilks and Yan. The dynamical systems compute Gaussian rational…
In this article we generalize Borel's classical approximation results for the regular continued fraction expansion to the alpha-Rosen fraction expansion, using a geometric method. We give a Haas-Series-type result about all possible good…
The Lagrange theorem on continued fractions states that a number is a quadratic surd if and only if its continued fraction expansion is eventually periodic. The current paper is devoted to a multidimensional generalization of this fact. As…
We study a natural extension to complex numbers of the standard continued fractions. The basic algorithm is due to Lagrange and Gauss, though it seems to have gone mostly unnoticed as a way to create continued fractions. The new…
In 1982, Lagarias showed that solving the approximate Shortest Vector Problem also solves the problem of finding good simultaneous Diophantine approximations. Here we provide a deterministic, dimension-preserving reduction in the reverse…
In this paper, we present perturbation analysis and randomized algorithms for the total least squares (TLS) problems. We derive the perturbation bound and check its sharpness by numerical experiments. Motivated by the recently popular…
The method of ``Total Least Squares'' is proposed as a more natural way (than ordinary least squares) to approximate the data if both the matrix and and the right-hand side are contaminated by ``errors''. In this tutorial note, we give a…
The state of the art in approximation algorithms for facility location problems are complicated combinations of various techniques. In particular, the currently best 1.488-approximation algorithm for the uncapacitated facility location…
We establish a law of the iterated logarithm (LIL) for the set of real numbers whose $n$-th partial quotient is bigger than $\alpha_n$, where $(\alpha_n)$ is a sequence such that $\sum 1/\alpha_n$ is finite. This set is shown to have…
Hurwitz (1887) defined a continued fraction algorithm for complex numbers which is better behaved in many respects than a more "natural" extension of the classical continued fraction algorithm to the complex plane would be. Although the…
A basic result in the elementary theory of continued fractions says that two real numbers share the same tail in their continued fraction expansions iff they belong to the same orbit under the projective action of PGL(2,Z). This result was…
We introduce the continued logarithm representation of real numbers and prove results on the occurrence and frequency of digits with respect to this representation
We present a new efficient algortithm for construction of linear latent structure (LLS) models. This algorithm reduces a problem of estimation of model parameters to a sequence of problems of linear algebra, which assures a low…
In the Sparse Linear Regression (SLR) problem, given a $d \times n$ matrix $M$ and a $d$-dimensional query $q$, the goal is to compute a $k$-sparse $n$-dimensional vector $\tau$ such that the error $||M \tau-q||$ is minimized. This problem…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
The present paper is in a sense a continuation of \cite{PLS}, it relies on the notation and some results. The problem tackled in both papers is the nature of the continued fraction expansion of $\sqrt[3]{2}$: are the partial quotients…
In \cite{GCF} it is proved that any quadratic irrational number has a representation as a continuous, infinite and periodic fraction. In 1848, Charles Hermite through a letter Jacobi \cite{Per} wondered if this fact could be generalized to…
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseudorandom with respect to linear phases. The Goldreich-Levin…
In this paper, we discuss the acceleration of the regularized alternating least square (RALS) algorithm for tensor approximation. We propose a fast iterative method using a Aitken-Stefensen like updates for the regularized algorithm.…
Analytic methods to investigate periodic orbits in galactic potentials. To evaluate the quality of the approximation of periodic orbits in the logarithmic potential constructed using perturbation theory based on Hamiltonian normal forms.…