Related papers: Old and new algorithms for pi
I present a few new and recent ideas of the multiloop calculations.
This article proves a Pythagoras-type formula for the sides and diagonals of a polygon inscribed in a semicircle having one of the sides of the polygon as diameter.
In this paper, we propose a Bregman frame for several classical alternating minimization algorithms. In the frame, these algorithms have uniform mathematical formulation. We also present convergence analysis for the frame algorithm. Under…
This is a revised version of the preprint which has been available electronically for a while. The paper will now appear in J. Ramanujan Math. Soc.
We demonstrate a new approach to the computation of ratios of elliptic integrals. It turns out that almost closed polygons interscribed between two conics retain some of the properties of such closed polygons. We apply these retained…
The paper contains a survey of the results obtained during the last ten years in the theory of elliptic boundary problems in H\"ormander function spaces, developed by the authors, and other related results of modern analysis. The basics of…
This article is a survey on the topic of polynomial amoebas. We review results of papers written on the topic with an emphasis on its computational aspects. Polynomial amoebas have numerous applications in various domains of mathematics and…
The ellipsoid algorithm is a fundamental algorithm for computing a solution to the system of $m$ linear inequalities in $n$ variables $(P): A^{\top}x \le u$ when its set of solutions has positive volume. However, when $(P)$ is infeasible,…
Restricting ourselves to elliptic curves over $\mathbb{Q}$, we reformulate the $p$-adic Beilinson conjecture due to Perrin-Riou, which is customized to our computational approach. We then develop a new algorithm for numerical verifications…
An algorithm for computing /pi(N) is presented.It is shown that using a symmetry of natural numbers we can easily compute /pi(N).This method relies on the fact that counting the number of odd composites not exceeding N suffices to calculate…
We give a faster algorithm for computing an approximate John ellipsoid around $n$ points in $d$ dimensions. The best known prior algorithms are based on repeatedly computing the leverage scores of the points and reweighting them by these…
We suggest a continued fraction origin to Ramanujan's approximation to {(a-b)/(a+b)}^2 in terms of the arc length of an ellipse with semiaxes a and b. Moreover, we discuss the asymptotic accuracy of the approximation.
We comment on a recent paper by D'Abramo [Chaos, Solitons & Fractals, 25 (2005) 29], focusing on the author's statement that an algorithm can produce a list of strings containing at least one string whose algorithmic complexity is greater…
We present a general algorithm for finding the overlap area between two ellipses. The algorithm is based on finding a segment area (the area between an ellipse and a secant line) given two points on the ellipse. The Gauss-Green formula is…
We prove that if the outer billiard map around a plane oval is algebraically integrable in a certain non-degenerate sense then the oval is an ellipse.
The comments of Guseinov on our recent paper (Czech. J. Phys., 52 (2002)1297) have been analyzed critically. It is shown that his comments are irrelevant and also unjust. In contrast to his comment, it is proved that the presented formulae…
Throughout more than two millennia many formulas have been obtained, some of them beautiful, to calculate the number pi. Among them, we can find series, infinite products, expansions as continued fractions and expansions using radicals.…
We give a new simple and short ("one-line") analysis for the runtime of the well-known Euclidean Algorithm. While very short simple, the obtained upper bound in near-optimal.
By employing certain extended classical summation theorems, several surprising \pi and other formulae are displayed.
We present a natural proof of Kepler's law of ellipses in the spirit of Euclidean geometry. Moreover we discuss two existing Euclidean geometric proofs, one by Feynman in hist Lost Lecture from 1964 and the other by Newton in the Principia…