Results 11 to 20 of about 21,657 (246)
Journal of Knot Theory and Its Ramifications, 2011 A Chebyshev knot is a knot which admits a parametrization of the form x(t) = Ta(t); y(t) = Tb(t); z(t) = Tc(t + ϕ), where a, b, c integers, Tn(t) is the Chebyshev polynomial of degree n, and φ ∈ R. Chebyshev knots are non-compact analogues of the classical Lissajous knots. We show that there are infinitely many Chebyshev knots with φ = 0.
Koseleff, Pierre-Vincent, Pecker, Daniel
openaire +5 more sources
Resultants of Chebyshev Polynomials [PDF]
Zeitschrift für Analysis und ihre Anwendungen, 2008 Recently, K. Dillcher and K. B. Stolarsky [ Trans. Amer. Math. Soc. 357 (2004), 965–981] used algebraic methods to evaluate the resultant of two linear combinations of Chebyshev polynomials of the second kind.
Jemal Gishe, Mourad E. H. Ismail
core +7 more sources
On Chebyshev Polynomials of Matrices [PDF]
SIAM Journal on Matrix Analysis and Applications, 2010 The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of $p(A)$ over all monic polynomials $p(z)$ of degree m. This polynomial is uniquely defined if m is less than the degree of the minimal polynomial of A.
Vance Faber, Jörg Liesen, Petr Tichý
openaire +6 more sources
Chebyshev series: Derivation and evaluation [PDF]
PLoS ONE, 2023 In this paper we use a contour integral method to derive a bilateral generating function in the form of a double series involving Chebyshev polynomials expressed in terms of the incomplete gamma function. Generating functions for the Chebyshev polynomial
Robert Reynolds, Allan Stauffer
doaj +3 more sources
Chebyshev Wavelet Analysis [PDF]
Journal of Function Spaces, 2022 This paper deals with Chebyshev wavelets. We analyze their properties computing their Fourier transform. Moreover, we discuss the differential properties of Chebyshev wavelets due to the connection coefficients.
Emanuel Guariglia +1 more
doaj +2 more sources
Chebyshev Polynomials and Spectral Method for Optimal Control Problem [PDF]
Engineering and Technology Journal, 2009 This paper presents efficient algorithms which are based on applying the idea of spectral method using the Chebyshev polynomials: including Chebyshev polynomials of the first kind, Chebyshev polynomials of the second kind and shifted Chebyshev ...
Suha Najeeb Shihab, Jabbar Abed Eleiwy
doaj +1 more source
JTAM (Jurnal Teori dan Aplikasi Matematika), 2021 In this article, we discuss the Chebyshev Polynomial and its characteristics. The second order difference equation and the process obtaining the explicit solution of the Chebyshev polynomial have been given for each real number.
Ikhsan Maulidi +3 more
doaj +1 more source
Chopping a Chebyshev Series [PDF]
ACM Transactions on Mathematical Software, 2017 Chebfun and related software projects for numerical computing with functions are based on the idea that at each step of a computation, a function f ( x ) defined on an interval [ a , b ] is “rounded” to a prescribed precision by constructing a ...
Jared Lee Aurentz, Lloyd N. Trefethen
openaire +2 more sources
The Chebyshev Polynomials of a Matrix [PDF]
SIAM Journal on Matrix Analysis and Applications, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Toh, K.-C., Trefethen, L.N.
openaire +2 more sources