Related papers: Almost closed interscribed polygons
An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…
Moir\'e patterns of twisted and scaled bilayers have recently emerged as a fertile source of quasiperiodic order in two-dimensional materials. Inspired by these systems, we introduce the \emph{near-coincidence method} for generating…
We develop a new algorithm for fitting circles that does not have drawbacks commonly found in existing circle fits. Our fit achieves ultimate accuracy (to machine precision), avoids divergence, and is numerically stable even when fitting…
Hybrid inverse problems are based on the interplay of two types of waves, in order to allow for imaging with both high resolution and high contrast. The inversion procedure often consists of two steps: first, internal measurements involving…
When the Euclidean algorithm produces a symmetric sequence of quotients, we give explicit formulas for the remainders that allow the analysis of two families of quadratic forms in the remainders.
We establish a congruence formula between $p$-adic logarithms of Heegner points for two elliptic curves with the same mod $p$ Galois representation. As a first application, we use the congruence formula when $p=2$ to explicitly construct…
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 article shows how two choices are possible whenever computing the geometric mean, and the repetition of this process can in general yield 2-to-the power N different values when the choices are compounded in the first N steps of…
We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
A semi-Lagrangian method for advection equation with hybrid cubic-rational interpolation is introduced. In the present method, the spatial profile of physical quantities is interpolated with a combination of a cubic and a rational function.…
We count the number of conics through two general points in complete intersections when this number is finite and give an application in terms of quasi-lines.
The ideas behind the concept of algebraic ("integration-by-parts") algorithms for multiloop calculations are reviewed. For any topology and mass pattern, a finite iterative algebraic procedure is proved to exist which transforms the…
A $\textit{polygonal curve}$ is a collection of $m$ connected line segments specified as the linear interpolation of a list of points $\{p_0, p_1, \ldots, p_m\}$. These curves may be obtained by sampling points from an oriented curve in…
Let a polygon be composed of equal rectangles. We find all quadratic irrationals r for which the polygon can be tiled by similar rectangles with given side ratio r.
In this talk we discuss Feynman integrals which are related to elliptic curves. We show with the help of an explicit example that in the set of master integrals more than one elliptic curve may occur. The technique of maximal cuts is a…
We propose a technique called Rotate-and-Kill for solving the polygon inclusion and circumscribing problems. By applying this technique, we obtain $O(n)$ time algorithms for computing (1) the maximum area triangle in a given $n$-sided…
Line intersection with convex and un-convex polygons or polyhedron algorithms are well known as line clipping algorithms and very often used in computer graphics. Rendering of geometrical problems often leads to ray tracing techniques, when…
The convex feasibility problem asks to find a point in the intersection of a collection of nonempty closed convex sets. This problem is of basic importance in mathematics and the physical sciences, and projection (or splitting) methods…
A fully numerical method to calculate loop integrals, a numerical contour-integration method, is proposed. Loop integrals can be interpreted as a contour integral in a complex plane for an integrand with multi-poles in the plane. Stable and…