English
Related papers

Related papers: Chebyshev polynomials on equipotential curves

200 papers

Working over a field $\kk$ of characteristic zero, this paper studies line embeddings of the form $\phi = (T_i,T_j,T_k):\A^1\to\A^3$, where $T_n$ denotes the degree $n$ Chebyshev polynomial of the first kind. In {\it Section 4}, it is shown…

Algebraic Geometry · Mathematics 2009-02-20 Gene Freudenburg , Jenna Freudenburg

Let $(f_n)_{n=1}^\infty$ be a sequence of nonlinear polynomials satisfying some mild conditions. Furthermore, let $F_m(z)=(f_m\circ f_{m-1}\ldots \circ f_1)(z)$ and $\rho_m$ be the leading coefficient for $F_m$. It is shown that on the…

Dynamical Systems · Mathematics 2016-09-01 Gökalp Alpan

For a function g(w) analytic and univalent in {w:1<|w|<\infty} with a simple pole at \infty and a continuous extension to {w:|w|\geq 1}, we consider the Faber polynomials F_n(z), n=0,1,2,..., associated to g(w) via their generating function…

Classical Analysis and ODEs · Mathematics 2009-03-19 Erwin Miña-Díaz

We prove an analogue of Chebyshev's alternation theorem for linearly independent discrete functions $\Phi_n=\{\varphi_k\}_{k=1}^n$ on the interval $[0,q]_{\mathbb{Z}}=[0,q]\cap \mathbb{Z}$. In particular, we establish that the polynomial of…

Classical Analysis and ODEs · Mathematics 2025-01-07 D. V. Gorbachev , V. I. Ivanov , S. Yu. Tikhonov

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…

Numerical Analysis · Mathematics 2021-11-17 Xiaolong Zhang

It is proved that the Chebyshev's method applied to an entire function $f$ is a rational map if and only if $f(z) = p(z) e^{q(z)}$, for some polynomials $p$ and $q$. These are referred to as rational Chebyshev maps, and their fixed points…

Dynamical Systems · Mathematics 2024-11-19 Subhasis Ghora , Tarakanta Nayak , Soumen Pal , Pooja Phogat

We employ the generalized Remez algorithm, initially suggested by P. T. P. Tang, to perform an experimental study of Chebyshev polynomials in the complex plane. Our focus lies particularly on the examination of their norms and zeros. What…

Complex Variables · Mathematics 2025-07-11 Lennart Aljoscha Hübner , Olof Rubin

Motivated by the product formula of the Chebyshev polynomials of the second kind $U_n(x)$, we newly introduce the partial Chebyshev polynomials $U^{\mathrm{e}}_n(x)$ and $U^{\mathrm{o}}_n(x)$ and derive their basic properties, relations to…

Combinatorics · Mathematics 2025-04-02 Wojciech Młotkowski , Nobuaki Obata

Recursive algebraic construction of two infinite families of polynomials in $n$ variables is proposed as a uniform method applicable to every semisimple Lie group of rank $n$. Its result recognizes Chebyshev polynomials of the first and…

Mathematical Physics · Physics 2014-11-03 Maryna Nesterenko , Jiri Patera , Agnieszka Tereszkiewicz

For a compact subset $K$ of the complex plane $\mathbb C,$ let $C(K)$ denote the algebra of continuous functions on $K$. For an open subset $U \subset K,$ let $A(K,U) \subset C(K)$ be the algebra of functions that are analytic in $U.$ We…

Functional Analysis · Mathematics 2023-08-24 Liming Yang

The discrete Chebyshev polynomials $t_n(x,N)$ are orthogonal with respect to a distribution, which is a step function with jumps one unit at the points $x=0,1,\cdots, N-1$, $N$ being a fixed positive integer. By using a double integral…

Complex Variables · Mathematics 2013-03-19 J. H. Pan , Roderick Wong

We discuss the relation between the linear Tschebyshev-Pad\'e approximations to analytic function $f$ and the diagonal type I Hermite-Pad\'e polynomials for the tuple of functions $[1,f_1,f_2]$ where the pair of functions $f_1,f_2$ forms…

Complex Variables · Mathematics 2021-06-07 Evguenii A. Rakhmanov , Sergey P. Suetin

In this paper, we study square functions for extension operators over finite-type, planar curves endowed with the Euclidean arclength measure. We prove new results for curves of the form $(T,\phi(T))$ where $\phi(T)$ is a polynomial of…

Classical Analysis and ODEs · Mathematics 2026-02-10 Kirsti D. Biggs , Julia Brandes , Kevin Hughes

The even and odd Zernike Polynomials R_n^m(x) can be expanded into sums of even and odd Chebyshev Polynomials T_i(x). This manuscript provides closed forms for the rational expansion coefficients c_{n,m,i} for a set of small 0 <= n-m <= 6…

Classical Analysis and ODEs · Mathematics 2025-11-21 Richard J. Mathar

In this paper, we discuss asymptotic relations for the approximation of $\left\vert x\right\vert ^{\alpha},\alpha>0$ in $L_{\infty}\left[ -1,1\right] $ by Lagrange interpolation polynomials based on the zeros of the Chebyshev polynomials of…

Classical Analysis and ODEs · Mathematics 2018-01-17 Michael Revers

An inverse polynomial has a Chebyshev series expansion 1/\sum(j=0..k)b_j*T_j(x)=\sum'(n=0..oo) a_n*T_n(x) if the polynomial has no roots in [-1,1]. If the inverse polynomial is decomposed into partial fractions, the a_n are linear…

Classical Analysis and ODEs · Mathematics 2016-09-07 Richard J. Mathar

A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series expansions or Chebyshev interpolation polynomials. We consider the application of…

Symbolic Computation · Computer Science 2014-07-11 Alexandre Benoit , Mioara Joldes , Marc Mezzarobba

Let $\varPhi:{\mathbb R}^n \to [1, \infty)$ be a semi-continuous from below function such that $\lim \limits_{x \to \infty} \displaystyle \frac {\ln \varPhi(x)} {\Vert x \Vert} = +\infty$. It is shown that polynomials are dense in…

Functional Analysis · Mathematics 2017-12-27 I. Kh. Musin

Let W be a finite reflection group acting orthogonally on R^n, P be the Chevalley polynomial mapping determined by an integrity basis of the algebra of W-invariant polynomials, and h be the highest degree of the coordinate polynomials in…

Functional Analysis · Mathematics 2010-03-04 Gerard Barbançon

This paper considers the approximation of a monomial $x^n$ over the interval $[-1,1]$ by a lower-degree polynomial. This polynomial approximation can be easily computed analytically and is obtained by truncating the analytical Chebyshev…

Numerical Analysis · Mathematics 2021-01-19 Arvind K. Saibaba
‹ Prev 1 2 3 10 Next ›