SearcharxivSearch

arXiv subjects

Yosef Yomdin

Publications and source records attributed to Yosef Yomdin.

At least 19 recordsLinked to original sources

Geometry-Driven Conditioning of Multivariate Vandermonde Matrices in High-Degree Regimes

We study multivariate monomial Vandermonde matrices $V_N(Z)$ with arbitrary distinct nodes $Z=\{z_1,\dots,z_s\}\subset B_2^n$ in the high-degree regime $N\ge s-1$. Introducing a projection-based geometric statistic -- the \emph{max-min projection separation} $\rho(Z,j)$ and its minimum $\kappa(Z)=\min_j\rho(Z,j)$ -- we construct Lagrange polynomials $Q_j\in\mathcal P_N^n$ with explicit coefficient bounds $$ \|Q_j\|_\infty \lesssim s\Bigl(\frac{4n}{\rho(Z,j)}\Bigr)^{s-1}. $$ These polynomials yield quantitative distance-to-span estimates for the rows of $V_N(Z)$ and, as consequences, $$ \sigma_{\min}(V_N(Z)) \gtrsim \frac{\kappa(Z)^{s-1}}{(4n)^{s-1} s\sqrt{s \nu(n,N)}}, \quad \nu(n,N)={N+n\choose N}, $$ and an explicit right inverse $V_N(Z)^+$ with operator-norm control $$ \|V_N(Z)^+\| \lesssim s^{3/2}\sqrt{\nu(n,N)}\Bigl(\frac{4n}{\kappa(Z)}\Bigr)^{s-1}. $$ Our estimates are dimension-explicit and expressed directly in terms of the local geometry parameter $\kappa(Z)$; they apply to \emph{every} distinct node set $Z\subset B_2^n$ without any \emph{a priori} separation assumptions. In particular, $V_N(Z)$ has full row rank whenever $N\ge s-1$. The results complement the Fourier-type theory (on the complex unit circle/torus), where lower bounds for $\sigma_{\min}$ hinge on uniform separation or cluster structure; here stability is quantified instead via high polynomial degree and the projection geometry of $Z$.

math.CA

Algebraic Reconstruction of Piecewise-Smooth Functions of Two Variables from Fourier Data

We investigate the problem of reconstructing a 2D piecewise smooth function from its bandlimited Fourier measurements. This is a well known and well studied problem with many real world implications, in particular in medical imaging. While many techniques have been proposed over the years to solve the problem, very few consider the accurate reconstruction of the discontinuities themselves. In this work we develop an algebraic reconstruction technique for two-dimensional functions consisting of two continuity pieces with a smooth discontinuity curve. By extending our earlier one-dimensional method, we show that both the discontinuity curve and the function itself can be reconstructed with high accuracy from a finite number of Fourier measurements. The accuracy is commensurate with the smoothness of the pieces and the discontinuity curve. We also provide a numerical implementation of the method and demonstrate its performance on synthetic data.

math.NA

Lower bounds for high derivatives of smooth functions with given zeros

Let $f: B^n \rightarrow {\mathbb R}$ be a $d+1$ times continuously differentiable function on the unit ball $B^n$, with $\max_{z\in B^n} |f(z)|=1$. A well-known fact is that if $f$ vanishes on a set $Z\subset B^n$ with a non-empty interior, then for each $k=1,\ldots,d+1$ the norm of the $k$-th derivative $\|f^{(k)}\|$ is at least $M=M(n,k)>0$. A natural question to ask is: What happens for other sets $Z$? In particular, for finite, but sufficiently dense sets?} This question was partially answered in ([16],[20-22]). This study can be naturally related to a certain special settings of the classical Whitney's smooth extension problem. Our goal in the present paper is threefold: first, to provide an overview of the relevant questions and existing results in the general Whitney's problem. Second, we provide an overview of our specific setting and some available results. Third, we provide some new results in our direction. These new results extend the recent result of [21], where an answer to the above question is given via the topological information on $Z$.

