中文
相关论文

相关论文: Best polynomial approximation on the triangle

200 篇论文

We obtain closed expressions for weighted orthogonal polynomials and optimal approximants associated with the function $f(z)=1-\frac{1}{\sqrt{2}}(z_1+z_2)$ and a scale of Hilbert function spaces in the unit $2$-ball having reproducing…

复变函数 · 数学 2021-10-28 Meredith Sargent , Alan A. Sola

This work is a continuation of the recent study by the authors on approximation theory over the sphere and the ball. The main results define new Sobolev spaces on these domains and study polynomial approximations for functions in these…

经典分析与常微分方程 · 数学 2010-11-15 Feng Dai , Yuan Xu

We study the problem of approximating an unknown function $f:\mathbb{R}\to\mathbb{R}$ by a degree-$d$ polynomial using as few function evaluations as possible, where error is measured with respect to a probability distribution $\mu$.…

数据结构与算法 · 计算机科学 2025-08-11 Chris Camaño , Raphael A. Meyer , Kevin Shu

When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…

数学软件 · 计算机科学 2007-05-23 Nicolas Brisebarre , Jean-Michel Muller

D. Leviatan has investigated the behavior of the higher order derivatives of approximation polynomials of the differentiable function $f$ on $[-1,1]$. Especially, when $P_n$ is the best approximation of $f$, he estimates the differences…

经典分析与常微分方程 · 数学 2014-03-04 Hee Sun Jung , Ryozi Sakai

Let $2s$ points $y_i=-\pi\le y_{2s}<\ldots<y_1<\pi$ be given. Using these points, we define the points $y_i$ for all integer indices $i$ by the equality $y_i=y_{i+2s}+2\pi$. We shall write $f\in\bigtriangleup^{(1)}(Y)$ if $f$ is a…

经典分析与常微分方程 · 数学 2014-04-28 M. G. Pleshakov

In metric of spaces $L_{s}, \ 1< s\leq\infty$, we obtain exact order estimates of best approximations and approximations by Fourier sums of classes of convolutions the periodic functions that belong to unit ball of space $L_{1}$, with…

经典分析与常微分方程 · 数学 2014-10-16 T. A. Stepaniuk

Trigonometric polynomials are widely used for the approximation of a smooth function $f$ from a set of nonuniformly spaced samples $\{f(x_j)\}_{j=0}^{N-1}$. If the samples are perturbed by noise, controlling the smoothness of the…

数值分析 · 数学 2025-10-20 Thomas Strohmer

In this paper we establish exact order estimates for the best uniform orthogonal trigonometric approximations of the classes of $2\pi$-periodic functions, whose $(\psi,\beta)$-derivatives belong to unit balls of spaces $L_{p}$, $1\leq…

经典分析与常微分方程 · 数学 2018-12-18 Tetiana Stepanyuk

In this paper, exact rate of decrease of best approximations of non-integer numbers by polynomials with integer coefficients of the growing exponentials is found on a disk in complex plane, on a cube in $\mathbb{R}^d$, and on a ball in…

经典分析与常微分方程 · 数学 2020-01-01 R. M. Trigub

We consider the sum-of-squares hierarchy of approximations for the problem of minimizing a polynomial $f$ over the boolean hypercube $\mathbb{B}^{n}=\{0,1\}^n$. This hierarchy provides for each integer $r \in \mathbb{N}$ a lower bound…

最优化与控制 · 数学 2022-01-20 Lucas Slot , Monique Laurent

A strong error estimate for the uniform rational approximation of $x^\alpha$ on $[0,1]$ is given, and its proof is sketched. Let $E_{nn}(x^\alpha,[0,1])$ denote the minimal approximation error in the uniform norm. Then it is shown that…

经典分析与常微分方程 · 数学 2008-02-03 Herbert Stahl

We obtain the estimates for the best approximation in the uniform metric of the classes of $2\pi $-periodic functions whose $(\psi ,\beta)$-derivatives have a given majorant $\omega$ of the modulus of continuity. It is shown that the…

经典分析与常微分方程 · 数学 2011-04-15 A. S. Serdyuk , Ie. Yu. Ovsii

We obtain order estimates for the best uniform orthogonal trigonometric approximations of $2\pi$-periodic functions, whose $(\psi,\beta)$-derivatives belong to unit balls of spaces $L_{p}, \ 1\leq p<\infty$, in case at consequences…

经典分析与常微分方程 · 数学 2016-03-08 A. S. Serdyuk , T. A. Stepaniuk

We give the first polynomial time algorithm for \emph{list-decodable covariance estimation}. For any $\alpha > 0$, our algorithm takes input a sample $Y \subseteq \mathbb{R}^d$ of size $n\geq d^{\mathsf{poly}(1/\alpha)}$ obtained by…

数据结构与算法 · 计算机科学 2022-06-23 Misha Ivkov , Pravesh K. Kothari

The best bounds of the form $B(\alpha,\beta,\gamma,x)=(\alpha+\sqrt{\beta^2+\gamma^2 x^2})/x$ for ratios of modified Bessel functions are characterized: if $\alpha$, $\beta$ and $\gamma$ are chosen in such a way that…

经典分析与常微分方程 · 数学 2023-04-17 J. Segura

The paper concerns the uniform polynomial approximation of a function $f$, continuous on the unit Euclidean sphere of ${\mathbb R}^3$ and known only at a finite number of points that are somehow uniformly distributed on the sphere. First we…

数值分析 · 数学 2018-08-10 Woula Themistoclakis , Marc Van Barel

We find uniform with respect to parameter $p \ (1\leq p\leq\infty)$ upper estimations of best approximations by trigonometric polynomials of classes $C^{\psi}_{\beta,p}$ of periodic functions generated by sequences $\psi(k)$, that decrease…

经典分析与常微分方程 · 数学 2014-10-16 A. S. Serdyuk , T. A. Stepaniuk

The subspace approximation problem Subspace($k$,$p$) asks for a $k$-dimensional linear subspace that fits a given set of points optimally, where the error for fitting is a generalization of the least squares fit and uses the $\ell_{p}$ norm…

数据结构与算法 · 计算机科学 2011-01-04 Amit Deshpande , Kasturi Varadarajan , Madhur Tulsiani , Nisheeth K. Vishnoi

We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…

计算复杂性 · 计算机科学 2017-11-29 Makrand Sinha