Related papers: Evaluating a distance function
The paper presents a method to compute the Jacobi's elliptic function \texttt{sn} on the period parallelogram. For fixed $m$ it requires first to compute the complete elliptic integrals $K=K(m)$ and $K'=K(1-m).$ The Newton method is used to…
We apply the techniques of computable model theory to the distance function of a graph. This task leads us to adapt the definitions of several truth-table reducibilities so that they apply to functions as well as to sets, and we prove…
We consider approximation or recovery of functions based on a finite number of function evaluations. This is a well-studied problem in optimal recovery, machine learning, and numerical analysis in general, but many fundamental insights were…
Recently, significant connections between compressed sensing problems and optimization of a particular class of functions relating to solutions of Hamilton-Jacobi equation was discovered. In this paper we introduce a fast approximate…
Consider an $s$-dimensional function being evaluated at $n$ points of a low discrepancy sequence (LDS), where the objective is to approximate the one-dimensional functions that result from integrating out $(s-1)$ variables. Here, the…
We present a fast convolution-based technique for computing an approximate, signed Euclidean distance function $S$ on a set of 2D and 3D grid locations. Instead of solving the non-linear, static Hamilton-Jacobi equation ($\|\nabla S\|=1$),…
We establish $L^p$ error estimates for monotone numerical schemes approximating Hamilton-Jacobi equations on the $d$-dimensional torus. Using the adjoint method, we first prove a $L^1$ error bound of order one for finite-difference and…
In the present article, we study the numerical approximation of a system of Hamilton-Jacobi and transport equations arising in geometrical optics. We consider a semi-Lagrangian scheme. We prove the well posedness of the discrete problem and…
We propose an alternative to $k$-nearest neighbors for functional data whereby the approximating neighboring curves are piecewise functions built from a functional sample. Using a locally defined distance function that satisfies…
We generalize Newton-type methods for minimizing smooth functions to handle a sum of two convex functions: a smooth function and a nonsmooth function with a simple proximal mapping. We show that the resulting proximal Newton-type methods…
Computing the Fr\'{e}chet distance for surfaces is a surprisingly hard problem and the only known algorithm is limited to computing it between flat surfaces. We adapt this algorithm to create one for computing the Fr\'{e}chet distance for a…
We describe algorithms to compute elliptic functions and their relatives (Jacobi theta functions, modular forms, elliptic integrals, and the arithmetic-geometric mean) numerically to arbitrary precision with rigorous error bounds for…
In this paper, we investigate the numerical approximation of Hamilton-Jacobi equations with the Caputo time-fractional derivative. We introduce an explicit in time discretization of the Caputo derivative and a finite difference scheme for…
Several important algorithms for machine learning and data analysis use pairwise distances as input. On Riemannian manifolds these distances may be prohibitively costly to compute, in particular for large datasets. To tackle this problem,…
Two approaches for the efficient rational approximation of the Fermi-Dirac function are discussed: one uses the contour integral representation and conformal mapping and the other is based on a version of the multipole representation of the…
We consider the problem of approximating a function using Herglotz wave functions, which are a superposition of plane waves. When the discrepancy is measured in a ball, we show that the problem can essentially be solved by considering the…
Jacobi elliptic functions are flexible functions that appear in a variety of problems in physics and engineering. We introduce and describe important features of these functions and present a physical example from classical mechanics where…
We study fast approximation of integrals with respect to stationary probability measures associated to iterated functions systems on the unit interval. We provide an algorithm for approximating the integrals under certain conditions on the…
We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…
This is the first part of our research on certain sharp Hardy-Sobolev inequalities and the related elliptic equations. In this part we shall establish some sharp weighted Hardy-Sobolev inequalities whose weights are distance functions to…