Numerical Methods for Partial Differential Equations
Verified
Added on 2023/04/25
|5
|1165
|227
AI Summary
This study material covers numerical methods for solving partial differential equations, including Triangular domain, Rothe's method, and 1D convention-diffusion-reaction. It includes detailed derivations and boundary conditions for each method. References are also provided for further reading.
Contribute Materials
Your contribution can guide someone’s learning journey. Share your
documents today.
3. Triangular domain Given; ∆u=f LetΩ=Ω∩R+¿2¿amdΩ:=Ω∪0<x,y<1 Takingi=0, we discretize as follows; ∂n 2u ∂x2(0,1−x)=1 h2(u−1,j−2u0,j+ui,j)+O(h2)……………(i) Applying the boundary conditions; −γ0,j=∂nu ∂x(0,1−x)=1 2h(u1,j−u−1,j)+O(h2)……………….(ii) Combining (i) and (ii); ∂n 2u ∂x2(t)=1 h2(2ui,j−2u0,j)+2γo,j h+O(h2) Whereγ=0; ∂n 2u ∂x2(t)=1 h2(2ui,j−2u0,j)+O(h2) From the solution obtained we observe that the consistency level is 2. From the solution we obtain that an alternating sequence is formed meaning that north point is equal to the east point as well as west point being equal to the south point as described in the figure below(Khasminskii, 2011).
Secure Best Marks with AI Grader
Need help grading? Try our AI Grader for instant feedback on your assignments.
From the details in the diagram we come up with a matrix as below; (−410 1−41 01−4 100 010 001 000 000 000 100 010 001 −410 1−41 01−4 100 010 001 000 000 000 100 010 001 −410 1−41 01−4 )(u1,1 u2,1 u3,1 u1,2 u2,2 u3,2 u1,3 u2,3 u3,3 )= (h2f1,1−u1,0−u0,1 h2f2,1−u2,0 h2f3,1−u3,0−u4,1 h2f1,2−u0,2 h2f2,2 h2f3,2−u4,2 h2f1,3−u0,3−u1,4 h62f2,3−u2,4 h2f3,3−ui4,3−u3,4 )4. Rothe’s method uk+1=uk+τ∆uk+1,(x,y)Ω Rearranging we have; uk+1−uk=τ∆uk+1 Using the 5-point finite difference formula to discrete the PDE in space we obtain; dui,j dt(x,y)=D h2(ui+1,j+ui−1,j+ui,j+1+ui,j−1−4ui,j)+O(h2) Therefore, uk+1−uk h=ui+1,j k+1+ui−1,j k+1−4ui,j k+1+ui,j+1 k+1+ui,j−1 k+1 h2+O(h2) Multiplying both sides by h; uk+1−uk=ui+1,j k+1+ui−1,j k+1−4ui,j k+1+ui,j+1 k+1+ui,j−1 k+1 h+O(h2) The convergence order is 2. To make the linear stable;τ≤h2 Comparing the 5 point finite difference formula to the implicit method, the implicit method is inefficient.
5. 1D convention-diffusion-reaction a) For central difference formula;(Moin, 2010) u''−bu'=u(x+h)−2u(x)+u(x−h) h2−b(u(x+h)−u(x−h) 2h+O(h2)) Applying the boundary conditions; u''−bu'=u(x+h)−2(1)+u(x−h) h2−b(u(x+h)−u(x−h) 2h+O(h2)) ¿u(x+h)−2+u(x−h) h2−b(u(x+h)−u(x−h) 2h+O(h2)) Forward difference formula; u''−bu'=u(x+h)−2u(x)+u(x−h) h2−b(u(x+h)−u(x) h+O(h)) Applying the boundary conditions; u''−bu'=u(x+h)−2(1)+u(x−h) h2−b(u(x+h)−1 h+O(h)) u''−bu'=u(x+h)−2+u(x−h) h2−b(u(x+h)−1 h+O(h)) Backward difference formula; u''−bu'=u(x+h)−2u(x)+u(x−h) h2−b(u(x+h)−u(x−h) h) Applying the conditions;
u''−bu'=u(x+h)−2(1)+u(x−h) h2−b(u(x+h)−u(x−h) h) u''−bu'=u(x+h)−2+u(x−h) h2−b(u(x+h)−u(x−h) h+O(h)) b) i)The solution for central difference is u''−bu'=u(x+h)−2+u(x−h) h2−b(u(x+h)−u(x−h) 2h+O(h2)) To ensure its discrete maximum principle satisfied;h<0 ii) The solution for forward difference is u''−bu'=u(x+h)−2+u(x−h) h2−b(u(x+h)−1 h+O(h)) To ensure its discrete maximum principle satisfied;h<0 iii) The solution for backward difference is u''−bu'=u(x+h)−2+u(x−h) h2−b(u(x+h)−u(x−h) h+O(h)) To ensure its discrete maximum principle satisfied;h<0 i)
Paraphrase This Document
Need a fresh take? Get an instant paraphrase of this document with our AI Paraphraser
References Khasminskii, R. (2011). Stochastic Stability of Differential Equations: In G. N. Milstein,Stochastic Modelling and Applied Probability (vol 66). Springer Science & Business Media, pp 23-105. Moin, P. (2010). Fundamentals of Engineering Numerical Analysis. Cambridge University Press, pp 10-33.