math.CA

Higher derivatives of functions with zeros on algebraic curves

Let $f: B^n \rightarrow {\mathbb R}$ be a $d+1$ times continuously differentiable function on the unit ball $B^n$, with $\max_{z\in B^n} \| f(z) \|=1$. A well-known fact is that if $f$ vanishes on a set $Z\subset B^n$ with a non-empty interior, then for each $k=1,\ldots,d+1$ the norm of the $k$-th derivative $\|f^{(k)}\|$ is at least $M=M(n,k)>0$. We show that this fact remains valid for all ``sufficiently dense'' sets $Z$ (including finite ones). The density of $Z$ is measured via the behavior of the covering numbers of $Z$. In particular, the bound $\|f^{(k)}\|\ge \tilde M=\tilde M(n,k)>0$ holds for each $Z$ with the box (or Minkowski, or entropy) dimension $\dim_e(Z)$ greater than $n-\frac{1}{k}$.

math.CA

higher derivatives of functions with given critical points and values

Let $f: B^n \rightarrow {\mathbb R}$ be a $d+1$ times continuously differentiable function on the unit ball $B^n$, with $\max_{z\in B^n} \|f(z)\|=1$. A well-known fact is that if $f$ vanishes on a set $Z\subset B^n$ with a non-empty interior, then for each $k=1,\ldots,d+1$ the norm of the $k$-th derivative $\|f^{(k)}\|$ is at least $M=M(n,k)>0$. A natural question to ask is ``what happens for other sets $Z$?''. This question was partially answered in [16]-[18]. In the present paper we ask for a similar (and closely related) question: what happens with the high-order derivatives of $f$, if its gradient vanishes on a given set $Σ$? And what conclusions for the high-order derivatives of $f$ can be obtained from the analysis of the metric geometry of the ``critical values set'' $f(Σ)$? In the present paper we provide some initial answers to these questions.

math.CA

Smooth rigidity and Remez inequalities via Topology of level sets

A smooth rigidity inequalitiy provides an explicit lower bound for the $(d+1)$-st derivatives of a smooth function $f$, which holds, if $f$ exhibits certain patterns, forbidden for polynomials of degree $d$. The main goal of the present paper is twofold: first, we provide an overview of some recent results and questions related to smooth rigidity, which recently were obtained in Singularity Theory, in Approximation Theory, and in Whitney smooth extensions. Second, we prove some new results, specifically, a new Remez-type inequality, and on this base we obtain a new rigidity inequality. In both parts of the paper we stress the topology of the level sets, as the input information. Here are the main new results of the paper: \smallskip Let $B^n$ be the unit $n$-dimensional ball. For a given integer $d$ let $Z\subset B^n$ be a smooth compact hypersurface with $N=(d-1)^n+1$ connected components $Z_j$. Let $μ_j$ be the $n$-volume of the interior of $Z_j$, and put $μ=\min μ_j, \ j=1,\ldots, N$. Then for each polynomial $P$ of degree $d$ on ${\mathbb R}^n$ we have $$ \frac{\max_{B^n}|P|}{\max_{Z}|P|}\le (\frac{4n}μ)^d. $$ As a consequence, we provide an explicit lower bound for the $(d+1)$-st derivatives of any smooth function $f$, which vanishes on $Z$, while being of order $1$ on $B^n$ (smooth rigidity)}: $$ ||f^{(d+1)}||\ge \frac{1}{(d+1)!}(\frac{4n}μ)^d. $$ We also provide an interpretation, in terms of smooth rigidity, of one of the simplest versions of the results in \cite{Ler.Ste}.

math.CA

Smooth rigidity and Remez-type inequalities

