Understanding the Pseudospectral Method for Solving KdV Equation in MATLAB

  • Thread starter Thread starter tiongwk
  • Start date Start date
Click For Summary
The discussion revolves around implementing the pseudospectral method to solve the KdV equation in MATLAB. Participants clarify that the pseudospectral method is a type of spectral method, which often utilizes fast Fourier transforms. The distinction between collocation and spectral methods is explored, with collocation methods using trial functions and satisfying equations at specific points. The conversation also touches on the classification of numerical methods for solving partial differential equations, emphasizing the role of pseudospectral methods within spectral methods. The thread concludes with a question about the specific conditions that the pseudospectral method satisfies in its application.
tiongwk
Messages
3
Reaction score
0
Hi,

I'm having a problem coding pseudospectral method to solve KdV equation in matlab.
Can someone help me? thanks in advance.

KdV equation:
u_t+uu_x+u_xxx=0.
 
Physics news on Phys.org
Just curious. Is Collocation Method also a pseudospectral method? I'm learning the wavelet collocation method to solve differential equations.
 
i don't think it is the same
 
Then the Collocation Method is a spectral method because it makes use of trial functions. Am I correct?

Really sorry to bother you all but I'm still learning numerical methods. From what I read, numerical methods for solving pde typically fall into one of the three classes, namely, finite difference /volume, finite element and spectral methods.

Where does the pseudospectral method fit in these classes?
 
pseudospectral is one of the spectral methods. pseudospectral often uses fast Fourier transform. I'm not so sure about the collocation method.
 
If I understood correctly, the spectral method is some sort like Fourier series method. Or do I?
Let say we want to solve a basic initial and boundary problem of linear heat conduction pde. Using the Fourier series method we assume separation of variables.
u(x,t)=\sum T_n(t)X_n(x).

The spectral method numerical procedure truncates the Fourier series at N terms, uN(x,t) and required its approximate satisfies the pde.
{ Xn } are prechosen functions which span a subspace.

If the approximate satisfies the equation at specified points, the method is called Collocation.
If the approximate satisfies the equation in projected sense, the method is called Galerkin.

What does the pseudospectral method satisfy ?
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 14 ·
Replies
14
Views
2K
Replies
8
Views
2K
  • · Replies 3 ·
Replies
3
Views
12K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 15 ·
Replies
15
Views
7K
  • · Replies 18 ·
Replies
18
Views
3K