Related papers: Numerical Calculation of a Minimal Surface Using B…

A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient method which can avoid singularities and breakdowns in the…

In the framework of mapped pseudospectral methods, we introduce a new polynomial-type mapping function in order to describe accurately the dynamics of systems developing almost singular structures. Using error criteria related to the…

Weierstrass representation is a classical parameterization of minimal surfaces. However, two functions should be specified to construct the parametric form in Weierestrass representation. In this paper, we propose an explicit parametric…

How good is a triangulation as an approximation of a smooth curved surface or manifold? We provide bounds on the {\em interpolation error}, the error in the position of the surface, and the {\em normal error}, the error in the normal…

We suggest a new definition for discrete minimal surfaces in terms of sphere packings with orthogonally intersecting circles. These discrete minimal surfaces can be constructed from Schramm's circle patterns. We present a variational…

We study algorithms to estimate geometric properties of raw point cloud data through implicit surface representations. Given that any level-set function with a constant level set corresponding to the surface can be used for such…

This is an expanded version of the two papers "Interpolation of Varieties of Minimal Degree" and "Interpolation Problems: Del Pezzo Surfaces." It is well known that one can find a rational normal curve in $\mathbb P^n$ through $n+3$ general…

For any nonorientable closed surface, we determine the minimal dilatation among pseudo-Anosov mapping classes arising from Penner's construction. We deduce that the sequence of minimal Penner dilatations has exactly two accumulation points,…

We give an explicitly computable lower bound for the arithmetic self-intersection number of the dualizing sheaf on a large class of arithmetic surfaces. If some technical conditions are satisfied, then this lower bound is positive. In…

Towards identifying the number of minimal surfaces sharing the same boundary from the geometry of the boundary, we propose a numerical scheme with high speed and high accuracy. Our numerical scheme is based on the method of fundamental…

We investigate the minimal surface problem in the three dimensional Heisenberg group, H, equipped with its standard Carnot-Caratheodory metric. Using a particular surface measure, we characterize minimal surfaces in terms of a sub-elliptic…

The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on general sets, but devote special attention to product sets…

For a finite planar graph, it associates with some metric spaces, called (regular) spherical polyhedral surfaces, by replacing faces with regular spherical polygons in the unit sphere and gluing them edge-to-edge. We consider the class of…

We study a divisor computing the minimal log discrepancy on a smooth surface. Such a divisor is obtained by a weighted blow-up. There exists an example of a pair such that any divisor computing the minimal log discrepancy computes no log…

We survey structure-preserving discretizations of minimal surfaces in Euclidean space. Our focus is on a discretization defined via parallel face offsets of polyhedral surfaces, which naturally leads to a notion of vanishing mean curvature…

This paper addresses the challenge of function approximation using Hermite interpolation on equally spaced nodes. In this setting, standard polynomial interpolation suffers from the Runge phenomenon. To mitigate this issue, we propose an…

We consider compact connected minimal surfaces, with a pair of boundary curves (not necessarily convex) in distinct planes, that have least-area amongst all orientable surfaces with the same boundary. When the planes containing these two…

Approximation theorem is one of the most important aspects of numerical analysis that has evolved over the years with many different approaches. Some of the most popular approximation methods include the Lebesgue approximation theorem, the…

Sparse interpolation} refers to the exact recovery of a function as a short linear combination of basis functions from a limited number of evaluations. For multivariate functions, the case of the monomial basis is well studied, as is now…

In this paper, we study how to quickly compute the <-minimal monomial interpolating basis for a multivariate polynomial interpolation problem. We address the notion of "reverse" reduced basis of linearly independent polynomials and design…