If a smooth function of one variable has maximum one on the unit interval, and has there $d$ zeroes, then its $(d+1)$-st derivative must be "big". This is one of the simplest examples of what we call "smooth rigidity": certain geometric properties of zero sets of smooth functions $f$ imply explicit lower bounds on the high-order derivatives of $f$. In dimensions greater than one, the powerful one-dimension tools, like Lagrange's remainder formula, and divided finite differences, are not directly applicable. Still, the result above implies, via line sections, rather strong restrictions on zeroes of smooth functions of several variables \cite{Yom1}). In the present paper we study the geometry of zero sets of smooth functions, and significantly extend the results of \cite{Yom1}, including into consideration, in particular, finite zero sets (for which the line sections usually do not work). Our main goal is to develop a truly multi-dimensional approach to smooth rigidity, based on polynomial Remez-type inequalities (which compare the maxima of a polynomial on the unit ball, and on its subset). Very informally, one of our main results is that a "smooth rigidity" of a zeroes set $Z$ is approximately the "inverse Remez constant" of $Z$.

math.CA

The spectral properties of Vandermonde matrices with clustered nodes

We study rectangular Vandermonde matrices $\mathbf{V}$ with $N+1$ rows and $s$ irregularly spaced nodes on the unit circle, in cases where some of the nodes are "clustered" together -- the elements inside each cluster being separated by at most $h \lesssim {1\over N}$, and the clusters being separated from each other by at least $θ\gtrsim {1\over N}$. We show that any pair of column subspaces corresponding to two different clusters are nearly orthogonal: the minimal principal angle between them is at most $$\fracπ{2}-\frac{c_1}{N θ}-c_2 N h,$$ for some constants $c_1,c_2$ depending only on the multiplicities of theclusters. As a result, spectral analysis of $\mathbf{V}_N$ is significantly simplified by reducing the problem to the analysis of each cluster individually. Consequently we derive accurate estimates for 1) all the singular values of $\mathbf{V}$, and 2) componentwise condition numbers for the linear least squares problem. Importantly, these estimates are exponential only in the local cluster multiplicities, while changing at most linearly with $s$.

math.NA

Super-resolution of near-colliding point sources

We consider the problem of stable recovery of sparse signals of the form $$F(x)=\sum_{j=1}^d a_jδ(x-x_j),\quad x_j\in\mathbb{R},\;a_j\in\mathbb{C}, $$ from their spectral measurements, known in a bandwidth $Ω$ with absolute error not exceeding $ε>0$. We consider the case when at most $p\le d$ nodes $\{x_j\}$ of $F$ form a cluster whose extent is smaller than the Rayleigh limit ${1\overΩ}$, while the rest of the nodes are well separated. Provided that $ε\lessapprox SRF^{-2p+1}$, where $SRF=(ΩΔ)^{-1}$ and $Δ$ is the minimal separation between the nodes, we show that the minimax error rate for reconstruction of the cluster nodes is of order ${1\overΩ}SRF^{2p-1}ε$, while for recovering the corresponding amplitudes $\{a_j\}$ the rate is of the order $SRF^{2p-1}ε$. Moreover, the corresponding minimax rates for the recovery of the non-clustered nodes and amplitudes are ${ε\overΩ}$ and $ε$, respectively. These results suggest that stable super-resolution is possible in much more general situations than previously thought. Our numerical experiments show that the well-known Matrix Pencil method achieves the above accuracy bounds.

math.NA

Geometry of error amplification in solving Prony system with near-colliding nodes

