Related papers: Generation of Curvilinear Coordinates
For numerical approximation the reformulation of a PDE as a residual minimisation problem has the advantages that the resulting linear system is symmetric positive definite, and that the norm of the residual provides an a posteriori error…
We introduce a new approach to the anisotropic Calder\'on problem, based on a map called Poisson embedding that identifies the points of a Riemannian manifold with distributions on its boundary. We give a new uniqueness result for a large…
This paper develops the use of wavelets as a basis set for the solution of physical problems exhibiting behavior over wide-ranges in length scale. In a simple diagrammatic language, this article reviews both the mathematical underpinnings…
In this paper we propose new insights and ideas to set up quantitative boundary estimates for solutions to Dirichlet problem of a class of fully non-linear elliptic equations on compact Hermitian manifolds with real analytic Levi flat…
We consider a non-polynomial cubic spline to develop the classes of methods for the numerical solution of singularly perturbed two-point boundary value problems. The proposed methods are second and fourth order accurate and applicable to…
We develop the convergence theory for a well-known method for the interpolation of functions on the real axis with rational functions. Precise new error estimates for the interpolant are de- rived using existing theory for trigonometric…
Orthogonal polynomials on quadratic curves in the plane are studied. These include orthogonal polynomials on ellipses, parabolas, hyperbolas, and two lines. For an integral with respect to an appropriate weight function defined on any…
Contours may be viewed as the 2D outline of the image of an object. This type of data arises in medical imaging as well as in computer vision and can be modeled as data on a manifold and can be studied using statistical shape analysis.…
We solve the Dirichlet problem for fully nonlinear elliptic equations on Riemannian manifolds under essentially optimal structure conditions, especially with no restrictions to the curvature of the underlying manifold and the second…
This paper addresses the numerical computation of critical angles between two convex cones in finite-dimensional Euclidean spaces. We present a novel approach to computing these critical angles by reducing the problem to finding stationary…
We establish a relationship between the two important central lines of the triangle, the Euler line and the Brocard axis, in a configuration with an arbitrary rectangle and a random point. The classical Cartesian coordinate system method…
Using a conjecture that allows to approach separable-variables conductivity functions, the elements of the Modern Pseudoanalytic Function Theory are used, for the first time, to numerically solve the Dirichlet boundary value problem of the…
We extend the method of layer potentials to manifolds with boundary and cylindrical ends. To obtain this extension along the classical lines, we have to deal with several technical difficulties due to the non-compactness of the boundary,…
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…
The methods of finite-gap integration are used to construct orthogonal curvilinear coordinate systems in the Euclidean space corresponding to sheaves of rank one without torsion over reducible singular spectral curves.
Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm…
We establish elliptic regularity for nonlinear inhomogeneous Cauchy-Riemann equations under minimal assumptions, and give a counterexample in a borderline case. In some cases where the inhomogeneous term has a separable factorization, the…
We propose new algebraic methods for extracting cylinders and cones from minimal point sets, including oriented points. More precisely, we are interested in computing efficiently cylinders through a set of three points, one of them being…
In this paper, we use the properties of the self-polar triangle to not only show a novel method for a basic point-line enumerative problem of conics, but also present a series of closed-form solutions to the conics from all minimal…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…