Skip to content

Uniform Chebyshev asymptotics for repeated-pole rational approximation of the exponential

Sep 2026 · arXiv.org · Vol abs/2609.21028 · 1 citation · 21 references
Computer Science Mathematics

Abstract

We study uniform approximation of $\exp(tz)$, $t>0$, on $(-\infty,0]$ by rational functions $P_m(z)/(q_m-z)^m$ with a prescribed repeated pole $q_m>0$. A M\"obius transformation reduces the problem to polynomial approximation of $F_\lambda(x)=\exp\!\left(-\lambda\frac{1-x}{1+x}\right)$ on $[-1,1]$, where $\lambda=tq_m$. We derive a uniform two-saddle asymptotic formula for the Chebyshev coefficients, including explicit amplitude and phase and a relative remainder for each localized complex saddle contribution, covering fixed, sublinear, and linear pole scalings away from saddle coalescence. Because the two saddle contributions can cancel in a single coefficient, we pass to a growing block of neighboring coefficients and prove that the whole block cannot cancel. This transfers the coefficient asymptotics to approximation errors. For $q_m=(\alpha/t)m$, $0<\alpha<3\sqrt3/2$, the best uniform error has two-sided order $m^{-1/2}H_e(\alpha)^m$; at the optimal ratio $\alpha=1/\sqrt2$ this becomes $m^{-1/2}(\sqrt2-1)^m$. The normalized Chebyshev-weighted $L^2$ projection error has an explicit bounded oscillatory profile. These prefactor-resolved estimates yield a two-term precision-to-work law and quantify mismatch between pole-design and stopping degrees. Finally, the scalar error gives an exact worst-case matrix-action benchmark for self-adjoint negative semidefinite matrices and dimension-independent shift-and-invert Krylov bounds.

View source

Similar papers

Preprint Oct 2026

Maximal Absolute Monotonicity of Balanced Rational Functions with a Single Repeated Pole

We study the radius of absolute monotonicity of rational approximations to the exponential of the form \[ \phi(z)=\frac{P(z)}{(1-z/b)^s}, \qquad b>0,\qquad \deg P\le s, \] with approximation orders two and three. For second-order approximation, we prove that the maximal radius in degree $s=5$ is $10$ and determine the...

Rachid Ait-Haddou · 0 citations
Preprint Sep 2026

Maximal Regularity and Existence for Superquadratic Parabolic Hamilton--Jacobi Equations: The Endpoint case

We establish interior maximal $L^{q_c}$-regularity for bounded strong solutions of $u_t-\Delta u+|Du|^\gamma=f$ in $\mathbb{T}^d\times(0,T)$, where $d\geq 2$, $\gamma>2$, and $q_c=(d+2)(\gamma-1)/\gamma$. The estimates are uniform for uniformly bounded families of solutions whose source terms range over a bounded, unif...

Fan-Ze Kong, Xiao-Yu Zeng · 0 citations
Preprint Sep 2026

Asymptotic Root Dynamics under Repeated and Fractional Integration

Fix a polynomial $P(x)=\sum_{j=0}^m a_jx^j$ of degree $m$, and let $I_kP$ be its $k$-fold antiderivative with all integration constants zero. Borwein, Chen, and Dilcher proved that, after $x=ky$, the nonzero zeros of $I_kP$ converge to the nonzero zeros of $L[P](y)=\sum_j a_j j! y^j$. That convergence determines the le...

Patrick Lawless · 0 citations
Preprint Nov 2026

Kronecker coefficients of large degree and Littlewood-Richardson inequalities

We prove that Kronecker coefficients are uniformly asymptotic to $f^\lambda f^\mu f^\nu/n!$ when all three irreducible dimensions are at least $\sqrt{n!}\,e^{-A\sqrt n}$, for any fixed $A>0$. This strengthens a conjecture of Pak, Panova and Yeliussizov. For triple staircase and triple square partitions, we obtain relat...

Zachary Slonim · 0 citations
Preprint Oct 2026

Fourier asymptotics of critical Gaussian multiplicative chaos on the circle

We study the high-frequency Fourier coefficients $C_n$ of critical Gaussian multiplicative chaos $M$ on the circle, for logarithmic covariances with an arbitrary admissible smooth, possibly nonstationary remainder. For every fixed finite set of integer offsets, the corresponding vector of neighboring coefficients, mult...

Yin-Qi Cai, Bo-Nan Chen, Xiang Fang et al. · 0 citations
Preprint Oct 2026

A New Bound for the Gauss Circle Problem

Let $E(X)=\#\{(a,b)\in\Z^2:a^2+b^2\le X\}-\pi X$. We prove that $E(X)=O_\varepsilon(X^{209/670+\varepsilon})$ for every $\varepsilon>0$, uniformly for real $X\ge4$. This breaks the $5/16$ threshold suggested by Huxley as a possible limit of the Bombieri--Iwaniec method at the time. The proof introduces two refinements:...

Xi Cen, Xi-Tao Gao, Cheng Zhang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.