English
Related papers

Related papers: Best polynomial approximation on the triangle

200 papers

We establish best possible pointwise (up to a constant multiple) estimates for approximation, on a finite interval, by polynomials that satisfy finitely many (Hermite) interpolation conditions, and show that these estimates cannot be…

Classical Analysis and ODEs · Mathematics 2021-01-07 Kirill A. Kopotun , Dany Leviatan , Igor A. Shevchuk

In this paper, we study the approximation problem for functions in the Gaussian-weighted Sobolev space $W^\alpha_p(\mathbb{R}^d, \gamma)$ of mixed smoothness $\alpha \in \mathbb{N}$ with error measured in the Gaussian-weighted space…

Functional Analysis · Mathematics 2023-09-29 Van Kien Nguyen

For two independent Erd\H{o}s-R\'enyi graphs $\mathbf G(n,p)$, we study the maximal overlap (i.e., the number of common edges) of these two graphs over all possible vertex correspondence. We present a polynomial-time algorithm which finds a…

Probability · Mathematics 2022-10-17 Jian Ding , Hang Du , Shuyang Gong

We establish interpolation analogues of Lebesgue type inequalities on the sets of $C^{\psi}_{\beta}L_{1}$ $2\pi$-periodic functions $f$, which are representable as convolutions of generating kernel $\Psi_{\beta}(t) =…

Classical Analysis and ODEs · Mathematics 2023-08-24 A. S. Serdyuk , T. A. Stepaniuk

Let $\Theta = (\theta_1,\theta_2,\theta_3)\in \mathbb{R}^3$. Suppose that $1,\theta_1,\theta_2,\theta_3$ are linearly independent over $\mathbb{Z}$. For Diophantine exponents $$ \alpha(\Theta) = \sup \{\gamma >0:\,\,\, \limsup_{t\to…

Number Theory · Mathematics 2010-12-09 Nikolay Moshchevitin

We study the $L_2$-approximation of functions from a Hilbert space and compare the sampling numbers with the approximation numbers. The sampling number $e_n$ is the minimal worst case error that can be achieved with $n$ function values,…

Numerical Analysis · Mathematics 2024-10-15 David Krieg , Mario Ullrich

This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum…

Computational Complexity · Computer Science 2015-05-19 Zhixiang Chen , Bin Fu

We show that there is no $(1+\eps)$-approximation algorithm for the problem of covering points in the plane by minimum number of fat triangles of similar size (with the minimum angle of the triangles being close to 45 degrees). Here, the…

Computational Geometry · Computer Science 2009-08-18 Sariel Har-Peled

Several new inequalities for moduli of smoothness and errors of the best approximation of a function and its derivatives in the spaces $L_p$, $0<p<1$, are obtained. For example, it is shown that for any $0<p<1$ and $k,\,r\in \mathbb{N}$ one…

Classical Analysis and ODEs · Mathematics 2016-12-26 Yurii Kolomoitsev

This article is concerned with an extension of univariate Chebyshev polynomials of the first kind to the multivariate setting, where one chases best approximants to specific monomials by polynomials of lower degree relative to the uniform…

Optimization and Control · Mathematics 2024-10-29 Mareike Dressler , Simon Foucart , Mioara Joldes , Etienne de Klerk , Jean Bernard Lasserre , Yuan Xu

We establish new estimates for the constant $J_a(k,\alpha)$ in the Brudnyi-Jackson inequality for approximation of $f \in C[-1,1]$ by algebraic polynomials: $$ E_{n}^a (f) \le J_a(k, \alpha) \ \omega_k (f, \alpha \pi /n ), \quad \alpha >0…

Classical Analysis and ODEs · Mathematics 2017-05-17 A. G. Babenko , Yu. V. Kryakin

We prove two-sided estimates for the best (i.e., the smallest possible) constant $\,c_n(\alpha)\,$ in the Markov inequality $$ \|p_n'\|_{w_\alpha} \le c_n(\alpha) \|p_n\|_{w_\alpha}\,, \qquad p_n \in {\cal P}_n\,. $$ Here, ${\cal P}_n$…

Classical Analysis and ODEs · Mathematics 2017-11-21 Geno Nikolov , Rumen Uluchev

In this paper we consider $L_{\overline{p}, \overline\alpha, \overline{\tau}}^{*}(\mathbb{T}^{m})$ anisotropic Lorentz-Zyg\-mu\-nd space $ 2\pi$ of periodic functions of $m$ variables and Nikol'skii--Besov's class $S_{\overline{p},…

Classical Analysis and ODEs · Mathematics 2021-06-22 Gabdolla Akishev

We obtain matching direct and inverse theorems for the degree of weighted $L_p$-approximation by polynomials with the Jacobi weights $(1-x)^\alpha (1+x)^\beta$. Combined, the estimates yield a constructive characterization of various…

Classical Analysis and ODEs · Mathematics 2017-10-17 Kirill A. Kopotun , Dany Leviatan , Igor A. Shevchuk

We study the problem of approximating the value of the matching polynomial on graphs with edge parameter $\gamma$, where $\gamma$ takes arbitrary values in the complex plane. When $\gamma$ is a positive real, Jerrum and Sinclair showed that…

Discrete Mathematics · Computer Science 2021-01-13 Ivona Bezakova , Andreas Galanis , Leslie Ann Goldberg , Daniel Stefankovic

Let $\alpha\in(0,1)\setminus{\Bbb Q}$ and $K=\{(e^z,e^{\alpha z}):\,|z|\leq1\}\subset{\Bbb C}^2$. If $P$ is a polynomial of degree $n$ in ${\Bbb C}^2$, normalized by $\|P\|_K=1$, we obtain sharp estimates for $\|P\|_{\Delta^2}$ in terms of…

Complex Variables · Mathematics 2010-09-23 Dan Coman , Evgeny A. Poletsky

We study linear polynomial approximation of functions in weighted Sobolev spaces $W^r_{p,w}(\mathbb{R}^d)$ of mixed smoothness $r \in \mathbb{N}$, and their optimality in terms of Kolmogorov and linear $n$-widths of the unit ball…

Numerical Analysis · Mathematics 2025-01-03 Dinh Dũng

For $k \ge 2$ even, and $ \alpha \ge -(2k+1)/4 $, we provide a uniform approximation of the ultraspherical polynomials $ P_k^{(\alpha,\, \alpha)}(x) $ in the oscillatory region with a very explicit error term. In fact, our result covers all…

Classical Analysis and ODEs · Mathematics 2016-08-30 Ilia Krasikov

We study multivariate $L_2$-approximation for a weighted Korobov space of analytic periodic functions for which the Fourier coefficients decay exponentially fast. The weights are defined, in particular, in terms of two sequences…

Numerical Analysis · Mathematics 2012-11-27 Josef Dick , Peter Kritzer , Friedrich Pillichshammer , Henryk Woźniakowski

For a polynomial f: {-1, 1}^n --> C, we define the partition function as the average of e^{lambda f(x)} over all points x in {-1, 1}^n, where lambda in C is a parameter. We present a quasi-polynomial algorithm, which, given such f, lambda…

Data Structures and Algorithms · Computer Science 2016-11-30 Alexander Barvinok
‹ Prev 1 3 4 5 6 7 10 Next ›