Related papers: Old and new algorithms for pi
We propose a new algorithm for envelope estimation, along with a new root n consistent method for computing starting values. The new algorithm, which does not require optimization over a Grassmannian, is shown by simulation to be much…
Algorithms for the computation of the forward and inverse geodesic problems for an ellipsoid of revolution are derived. These are accurate to better than 15 nm when applied to the terrestrial ellipsoids. The solutions of other problems…
While the contents of Euclid's Elements are well-known these days, some characters of the original text have been overlooked due to interpretation by modern mathematical languages. The lens of modern mathematics once anachronistically…
We provide a reply to a comment by I. Goychuk arXiv:1708.04155, version v2 from 27 Aug 2017 (not under active consideration with Phys. Rev. Lett.), on our Letter E. Aghion, D. A. Kessler and E. Barkai, Phys. Rev. Lett., 118, 260601 (2017).
This is the original paper appeared in the book "Elliptic and Parabolic Methods in Geometry (Minneapolis, MN,1994), A K Peters, Wellesley, MA, (1996)" (p.1-16), except with a few minor modifications as described at the end of the paper (on…
This is a position paper written as an introduction to the special volume on quantum algorithms I edited for the journal Mathematical Structures in Computer Science (Volume 20 - Special Issue 06 (Quantum Algorithms), 2010).
This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales…
We investigate the techniques and ideas used in the convergence analysis of two proximal ADMM algorithms for solving convex optimization problems involving compositions with linear operators. Besides this, we formulate a variant of the ADMM…
We study the surface area of an ellipsoid in n-dimensional Euclidean space as the function of the lengths of their major semi-axes. We write down an explicit formula as an integral over the unit sphere, use the formula to derive convexity…
We propose a new $(1+O(\varepsilon))$-approximation algorithm with $O(n+ 1/\varepsilon^{\frac{(d-1)}{2}})$ running time for computing the diameter of a set of $n$ points in the $d$-dimensional Euclidean space for a fixed dimension $d$,…
In this work we present a new simple but efficient scheme - Subsquares approach - for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this…
We consider 3-periodic orbits in an elliptic billiard. Numerical experiments conducted by Dan Reznik have shown that the locus of the centers of inscribed circles of the corresponding triangles is an ellipse. We prove this fact by the…
Consider the representation of a rational number in the form, associated with "centered" Euclidean algorithm. We prove a new formula for the limit distribution function for sequences of rationals with bounded sum of partial quotients.
In this paper, we overlay a continuum of analytical relations which essentially serve to compute the arc-length described by a celestial body in an elliptic orbit within a stipulated time interval. The formalism is based upon a…
In a previous paper a new approach has been introduced for computing, recursively and numerically, one-loop tensor integrals. Here we describe a few modifications of the original method that allow a more efficient numerical implementation…
This is a survey article concerning applications of Hilbert's metric in the analysis and dynamics of linear and nonlinear mappings on cones. It will appear as a chapter in the "Handbook of Hilbert geometry", ed. G. Besson, A. Papadopoulos…
We present algorithms used in the computational part of the article "Special homogeneous linear systems on Hirzebruch surfaces".
A response to a letter to the editor by Schilling regarding Bartroff, Lorden, and Wang ("Optimal and fast confidence intervals for hypergeometric successes" 2022, arXiv:2109.05624)
In a recent work I developed a formula for efficiently calculating the number of abelian squares of length $t+t$ over an alphabet of size $d$, where $d$ may be very large. Here I show how the expressiveness of a certain class of…
We propose a new algorithm for approximating the metric projection onto a superelliptic disk of order $p>1$, i.e., the convex hull of a superellipse (Lam\'e curve), and prove its convergence.