相关论文: On Gegenbauer Point Processes on the unit interval

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…

In this paper we explore the connections between minimizers of the discrete logarithmic energy on the 2-dimensional sphere, univariate polynomials with optimal condition number in the Shub-Smale sense and a quotient involving norms of…

Utilizing frameworks developed by Delsarte, Yudin and Levenshtein, we deduce linear programming lower bounds (as $N\to \infty$) for the Riesz energy of $N$-point configurations on the $d$-dimensional unit sphere in the so-called…

We study least deviation of logarithmic derivatives of real-valued polynomials with a fixed root from zero on the segment $[-1;1]$ in the uniform norm with the weight $\sqrt{1-x^2}$ and without it. Basing on results of Komarov and Novak and…

We propose an advanced Chebyshev expansion method for the numerical calculation of linear response functions at finite temperature. Its high stability and the small required resources allow for a comprehensive study of the optical…

An expansion procedure using third kind Chebyshev polynomials as base functions is suggested for solving second type Volterra integral equations with logarithmic kernels. The algorithm's convergence is studied and some illustrative examples…

We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…

We derive and investigate lower bounds for the potential energy of finite spherical point sets (spherical codes). Our bounds are optimal in the following sense -- they cannot be improved by employing polynomials of the same or lower degrees…

We distinguish a class of random point processes which we call Giambelli compatible point processes. Our definition was partly inspired by determinantal identities for averages of products and ratios of characteristic polynomials for random…

We present an asymptotic analysis of the Verblunsky coefficients for the polynomials orthogonal on the unit circle with the varying weight $e^{-nV(\cos x)}$, assuming that the potential $V$ has four bounded derivatives on $[-1,1]$ and the…

There is a vast theory of Chebyshev and residual polynomials and their asymptotic behavior. The former ones maximize the leading coefficient and the latter ones maximize the point evaluation with respect to an $L^\infty$ norm. We study…

Using the theory of determinantal point processes we give upper bounds for the Green and Riesz energies for the rotation group SO(3), with Riesz parameter up to 3. The Green function is computed explicitly, and a lower bound for the Green…

The best polynomial approximation and Chebyshev approximation are both important in numerical analysis. In tradition, the best approximation is regarded as more better than the Chebyshev approximation, because it is usually considered in…

We present methods for bounding infinite-time averages in dynamical systems governed by nonlinear PDEs. The methods rely on auxiliary functionals, which are similar to Lyapunov functionals but satisfy different inequalities. The…

We consider the asymptotic behavior (over long time intervals) of the minimal integral energy \[ |h|_T^\psi = \int_0^T \psi(h^\prime(t)) \, \mathrm{d}t \] of majorants of the Wiener process $ W(\cdot) $ satisfying the constraints $ h(0) = r…

We calculate the energy of the state closest to threshold for two and three identical, spinless particles confined to a cubic spatial volume with periodic boundary conditions and with zero total momentum in the finite-volume frame. The…

We obtain exact, simple and very compact expressions for the linearization coefficients of the products of orthogonal polynomials; both the conventional Clebsch-Gordan-type and the modified version. The expressions are general depending…

We consider partially observable Markov decision processes (POMDPs) with a set of target states and positive integer costs associated with every transition. The traditional optimization objective (stochastic shortest path) asks to minimize…

We discuss a progress in calculation of Feynman integrals which has been done with help of the Gegenbauer Polynomial Technique and demonstrate the results for most complicated parts of O(1/N^3) contributions to critical exponents of \phi^4…

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…