Finding a limit involving Chebyshev polynomials

In summary, the speaker is trying to find a way to show that the given limit is equal to 0. They mention that they have tried expanding the terms and using the Chebyshev polynomials, but have not been successful. They also mention that the Chebyshev polynomials are defined over [−1,1], but the given expression has a different range. They suggest using the Stolz–Cesàro theorem to find the solution.
  • #1
Unconscious
74
12
How could I show that this limit:

##\lim_{N\to\infty}\frac{\sum_{p=1}^N T_{4N} \left(u_0(N)\cdot \cos\frac{p\pi}{2N+1}\right)}{N}##

is equal to 0?

In the expression above ##T_{4N}## is the Chebyshev polynomials of order ##4N##, ##u_0(N)\geq 1## is a number such that ##T_{4N}(u_0)=b##, with ##b\geq 1## fixed.

I tried to write ##T_{4N}## in its polynomial form, and to expand in series the terms ##\cos^k##, trying to reach a geometric series that would simplify everything to me in a chain, but still remains an abomination.
 
Physics news on Phys.org
  • #2
Chebyshev polynomials are defined over [−1,1], but you have ##T_{4N}(u_0)=b## with ##b \ge 1##. Are you extending the domain to ## [-b,b]##? NO! You can't mangle up the argument of the Chebyshev polynomials to fit your pathological conjecture.
 
  • #3
Keep calm.
No pathological conjectures, no conspiracy theories against Chebyshev's polynomials.

Fred Wright said:
Chebyshev polynomials are defined over [−1,1]
False.
Read here: https://en.wikipedia.org/wiki/Chebyshev_polynomials#Explicit_expressions .

For other references on this limit, read: R. S. Elliott, Antenna Theory and Design, Linear Array Synthesis.
 
  • #4
Unconscious said:
Keep calm.
No pathological conjectures, no conspiracy theories against Chebyshev's polynomials.False.
Read here: https://en.wikipedia.org/wiki/Chebyshev_polynomials#Explicit_expressions .

For other references on this limit, read: R. S. Elliott, Antenna Theory and Design, Linear Array Synthesis.
Ok, my bad. Have you tried evaluating the sum with ##N=1##?
 

1. What are Chebyshev polynomials?

Chebyshev polynomials are a set of orthogonal polynomials that are commonly used in numerical analysis and approximation theory. They are named after Russian mathematician Pafnuty Chebyshev and are defined as the solutions to Chebyshev's differential equation.

2. How are Chebyshev polynomials used to find limits?

Chebyshev polynomials are used to find limits by using their properties of orthogonality and recurrence relations. By manipulating the polynomials and taking their limits, we can solve for the limit involving Chebyshev polynomials.

3. What is the significance of using Chebyshev polynomials in finding limits?

Chebyshev polynomials have several advantages in finding limits, including their ability to approximate any continuous function on a given interval and their fast convergence rate. They also have a well-defined recurrence relation, making them useful in numerical computations.

4. Can Chebyshev polynomials be used to find limits of any function?

No, Chebyshev polynomials are most effective in finding limits of continuous functions on a given interval. They may not be suitable for finding limits of discontinuous or non-continuous functions.

5. Are there any limitations to using Chebyshev polynomials in finding limits?

One limitation of using Chebyshev polynomials is that they may not be as accurate for functions with sharp corners or cusps. In these cases, other methods may be more suitable for finding limits. Additionally, the accuracy of the limit found using Chebyshev polynomials may depend on the degree of the polynomial used.

Similar threads

  • Linear and Abstract Algebra
Replies
2
Views
1K
Replies
2
Views
1K
  • Calculus
Replies
3
Views
792
Replies
1
Views
1K
Replies
5
Views
396
  • Calculus
Replies
2
Views
1K
Replies
16
Views
2K
Replies
2
Views
795
  • Differential Equations
Replies
2
Views
1K
Replies
6
Views
694
Back
Top