Results 11 to 20 of about 80,472 (232)
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 +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
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 +3 more sources
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
Chebyshev Constant and Chebyshev Points [PDF]
Transactions of the American Mathematical Society, 1973 Using Ath power means in the case X ? 1, it is proven that the Chebyshev constant for any compact set in R5, real Euclidean n-space, is equal to the radius of the spanning sphere. When A ? 1, the Chebyshev points of order m for all m ? 1 are unique and coincide with the center of the spanning sphere. For the case A = 1, it is established that Chebyshev
openaire +1 more source
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
SIMULACIÓN DE UN SISTEMA DE TRANSMISIÓN DE DATOS
Ingeniería, 2011 En este trabajo se presenta una simulación por "software" de un sistema digital de transmisión de datos utilizando la herramienta llamada LabView ® para Windows ®, versión 5.0, de National Instruments. El sistema modela un generador binario de pulsos (
Arturo Ramírez Porras
doaj +1 more source
An approximation method for the solution of nonlinear integral equations [PDF]
, 2006 A Chebyshev collocation method has been presented to solve nonlinear integral equations in terms of Chebyshev polynomials. This method transforms the integral equation to a matrix equation which corresponds to a system of nonlinear algebraic equations ...
Akyuz-Dascioglu, A, Yaslan, HC
core +3 more sources