"Stability of Finite Difference schemes. I was reading a book ''Numerical partial differential equation: Finite difference methods'' by J. W. Thomas. Here at page no. 74, definition of stability is given as ∥u^(n+1)∥<=Ke^(beta t)∥u^0∥; for 0<=t=(n+1) delta t, 0<=delta x<=delta x_0 and 0<=delta t <=delta t_0. i.e. this definition allows for exponential growth. however in a few literature i found the definition that ''A finite distinction approximation is solid if the errors (truncation, spherical-off and so forth) decay as the computation proceeds from one marching step to the next .'' The ebook which i've noted, at the equal page in remark 3, creator has written that the above definition with exponential increase is trendy definition and later one may be derived from this.but i am not gett
Aliyah Thompson
Answered question
2022-11-04
Stability of Finite Difference schemes. I was reading a book ''Numerical partial differential equation: Finite difference methods'' by J. W. Thomas. Here at page no. 74, definition of stability is given as for and . i.e. this definition allows for exponential growth. however in a few literature i found the definition that ''A finite distinction approximation is solid if the errors (truncation, spherical-off and so forth) decay as the computation proceeds from one marching step to the next .'' The ebook which i've noted, at the equal page in remark 3, creator has written that the above definition with exponential increase is trendy definition and later one may be derived from this.but i am not getting the way to locate this definition. So my question is which definition is true ? And if different one is not proper, then what is motive at the back of ? and the way can we examine those two definition?
Answer & Explanation
lavarcar2d2
Beginner2022-11-05Added 18 answers
To address the concern of your stability question, one often has to enforce some sort of constrain on the time step. Here is an example. Consider the advection diffusion equation: , with for with for all x and t. Applying the explicit difference method then,
Recall the following Discrete Fourier Transform rules:
Applying the previous rules, then our difference method equation becomes:
With
And after some algebra,
Here is the Stability part Require to avoid blowing up (Stability) and recall that the Fourier Transform process is norm-preserving, then
Which is equivalent to
To obtain the constrain on and , which are the time step and the space step for the numerical method, set
Note there is another condition for stability for this system, but this condition encompass the other one so I don't mention it.