相关论文: Construction of signed distance functions with an …
In this paper, which corresponds to an updated version of the author's Habilitation lecture in Mathematics, we do an overview of several topics in elliptic problems. We review some old and new results regarding the Lane-Emden equation, both…
When matching parts of a surface to its whole, a fundamental question arises: Which points should be included in the matching process? The issue is intensified when using isometry to measure similarity, as it requires the validation of…
We develop efficient and high-order accurate finite difference methods for elliptic partial differential equations in complex geometry in the Difference Potentials framework. The main novelty of the developed schemes is the use of local…
A new characterization of convexity of a planar domain is obtained. Its derivation involves two classical facts: the Varadhan's formula, expressing the distance function with respect to the domain's boundary via real-valued solutions of the…
We give a simplified presentation of the obstacle problem approach to stochastic homogenization for elliptic equations in nondivergence form. Our argument also applies to equations which depend on the gradient of the unknown function. In…
The problem of finding suitable point embedding or geometric configurations given only Euclidean distance information of point pairs arises both as a core task and as a sub-problem in a variety of machine learning applications. In this…
We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…
When inclusions in a composite are separated by a very small gap, high contrast between the inclusion and matrix properties can induce strong amplification of the underlying field inside the narrow region. Quantifying this field…
We propose and analyze an unfitted finite element method for solving elliptic problems on domains with curved boundaries and interfaces. The approximation space on the whole domain is obtained by the direct extension of the finite element…
Solving the inverse kinematics problem is a fundamental challenge in motion planning, control, and calibration for articulated robots. Kinematic models for these robots are typically parametrized by joint angles, generating a complicated…
The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of applications, including sensor network…
Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consists of an incomplete set of distances, and the output is a set of points in…
Riemannian optimization uses local methods to solve optimization problems whose constraint set is a smooth manifold. A linear step along some descent direction usually leaves the constraints, and hence retraction maps are used to…
The distance geometry problem asks to find a realization of a given simple edge-weighted graph in a Euclidean space of given dimension K, where the edges are realized as straight segments of lengths equal (or as close as possible) to the…
In practical purposes for some geometrical problems in computer science we have as information the coordinates of some finite points in surface instead of the whole body of a surface. The problem arised here is: "How to define a distance…
We consider the problem of approximating nonconvex quadratic optimization with ellipsoid constraints (ECQP). We show some SDP-based approximation bounds for special cases of (ECQP) can be improved by trivially applying the extened Pataki's…
For the system of semilinear elliptic equations \[ \Delta V_i = V_i \sum_{j \neq i} V_j^2, \qquad V_i > 0 \qquad \text{in $\mathbb{R}^N$} \] we devise a new method to construct entire solutions. The method extends the existence results…
Motivated by information geometry, a distance function on the space of stochastic matrices is advocated. Starting with sequences of Markov chains the Bhattacharyya angle is advocated as the natural tool for comparing both short and long…
Elliptic partial differential equations are important both from application and analysis points of views. In this paper we apply the Closest Point Method to solving elliptic equations on general curved surfaces. Based on the closest point…
We consider an elliptic partial differential equation in non-divergence form with a random diffusion matrix and random forcing term. To address this, we propose a mixed-type continuous finite element discretization in the physical domain,…