How do i evaluate the convergence

  • Context: Graduate 
  • Thread starter Thread starter supercali
  • Start date Start date
  • Tags Tags
    Convergence
Click For Summary
SUMMARY

This discussion focuses on evaluating the convergence of Fourier series derived from solving partial differential equations (PDEs). The primary method discussed involves calculating the average error using the formula |f(n)-f(n+1)|/|f(n+1)|, where f represents the PDE function and n denotes the number of components. The goal is to determine the minimum number of terms required for convergence to be within a specified percentage, X%. The brute force approach of comparing successive terms is emphasized as an effective strategy for achieving this evaluation.

PREREQUISITES
  • Understanding of Fourier series and their application in solving PDEs
  • Familiarity with convergence criteria in numerical analysis
  • Basic knowledge of error analysis techniques
  • Proficiency in manipulating mathematical expressions and inequalities
NEXT STEPS
  • Research advanced techniques for evaluating convergence in Fourier series
  • Explore numerical methods for solving partial differential equations
  • Study error analysis in numerical computations
  • Learn about the implications of convergence rates in applied mathematics
USEFUL FOR

Mathematicians, engineers, and researchers working with Fourier series and partial differential equations, particularly those focused on convergence evaluation and numerical analysis.

supercali
Messages
53
Reaction score
0
got Fourier series as a result of solving a PDE. how do i evaluate the converg. using average error in order to determine the # of terms needed for it to converge to less than X%?
 
Last edited by a moderator:
Physics news on Phys.org
Well brute force is Solve with n vars then solve with n+1 vars and compare |n-(n+1)|/|n+1| once that is less than X% difference you can do that. Since each individual component should have less value towards the total solution than the previous one.
 
ChaseRLewis said:
Well brute force is Solve with n vars then solve with n+1 vars and compare |n-(n+1)|/|n+1| once that is less than X% difference you can do that. Since each individual component should have less value towards the total solution than the previous one.

oops was thinking about this I mistyped it's |f(n)-f(n+1)|/|f(n+1)| where f is your pde function and n equivalent to the number of components. meant that before but was rushing.
 

Similar threads

  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
5K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
26
Views
3K