How can I test if a sequence is converging?

Click For Summary
To test if a sequence is converging, one can utilize the formal definition of convergence, which states that a sequence converges to a limit A if, for any small positive number ε, there exists a natural number N such that for all n greater than or equal to N, the absolute difference between the sequence element and A is less than ε. Cauchy sequences are also relevant, as they converge if the terms become arbitrarily close to each other as the sequence progresses. A practical approach mentioned is calculating the moving average and checking if it stabilizes below a certain threshold. Additionally, bounded and monotone sequences are guaranteed to converge. Understanding these concepts can provide a solid foundation for analyzing the convergence of sequences.
FrogPad
Messages
801
Reaction score
0
This is related to my senior design project.

I was wondering what would be a good way to check if a sequence is converging. As an example, imagine I have the following:

for n = 1:10,000
x(n) = f(n,n-1)
end

What I'm trying to say is that the sequence is updated in each iteration, and that the value of each sequence element is a function of present and past inputs. I know that the sequence is converging. Let's say that it is converging to zero. However, the sequence may oscillate like crazy, and cross zero many times, but eventually it will settle.

My question:
How can I check if a sequence is converging to zero? What are some standard tests that I can look into?

As of now, I have some hack code that basically computes the moving average. If the moving average gets to some threshold (i.e. not changing much), then I keep checking to see if it drops below some other threshold.
 
Mathematics news on Phys.org
It would be worthwhile to pick up a book on analysis and read the chapter on sequences. You would be interested in the formal definition of convergence--

(a_n) \rightarrow A if for any \epsilon > 0 there exists a natural number N such that n\geq N \Rightarrow |a_n - A| < \epsilon.

Another important thing you should know-- bounded, monotone sequences converge.

Many times you can just straight up use the definition to confirm that a sequence converges. The trick is that many times you will set up a triangle inequality to get the job done. Which I even think is how Cauchy sequences (mentioned in the previous post) can be shown to converge.

Let me rephrase that definition-- a sequence is convergent if for any interval around the proposed limit the sequence eventually enters the interval and never leaves. That means for any interval surrounding the proposed limit, there should be an infinite number of terms in the sequence contained within that interval.
 
Here is a little puzzle from the book 100 Geometric Games by Pierre Berloquin. The side of a small square is one meter long and the side of a larger square one and a half meters long. One vertex of the large square is at the center of the small square. The side of the large square cuts two sides of the small square into one- third parts and two-thirds parts. What is the area where the squares overlap?

Similar threads

  • · Replies 16 ·
Replies
16
Views
1K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 13 ·
Replies
13
Views
9K
Replies
8
Views
966
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K