We consider a reconstruction problem for ``spike-train'' signals $F$ of an a priori known form $F(x)=\sum_{j=1}^{d}a_{j}δ\left(x-x_{j}\right),$ from their moments $m_k(F)=\int x^kF(x)dx.$ We assume that the moments $m_k(F)$, $k=0,1,\ldots,2d-1$, are known with an absolute error not exceeding $ε> 0$. This problem is essentially equivalent to solving the Prony system $\sum_{j=1}^d a_jx_j^k=m_k(F), \ k=0,1,\ldots,2d-1.$ We study the ``geometry of error amplification'' in reconstruction of $F$ from $m_k(F),$ in situations where the nodes $x_1,\ldots,x_d$ near-collide, i.e. form a cluster of size $h \ll 1$. We show that in this case, error amplification is governed by certain algebraic varieties in the parameter space of signals $F$, which we call the ``Prony varieties''. Based on this we produce lower and upper bounds, of the same order, on the worst case reconstruction error. In addition we derive separate lower and upper bounds on the reconstruction of the amplitudes and the nodes. Finally we discuss how to use the geometry of the Prony varieties to improve the reconstruction accuracy given additional a priori information.

math.CA

Exponential Taylor domination

Let $f(z) = \sum_{k=0}^\infty a_k z^k$ be an analytic function in a disk $D_R$ of radius $R>0$, and assume that $f$ is $p$-valent in $D_R$, i.e. it takes each value $c\in{\mathbb C}$ at most $p$ times in $D_R$. We consider its Borel transform $$ B(f)(z) = \sum_{k=0}^\infty \frac{a_k}{k!} z^k , $$ which is an entire function, and show that, for any $R>1$, the valency of the Borel transform $B(f)$ in $D_R$ is bounded in terms of $p,R$. We give examples, showing that our bounds, provide a reasonable envelope for the expected behavior of the valency of $B(f)$. These examples also suggest some natural questions, whose expected answer will strongly sharper our estimates. We present a short overview of some basic results on multi-valent functions, in connection with "Taylor domination", which, for $f(z) = \sum_{k=0}^\infty a_k z^k$, is a bound of all its Taylor coefficients $a_k$ through the first few of them. Taylor domination is our main technical tool, so we also discuss shortly some recent results in this direction.

math.CA

Conditioning of partial nonuniform Fourier matrices with clustered nodes

We prove sharp lower bounds for the smallest singular value of a partial Fourier matrix with arbitrary "off the grid" nodes (equivalently, a rectangular Vandermonde matrix with the nodes on the unit circle), in the case when some of the nodes are separated by less than the inverse bandwidth. The bound is polynomial in the reciprocal of the so-called "super-resolution factor", while the exponent is controlled by the maximal number of nodes which are clustered together. As a corollary, we obtain sharp minimax bounds for the problem of sparse super-resolution on a grid under the partial clustering assumptions.

math.NA

Doubling coverings via resolution of singularities and preparation

In this paper we provide asymptotic upper bounds on the complexity in two (closely related) situations. We confirm for the total doubling coverings and not only for the chains the expected bounds of the form $$ κ({\mathcal U}) \le K_1(\log ({1}/δ))^{K_2} . $$ This is done in a rather general setting, i.e. for the $δ$-complement of a polynomial zero-level hypersurface $Y_0$ and for the regular level hypersurfaces $Y_c$ themselves with no assumptions on the singularities of $P$. The coefficient $K_2$ is the ambient dimension $n$ in the first case and $n-1$ in the second case. However, the question of a uniform behavior of the coefficient $K_1$ remains open. As a second theme, we confirm in arbitrary dimension the upper bound for the number of a-charts covering a real semi-algebraic set $X$ of dimension $m$ away from the $δ$-neighborhood of a lower dimensional set $S$, with bound of the form $$ κ(δ) \le C (\log ({1}/δ))^{m} $$ holding uniformly in the complexity of $X$. We also show an analogue for level sets with parameter away from the $δ$-neighborhood of a low dimensional set. More generally, the bounds are obtained also for real subanalytic and real power-subanalytic sets.

math.CA

Geometry and Singularities of Prony varieties

