相关论文: An estimate of approximation of a matrix-valued fu…
Let $\alpha_{n1},\dots,\alpha_{nn}$ be the zeros of the $n$th Bessel polynomial $y_n(z)$ and let $a_{nk}=1-\alpha_{nk}/2$, $b_{nk}=1+\alpha_{nk}/2$ $(k=1,\dots,n)$. We propose the new formula \[z f'(z)\approx \sum_{k=1}^n \big(f(a_{nk}…
A recent conjecture by I. Ra\c{s}a asserts that the sum of the squared Bernstein basis polynomials is a convex function in $[0,1]$. This conjecture turns out to be equivalent to a certain upper pointwise estimate of the ratio…
An important quantity associated with a complex polynomial $p(z)$ is $\Vert p \Vert_\infty$, the maximum of its modulus over the unit disc $D$. We prove, $z_* \in D$ is a local maximum of $|p(z)|$ if and only if $a_*$ satisfies,…
Given a function f defined on a bidimensional bounded domain and a positive integer N, we study the properties of the triangulation that minimizes the distance between f and its interpolation on the associated finite element space, over all…
The aim of this paper is to show that, for any $p \in [1,\infty)$, the $W^{1,p}$-anisotropic interpolation error estimate holds on quadrilateral isoparametric elements verifying the maximum angle condition ($MAC$) and the property of…
We say that a subset of C^n is hypoconvex if its complement is the union of complex hyperplanes. Let D be the closed unit disk in C, T the unit circle. We prove two conjectures of Helton and Marshall. (See ``Frequency domain design and…
By $B=B(x^{(0)};R)$ we denote the Euclidean ball in ${\mathbb R}^n$ given by the inequality $\|x-x^{(0)}\|\leq R$. Here $x^{(0)}\in{\mathbb R}^n, R>0$, $\|x\|:=\left(\sum_{i=1}^n x_i^2\right)^{1/2}$. We mean by $C(B)$ the space of…
In this paper, we consider interpolation by \textit{completely monotonous} polynomials (CMPs for short), that is, polynomials with non-negative real coefficients. In particular, given a finite set $S\subset \mathbb{R}_{>0} \times…
There are three new things in this paper about the open symmetrized bidisk $\mathbb G = \{(z_1+z_2, z_1z_2) : |z_1|, |z_2| < 1\}$. They are motivated in the Introduction. In this Abstract, we mention them in the order in which they will be…
The challenge to measure exposures regularly forces financial institutions into a choice between an overwhelming computational burden or oversimplification of risk. To resolve this unsettling dilemma, we systematically investigate replacing…
Let $\mathbb{F}_p$ be the field of a prime order $p.$ It is known that for any integer $N\in [1,p]$ one can construct a subset $A\subset\mathbb{F}_p$ with $|A|= N$ such that $$ \max\{|A+A|, |AA|\}\ll p^{1/2}|A|^{1/2}. $$ In the present…
We obtain a result concerning the stability under the interpolation with functional parameter method for the approximation spaces of Lorentz-Marcinkiewicz type and also for the approximation spaces generated by symmetric norming functions…
We solve an interpolation problem in $A^p_\alpha$ involving specifying a set of (possibly not distinct) $n$ points, where the $k^{\textrm{th}}$ derivative at the $k^{\textrm{th}}$ point is up to a constant as large as possible for functions…
Final representation of all those measures $\mu$ for which algebraic polynomials are dense in $L_p(R, d\mu)$ is found. The weighted analogue of the Weierstrass polynomial approximation theorem and a new version of the M. Krein's theorem…
If L is a complete ortholattice, f any partial function from L^n to L, then there is a complete ortholattice L* containing L as a subortholattice, and an ortholattice polynomial with coefficients in L* which represents f on L^n. Iterating…
This paper focuses on the approximation of continuous functions on the unit sphere by spherical polynomials of degree $n$ via hyperinterpolation. Hyperinterpolation of degree $n$ is a discrete approximation of the $L^2$-orthogonal…
Motivated by polynomial approximations of differential forms, we study analytical and numerical properties of a polynomial interpolation problem that relies on function averages over interval segments. The usage of segment data gives rise…
Using a lemma of Davis on Gram matrices applied to the classical Orthogonal Polynomials to generate reproducing kernel interpolation over the classical domains for polynomials. These kernels have terms which are exact over the rational…
In approximation of functions based on point values, least-squares methods provide more stability than interpolation, at the expense of increasing the sampling budget. We show that near-optimal approximation error can nevertheless be…
We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials $n!m!$ and also derive asymptotic formulas for the number of solutions…