Related papers: On Properties of a Regular Simplex Inscribed into …

We introduce the notion of strongly orthogonal set relative to an element in the sense of Birkhoff-James in a normed linear space to find a necessary and sufficient condition for an element $ x $ of the unit sphere $ S_{X}$ to be an exposed…

Given any solution $u$ of the Euler equations which is assumed to have some regularity in space - in terms of Besov norms, natural in this context - we show by interpolation methods that it enjoys a corresponding regularity in time and that…

The work is devoted to investigation of the canonical structure of regular, in domain of definition ${\cal U}\subseteq {\mathbb R}^{m}$, the pencil of matrix-functions $A(x)+\lambda B(x)$. It is supposed that $\det A(x)\equiv 0$ and $\det…

We provide a simple and efficient algorithm for computing the Euclidean projection of a point onto the capped simplex---a simplex with an additional uniform bound on each coordinate---together with an elementary proof. Both the MATLAB and…

Let $z_1, \dots, z_m$ be $m$ distinct complex numbers, normalized to $|z_k| = 1$, and consider the polynomial $$ p_{m}(z) = \prod_{k=1}^{m}{(z-z_k)}.$$ We define a sequence of polynomials in a greedy fashion, $$ p_{N+1}(z) = p_{N}(z)…

We explore separable property of the joint numerical range $G(\Bbb R^n)$ of a special class of quadratic functions and apply it to solving the smallest enclosing ball (SEB) problem which asks to find a ball $B(a,r)$ in $\Bbb R^n$ with…

The worst-case performance of an optimization method on a problem class can be analyzed using a finite description of the problem class, known as interpolation conditions. In this work, we study interpolation conditions for linear operators…

In the present paper, the following convexity principle is proved: any closed convex multifunction, which is metrically regular in a certain uniform sense near a given point, carries small balls centered at that point to convex sets, even…

The Hermite-Birkhoff interpolation problem of a function given on arbitrarily distributed points on the sphere and other manifolds is considered. Each proposed interpolant is expressed as a linear combination of basis functions, the…

In this paper, among other things, we show that, given $r\in N$, there is a constant $c=c(r)$ such that if $f\in C^r[-1,1]$ is convex, then there is a number ${\mathcal N}={\mathcal N}(f,r)$, depending on $f$ and $r$, such that for…

In this present paper, I propose a derivation of unified interpolation and extrapolation function that predicts new values inside and outside the given range by expanding direct Taylor series on the middle point of given data set.…

The notion of regularity has been used by S. Kleiman in the construction of bounded families of ideals or sheaves with given Hilbert polynomial, a crucial point in the construction of Hilbert or Picard scheme. In a related direction,…

Let $P(z)$ be a polynomial of degree $n\geq 1$. In this paper we define an operator $B$, as following, $$B[P(z)]:=\lambda_0 P(z)+\lambda_1 (\frac{nz}{2}) \frac{P'(z)}{1!}+\lambda_2 (\frac{nz}{2})^2 \frac{P''(z)}{2!},$$ where…

For a Riemannian polyhedra, we study the geometry of the unit ball for the unidimensional stable norm (stable ball). In the case of a unidimensional Riemannian polyhedra (graph), we show that the stable ball is a polytope whose vertices are…

We consider a multivariate piecewise linear interpolation of a continuous random field on a d-dimensional cube. The approximation performance is measured by the integrated mean square error. Multivariate piecewise linear interpolator is…

We prove a large deviations principle for orthogonal projections of the unit ball $\mathbb{B}_p^n$ of $\ell_p^n$ onto a random $k$-dimensional linear subspace of $\mathbb{R}^n$ as $n\to\infty$ in the case $2<p\le \infty$ and for the…

We describe a procedure to compute a projection of $w \in \mathbb{R}^n$ into the intersection of the so-called \emph{zero-norm} ball $k \mathbb{B}_0$ of radius $k$, i.e., the set of $k$-sparse vectors, with a box centered at a point of $k…

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…

We introduce the following linear combination interpolation problem (LCI): Given $N$ distinct numbers $w_1,\ldots w_N$ and $N+1$ complex numbers $a_1,\ldots, a_N$ and $c$, find all functions $f(z)$ analytic in a simply connected set…

We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…