中文
相关论文

相关论文: Best polynomial approximation on the triangle

200 篇论文

It is not surprising that one should expect that the degree of constrained (shape preserving) approximation be worse than the degree of unconstrained approximation. However, it turns out that, in certain cases, these degrees are the same.…

经典分析与常微分方程 · 数学 2019-01-15 K. A. Kopotun , D. Leviatan , I. A. Shevchuk

This paper is concerned with near-optimal approximation of a given function $f \in L_2([0,1])$ with elements of a polynomially enriched wavelet frame, a so-called quarklet frame. Inspired by $hp$-approximation techniques of Binev, we use…

数值分析 · 数学 2023-01-11 Stephan Dahlke , Marc Hovemann , Thorsten Raasch , Dorian Vogel

In this article, we consider the Euclidean dispersion problems. Let $P=\{p_{1}, p_{2}, \ldots, p_{n}\}$ be a set of $n$ points in $\mathbb{R}^2$. For each point $p \in P$ and $S \subseteq P$, we define $cost_{\gamma}(p,S)$ as the sum of…

计算几何 · 计算机科学 2021-05-20 Pawan K. Mishra , Gautam K. Das

Approximation theory plays a central role in numerical analysis, undergoing continuous evolution through a spectrum of methodologies. Notably, Lebesgue, Weierstrass, Fourier, and Chebyshev approximations stand out among these methods.…

数值分析 · 数学 2024-04-30 S Akansha

For a function $f$ that is piecewise analytic on a quasi-smooth arc $\mathcal{L}$ and any $0<\sigma<1$ we construct a sequence of "near-best" polynomials that converge at a rate $e^{-n^{\sigma}}$ at each point of analyticity of $f$ and are…

复变函数 · 数学 2021-02-04 Liudmyla Kryvonos

On the sets of $2\pi$-periodic functions $f$, which are defined with a help of $(\psi, \beta)$-integrals of the functions $\varphi$ from $L_{1}$, we establish Lebesgue-type inequalities, in which the uniform norms of deviations of Fourier…

经典分析与常微分方程 · 数学 2023-01-06 Anatoly Serdyuk , Tetiana Stepaniuk

We study connections between orthogonal polynomials, reproducing kernel functions, and polynomials $p$ minimizing Dirichlet-type norms $\|pf-1\|_{\alpha}$ for a given function $f$. For $\alpha\in [0,1]$ (which includes the Hardy and…

The approximate degree of a Boolean function is the least degree of a real multilinear polynomial approximating it in the $\ell_\infty$-norm over the Boolean hypercube. We show that the approximate degree of the Bipartite Perfect Matching…

离散数学 · 计算机科学 2022-03-03 Gal Beniamini

An algorithm is given for determining an optimal $b$-step approximation of weighted data, where the error is measured with respect to the $L_\infty$ norm. For data presorted by the independent variable the algorithm takes $\Theta(n + \log n…

数据结构与算法 · 计算机科学 2015-05-05 Quentin F. Stout

Let $G$ be the interior domain of a piecewise analytic Jordan curve without cusps. Let $\{p_n\}_{n=0}^\infty$ be the sequence of polynomials that are orthonormal over $G$ with respect to the area measure, with each $p_n$ having leading…

经典分析与常微分方程 · 数学 2023-01-24 Erwin Miña-Díaz

In the paper, we study inequalities for the best trigonometric approximations and fractional moduli of smoothness involving the Weyl and Liouville-Gr\"unwald derivatives in $L_p$, $0<p<1$. We extend known inequalities to the whole range of…

经典分析与常微分方程 · 数学 2018-11-09 Yurii Kolomoitsev , Tetiana Lomako

Given a complete graph with $n$ vertices and non-negative edge weights, where $n$ is divisible by 3, the maximum weight 3-path packing problem is to find a set of $n/3$ vertex-disjoint 3-paths such that the total weight of the 3-paths in…

数据结构与算法 · 计算机科学 2025-12-17 Jingyang Zhao , Mingyu Xiao

We consider the problem of finding a best uniform approximation to the standard monomial on the unit ball in $\bbC^2$ by polynomials of lower degree with complex coefficients. We reduce the problem to a one-dimensional weighted minimization…

经典分析与常微分方程 · 数学 2010-02-11 I. Moale , P. Yuditskii

We study quantum algorithms for approximating Lasserre's hierarchy values for polynomial optimization. Let $f,g_1,\ldots,g_m$ be real polynomials in $n$ variables and $f^\star$ the infimum of $f$ over the semialgebraic set $S(g)=\{x:…

量子物理 · 物理学 2025-11-19 Daniel Stilck França , Ngoc Hoang Anh Mai

Let ${\bf P}_k^{(\alpha, \beta)} (x)$ be an orthonormal Jacobi polynomial of degree $k.$ We will establish the following inequality \begin{equation*} \max_{x \in [\delta_{-1},\delta_1]}\sqrt{(x- \delta_{-1})(\delta_1-x)}…

经典分析与常微分方程 · 数学 2007-05-23 Ilia Krasikov

We study orthogonal polynomials on a fully symmetric planar domain $\Omega$ that is generated by a certain triangle in the first quadrant. For a family of weight functions on $\Omega$, we show that orthogonal polynomials that are even in…

经典分析与常微分方程 · 数学 2025-09-15 Yuan Xu

We calculated the exact value and found the polynomial of the best weighted polynomial approximation of the kernels of the form $\frac {A+Bx}{(x^2+\lambda^2)^2}$, where $A,B\in {\mathbb R}$, $\lambda>0$ in the mean-square metric.

复变函数 · 数学 2023-10-30 V. V. Savchuk , S. O. Chaichenko , A. L. Shidlich

We explore the connection between two seemingly distant fields: the set of cyclic functions $f$ in a Hilbert space of analytic functions over the unit disc $\D$, on the one hand, and the families of orthogonal polynomials for a weight on…

经典分析与常微分方程 · 数学 2025-07-22 Ramón Orive , Joaquín Sánchez-Lara , Daniel Seco

Let $f,g_1,\dots,g_m$ be polynomials with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Denote by $\text{diag}(g)$ the diagonal matrix with coefficients $g=(g_1,\dots,g_m)$ and denote by $\nabla g$ the Jacobian of $g$. Let…

最优化与控制 · 数学 2023-01-24 Ngoc Hoang Anh Mai

In this paper, we prove a quantitative approximation result by orthonormal polynomials associated to an exponential weight of the form e -$\Phi$ , where $\Phi$ is an even polynomial with positive leading coefficient. This result is a…

数值分析 · 数学 2024-12-19 Bastien Grosse