Related papers: Evaluating a distance function
This paper studies the approximation of generalized ridge functions, namely of functions which are constant along some submanifolds of $\mathbb{R}^N$. We introduce the notion of linear-sleeve functions, whose function values only depend on…
We consider elliptic variational inequalities generated by obstacle type problems with thin obstacles. For this class of problems, we deduce estimates of the distance (measured in terms of the natural energy norm) between the exact solution…
Elliptic functions are largely studied and standardized mathematical objects. The two usual approaches are due to Jacobi and Weierstrass. From a contour integral which allowed us to unify many summation formulae (Euler-MacLaurin, Poisson,…
The goal of this paper is to formulate a systematical method for constructing the fastest possible continued fraction approximations of a class of functions. The main tools are the multiple-correction method, the generalized Mortici's lemma…
The Fast Marching Method is a very popular algorithm to compute times-of-arrival maps (distances map measured in time units). Since their proposal in 1995, it has been applied to many different applications such as robotics, medical…
We study the distance function to the boundary, Finsler geometry and the singular set of viscosity solutions of some Hamilton-Jacobi equations.
We consider the distance function from an arbitrary point $p$ on a flat surface, and determine the set $F_{p}$ of all \emph{farthest points} (i.e., points at maximal distance) from $p$.
Fast computational method for Hertzian contact theory is proposed. An incremental formula is introduced to calculate the ellipticity of the contact disk when two elastic bodies are in contact. This method can determine the ellipticity with…
We establish that a generalized H\"{o}lder continuous function on an $(m-2)$-Ahlfors regular compact set in $\mathbb{R}^m$ can be approximated by solutions of an elliptic equation, with the rate of approximation determined by the continuity…
We present a fast sweeping method for a class of Hamilton-Jacobi equations that arise from time-independent problems in optimal control theory. The basic method in two dimensions uses a four point stencil and is extremely simple to…
This paper shows how to use the shooting method, a classical numerical algorithm for solving boundary value problems, to compute the Riemannian distance on the Stiefel manifold $\mathrm{St}(n,p)$, the set of $ n \times p $ matrices with…
We present effective numerical algorithms for locally recovering unknown governing differential equations from measurement data. We employ a set of standard basis functions, e.g., polynomials, to approximate the governing equation with high…
Having a function $f$ and a set of functionals $\{\mathcal{C}_{n}\}$, $c_n^f \equiv \mathcal{C}_n \left(f\right)$, one can interpret function approximation very generally as a construction of some function $\mathcal{A}_{N}^{f}$ such that…
We use the $p$-Laplacian with large $p$-values in order to approximate geodesic distances to features on surfaces. This differs from Fayolle and Belyaev's (2018) [1] computational results using the $p$-Laplacian for the distance-to-surface…
The derivative expansion approach to the calculation of the interaction between two surfaces, is a generalization of the proximity force approximation, a technique of widespread use in different areas of physics. The derivative expansion…
Geometry and topology have generated impacts far beyond their pure mathematical primitive, providing a solid foundation for many applicable tools. Typically, real-world data are represented as vectors, forming a linear subspace for a given…
Fast sweeping methods have become a useful tool for computing the solutions of static Hamilton-Jacobi equations. By adapting the main idea behind these methods, we describe a new approach for computing steady state solutions to systems of…
The formulas that relate Jacobi's Epsilon and Zeta function with real moduli in the interval (1,inf) or with pure imaginary moduli to elliptic functions with moduli in the interval [0,1] are derived.
A functional differential equation related to the logistic equation is studied by a combination of numerical and perturbation methods. Parameter regions are identified where the solution to the nonlinear problem is approximated well by…
This paper is a companion paper to [Lipman and Daubechies 2011]. We provide numerical procedures and algorithms for computing the alignment of and distance between two disk type surfaces. We provide a convergence analysis of the discrete…