Related papers: The inverse moment problem for convex polytopes
The values of the determinant of Vandermonde matrices with real elements are analyzed both visually and analytically over the unit sphere in various dimensions. For three dimensions some generalized Vandermonde matrices are analyzed…
For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…
The area of inverse problems in mathematics is highly interdisciplinary. In various fields of science, engineering, medicine, and industry, there arises a need to reconstruct information about unknown entities that cannot be directly…
For the first time, we develop in this paper the globally convergent convexification numerical method for a Coefficient Inverse Problem for the 3D Helmholtz equation for the case when the backscattering data are generated by a point source…
The Calder\'on problem consists in recovering an unknown coefficient of a partial differential equation from boundary measurements of its solution. These measurements give rise to a highly nonlinear forward operator. As a consequence, the…
In this article we investigate a finite element formulation of strongly monotone quasi-linear elliptic PDEs in the context of fixed-point iterations. As opposed to Newton's method, which requires information from the previous iteration in…
The Moore-Penrose algorithm provides a generalized notion of an inverse, applicable to degenerate matrices. In this paper, we introduce a covariant extension of the Moore-Penrose method that permits to deal with general relativity involving…
With any convex function F on a finite-dimensional linear space X such that F goes to infinity at infinity, we associate a Borel measure on the dual space X*. This measure is obtained by pushing forward the measure exp(-F(x))dx under the…
We give a solution to the inverse moment problem for a certain class of Hessenberg and symmetric matrices related to integrable lattices of Toda type.
Facets of the convex hull of $n$ independent random vectors chosen uniformly at random from the unit sphere in $\mathbb{R}^d$ are studied. A particular focus is given on the height of the facets as well as the expected number of facets as…
We consider the problem of recovering an orthogonally decomposable tensor with a subset of elements distorted by noise with arbitrarily large magnitude. We focus on the particular case where each mode in the decomposition is corrupted by…
This paper presents a fast and robust numerical method for reconstructing point-like sources in the time-harmonic Maxwell's equations given Cauchy data at a fixed frequency. This is an electromagnetic inverse source problem with broad…
We study the natural extended-variable formulation for the disjunction of $n+1$ polytopes in $\mathbb{R}^d$. We demonstrate that the convex hull $D$ in the natural extended-variable space $\mathbb{R}^{d+n}$ is given by full optimal big-M…
We obtain representations of $X_1$ exceptional orthogonal polynomials through determinants of matrices that have certain adjusted moments as entries. We start out directly from the Darboux transformation, allowing for a universal…
We introduce revlex-initial 0/1-polytopes as the convex hulls of reverse-lexicographically initial subsets of 0/1-vectors. These polytopes are special knapsack-polytopes. It turns out that they have remarkable extremal properties. In…
The first part of this paper is devoted to an analysis of moment problems in R^n with supports contained in a closed set defined by finitely many polynomial inequalities. The second part of the paper uses the representation results of…
We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…
Low-rank matrix recovery problems are inverse problems which naturally arise in various fields like signal processing, imaging and machine learning. They are non-convex and NP-hard in full generality. It is therefore a delicate problem to…
We present a new method for constructing three-dimensional mass maps from gravitational lensing shear data. We solve the lensing inversion problem using truncation of singular values (within the context of generalized least squares…
This paper introduces a multi-frequency factorization method for imaging a time-dependent source, specifically to recover its spatial support and the associated excitation instants. Using far-field data from two opposite directions, we…