We start a systematic study of the topology, geometry and singularities of the Prony varieties $S_q(\mu)$, defined by the first $q+1$ equations of the classical Prony system $$\sum_{j=1}^d a_j x_j^k = \mu_k, \ k= 0,1,\ldots \ .$$ Prony varieties, being a generalization of the Vandermonde varieties, introduced in [5,21], present a significant independent mathematical interest (compare [5,19,21]). The importance of Prony varieties in the study of the error amplification patterns in solving Prony system was shown in [1-4,19]. In [19] a survey of these results was given, from the point of view of Singularity Theory. In the present paper we show that for $q\ge d$ the variety $S_q(\mu)$ is diffeomerphic to an intersection of a certain affine subspace in the space ${\cal V}_d$ of polynomials of degree $d$, with the hyperbolic set $H_d$. On the Prony curves $S_{2d-2}$ we study the behavior of the amplitudes $a_j$ as the nodes $x_j$ collide, and the nodes escape to infinity. We discuss the behavior of the Prony varieties as the right hand side $\mu$ varies, and possible connections of this problem with J. Mather's result in [23] on smoothness of solutions in families of linear systems.

math.NA

On algebraic properties of low rank approximations of Prony systems

We consider the reconstruction of spike train signals of the form $$F(x) = \sum_{i=1}^d a_i δ(x-x_i),$$ from their moments measurements $m_k(F)=\int x^k F(x) dx = \sum_{i=1}^d a_ix^k$. When some of the nodes $x_i$ near collide the inversion becomes unstable. Given noisy moments measurements, a typical consequence is that reconstruction algorithms estimate the signal $F$ with a signal having fewer nodes, $\tilde{F}$. We derive lower bounds for the moments difference between a signal $F$ with $d$ nodes and a signal $\tilde{F}$ with strictly less nodes, $l$. Next we consider the geometry of the non generic case of $d$ nodes signals $F$, for which there exists an $l 2l-1 . \end{align*} We give a complete description for the case of a general $d$, $l=1$ and $p=2$. We give a reference for the case $p=2l-1$ which can be inferred from earlier work.

math.CA

Prony Scenarios and Error Amplification in a Noisy Spike-Train Reconstruction

The paper is devoted to the characterization of the geometry of Prony curves arising from spike-train signals. We give a sufficient condition which guarantees the blowing up of the amplitudes of a Prony curve S in case where some of its nodes tend to collide. We also give sufficient conditions on S which guarantee a certain asymptotic behavior of its nodes near infinity.

eess.SP

Accuracy of noisy Spike-Train Reconstruction: a Singularity Theory point of view

This is a survey paper discussing one specific (and classical) system of algebraic equations - the so called "Prony system". We provide a short overview of its unusually wide connections with many different fields of Mathematics, stressing the role of Singularity Theory. We reformulate Prony System as the problem of reconstruction of "Spike-train" signals of the form $F(x)=\sum_{j=1}^d a_j\delta(x-x_j)$ from the noisy moment measurements. We provide an overview of some recent results of [1-3, 6, 8, 9, 11, 12, 5] on the "geometry of the error amplification" in the reconstruction process, in situations where the nodes $x_j$ near-collide. Some algebraic-geometric structures, underlying the error amplification, are described (Prony, Vieta, and Hankel mappings, Prony varieties), as well as their connection with Vandermonde mappings and varieties. Our main goal is to present some promising fields of possible applications of Singulary Theory.

math.NA

Zeroes and rational points of analytic functions

For an analytic function $f(z)=\sum_{k=0}^\infty a_kz^k$ on a neighbourhood of a closed disc $D\subset {\bf C}$, we give assumptions, in terms of the Taylor coefficients $a_k$ of $f$, under which the number of intersection points of the graph $Γ_f$ of $f_{\vert D}$ and algebraic curves of degree $d$ is polynomially bounded in $d$. In particular, we show these assumptions are satisfied for random power series, for some explicit classes of lacunary series, and for solutions of linear differential equations with coefficients in ${\bf Q}[z]$. As a consequence, for any function $f$ in these families, $Γ_f$ has less than $β\log^αT$ rational points of height at most $T$, for some $α, β>0$.

math.AG