Related papers: Continued fractions and Parallel SQUFOF
We study partial fraction decompositions (PFDs) in several variables using tools from commutative algebra. We give criteria for when a rational function with poles on a hyperplane arrangement has a desirable PFD. Our criteria are obtained…
It has been a long standing problem to find good symbolic codings for translations on the $d$-dimensional torus that enjoy the beautiful properties of Sturmian sequences like low factor complexity and good local discrepancy properties.…
The $N$-point discrete Fourier transform (DFT) is a cornerstone for several signal processing applications. Many of these applications operate in real-time, making the computational complexity of the DFT a critical performance indicator to…
The classical theory of continued fractions has been widely studied for centuries for its important properties of good approximation, and more recently it has been generalized to $p$-adic numbers where it presents many differences with…
Parallel Diffusion is a variant of Chip-Firing introduced in 2018 by Duffy et al. In Parallel Diffusion, chips move from places of high concentration to places of low concentration through a discrete-time process. At each time step, every…
Multiresolution Matrix Factorization (MMF) was recently introduced as a method for finding multiscale structure and defining wavelets on graphs/matrices. In this paper we derive pMMF, a parallel algorithm for computing the MMF…
We introduced a new continued fraction expansions in our previous paper. For these expansions, we show formulae of probability about incomplete quotients. Furthermore, we prove the existence of invariant measures with respect to the…
Computing the Sparse Fast Fourier Transform(sFFT) of a K-sparse signal of size N has emerged as a critical topic for a long time. The sFFT algorithms decrease the runtime and sampling complexity by taking advantage of the signal inherent…
Sparse, irregular graphs show up in various applications like linear algebra, machine learning, engineering simulations, robotic control, etc. These graphs have a high degree of parallelism, but their execution on parallel threads of modern…
The convergence property of a stochastic algorithm for the self-consistent field (SCF) calculations of electron structures is studied. The algorithm is formulated by rewriting the electron charges as a trace/diagonal of a matrix function,…
We fill a gap in the proof of the transversality result for quilted Floer trajectories in arXiv:0905.1370 by addressing trajectories for which some but not all components are constant. Namely we show that for generic sets of split…
We consider the geometric generalization of ordinary continued fraction to the multidimensional case introduced by F. Klein in 1895. A multidimensional periodic continued fraction is the union of sails with some special group acting freely…
In this small paper we bring together various open problems on geometric multidimensional continued fractions.
This paper introduces a fast algorithm, applicable throughout the electromagnetic spectrum, for the numerical solution of problems of scattering by periodic surfaces in two-dimensional space. The proposed algorithm remains highly accurate…
We propose a method to interpolate Signed Distance Function (SDF) data from a discrete set of samples. Unlike prior work, our approach ensures that the new SDF data values are fully consistent with the input and each other, such that the…
This paper concerns the relationships between continued fractions and the geometry of the Stern-Brocot diagram. Each rational number can be expressed as a continued fraction $[a_0; a_1, \ldots, a_n]$ whose terms $a_i$ are integers and are…
This work highlights the existence of partial symmetries in large families of iterated plethystic coefficients. The plethystic coefficients involved come from the expansion in the Schur basis of iterated plethysms of Schur functions indexed…
The Classic Howard's algorithm, a technique of resolution for discrete Hamilton-Jacobi equations, is of large use in applications for its high efficiency and good performances. A special beneficial characteristic of the method is the…
This study presents miscellaneous properties of pseudo-factorials, which are numbers whose recurrence relation is a twisted form of that of usual factorials. These numbers are associated with special elliptic functions, most notably, a…
An application of (iterated) Bauer-Muir acceleration can give an Ap\'ery-like continued fraction for $\pi$ with irrational coefficients, and much faster convergence. It can be considered a generalized continued fraction with the same matrix…