中文
相关论文

相关论文: Best uniform rational approximation of $x^\alpha$ …

200 篇论文

Let $E_n(f)_{\alpha,\beta,\gamma}$ denote the error of best approximation by polynomials of degree at most $n$ in the space $L^2(\varpi_{\alpha,\beta,\gamma})$ on the triangle $\{(x,y): x, y \ge 0, x+y \le 1\}$, where…

经典分析与常微分方程 · 数学 2019-02-01 Han Feng , Christian Krattenthaler , Yuan Xu

Let $X_1,..., X_N\in\R^n$ be independent centered random vectors with log-concave distribution and with the identity as covariance matrix. We show that with overwhelming probability at least $1 - 3 \exp(-c\sqrt{n}\r)$ one has $ \sup_{x\in…

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

The Error Function \begin{eqnarray} V(x) & \equiv & \sqrt{\pi} e^{x^2} [1 - \hbox{erf}(x)] \\ & = & \int_0^\infty \frac{ e^{-u} }{\sqrt{x^2 + u}} du = 2 e^{x^2}\int_x^\infty e^{-t^2} dt \nonumber \end{eqnarray} arises in many contexts, from…

泛函分析 · 数学 2009-09-25 M. Beth Ruskai , Elisabeth Werner

We consider the problem of partitioning a line segment into two subsets, so that $n$ finite measures all have the same ratio of values for the subsets. Letting $\alpha\in[0,1]$ denote the desired ratio, this generalises the PPA-complete…

计算复杂性 · 计算机科学 2022-11-30 Paul W. Goldberg , Jiawei Li

We study the problem of finding an $\epsilon$-fixed point of a contraction map $f:[0,1]^k\mapsto[0,1]^k$ under both the $\ell_\infty$-norm and the $\ell_1$-norm. For both norms, we give an algorithm with running time $O(\log^{\lceil…

计算复杂性 · 计算机科学 2026-02-12 Xi Chen , Yuhao Li , Mihalis Yannakakis

Rational best approximations (in a Chebyshev sense) to real functions are characterized by an equioscillating approximation error. Similar results do not hold true for rational best approximations to complex functions in general. In the…

数值分析 · 数学 2023-12-22 Tobias Jawecki , Pranav Singh

The rate of convergence of the distribution of the length of the longest increasing subsequence, toward the maximal eigenvalue of certain matrix ensembles, is investigated. For finite-alphabet uniform and nonuniform i.i.d. sources, a rate…

概率论 · 数学 2012-11-30 Christian Houdré , Zsolt Talata

Dirichlet's uniform approximation theorem is a fundamental result in Diophantine approximation that gives an optimal rate of approximation with a given bound. We study uniform Diophantine approximation properties on the Hecke group $\mathbf…

数论 · 数学 2025-03-25 Ayreena Bakhtawar , Dong Han Kim , Seul Bee Lee

By combining and improving recent techniques and results, we provide explicit estimates for the error terms $|\pi(x)-\text{li}(x)|$, $|\theta(x)-x|$ and $|\psi(x)-x|$ appearing in the prime number theorem. For example, we show for all…

数论 · 数学 2022-04-21 Daniel R. Johnston , Andrew Yang

We consider the question of approximating any real number $\alpha$ by sums of $n$ rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2} + ... + \frac{a_n}{q_n}$ with denominators $1 \leq q_1, q_2, ..., q_n \leq N$. This leads to an inquiry on…

数论 · 数学 2007-05-23 Tsz Ho Chan

This article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal with respect to larger ordering cones. When simultaneously…

最优化与控制 · 数学 2021-09-22 Arne Herzel , Stephan Helfrich , Stefan Ruzika , Clemens Thielen

The $n$-grid $E_n$ consists of $n$ equally spaced points in $[-1,1]$ including the endpoints $\pm 1$. The extremal polynomial $p_n^*$ is the polynomial that maximizes the uniform norm $\| p \|_{[-1,1]}$ among polynomials $p$ of degree $\leq…

经典分析与常微分方程 · 数学 2023-02-27 Arno B. J. Kuijlaars

We obtain two sequences of rational numbers which converge to the Euler-Gompertz constant. Denote by <f(x)> the integral of f(x)e^{-x} from 0 to infinity. Recall that the Euler-Gompertz constant \delta is <ln(x+1)>. Main idea. Let P_n(x) be…

数论 · 数学 2011-11-11 Vasily Bolbachan

We approximate the uniform measure on an equilateral triangle by a measure supported on $n$ points. We find the optimal sets of points ($n$-means) and corresponding approximation (quantization) error for $n\leq4$, give numerical…

信息论 · 计算机科学 2017-02-16 Carl P. Dettmann , Mrinal Kanti Roychowdhury

A reasonably complete theory of the approximation of an irrational by rational fractions whose numerators and denominators lie in prescribed arithmetic progressions is developed in this paper. Results are both, on the one hand, from a…

数论 · 数学 2014-08-27 Faustin Adiceam

We show how a central limit theorem for Poisson model random polygons implies a central limit theorem for uniform model random polygons. To prove this implication, it suffices to show that in the two models, the variables in question have…

概率论 · 数学 2012-08-14 John Pardon

A set of integers is \emph{primitive} if it does not contain an element dividing another. Denote by $f(n)$ the number of maximum-size primitive subsets of $\{1,\ldots, 2n\}$. We prove that the limit $\alpha=\lim_{n\rightarrow…

组合数学 · 数学 2023-06-22 Hong Liu , Péter Pál Pach , Richárd Palincza

In this paper a spline based integral approximation is utilized to propose a sequence of approximations to the error function that converge at a significantly faster manner than the default Taylor series. The approximations can be improved…

综合数学 · 数学 2022-07-27 Roy M. Howard

Let $p_n(y)=\sum_k\hat{\alpha}_k\phi(y-k)+\sum_{l=0}^{j_n-1}\sum_k\hat {\beta}_{lk}2^{l/2}\psi(2^ly-k)$ be the linear wavelet density estimator, where $\phi$, $\psi$ are a father and a mother wavelet (with compact support),…

统计理论 · 数学 2009-08-31 Evarist Giné , Richard Nickl