numerical solutions to partial differential equations
play

Numerical Solutions to Partial Differential Equations Zhiping Li - PowerPoint PPT Presentation

Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Finite Difference Methods for Elliptic Equations Discretization of Boundary Conditions Discretization of Boundary


  1. Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University

  2. Finite Difference Methods for Elliptic Equations Discretization of Boundary Conditions Discretization of Boundary Conditions On boundary nodes and irregular interior nodes, we usually need to construct different finite difference approximation schemes to cope with the boundary conditions. Remember that the set of irregular interior nodes is given by J Ω = { j ∈ J \ J D : D L h ( j ) �⊂ J } , that is ˜ ˜ J Ω is the set of all such interior node which has at least one neighboring node not located in ¯ Ω. For simplicity, we take the standard 5-point difference scheme for the 2-D Poisson equation −△ u = f as an example to see how the boundary conditions are handled. 2 / 36

  3. Discretization of the Dirichlet Boundary Condition Since N , E are not in J , P is a irregular interior node, on which we need to construct a difference equation using the Dirichlet boundary condition on the nearby points N ∗ , P ∗ and/or E ∗ . The simplest way is to apply interpolations. N N * P * n E * w e W P E ∂ Ω D s S

  4. Discretization of the Dirichlet Boundary Condition Difference equations on P derived by interpolations: Zero order: U P = U P ∗ with truncation error O ( h ); h y U N ∗ + h ∗ y U S First order: U P = h x U E ∗ + h ∗ x U W or U P = , with h x + h ∗ h y + h ∗ x y truncation error O ( h 2 ); N N * P * n E * w e W P E ∂ Ω D s S

  5. Discretization of the Dirichlet Boundary Condition Difference equations on P can be derived by extrapolations and the standard 5-point difference scheme: The grid function values on the ghost nodes N and E can be given by second order extrapolations using the grid function values on S , P , N ∗ and W , P , E ∗ respectively (see Exercise 1.3). N N * P * n E * w e W P E ∂ Ω D s S

  6. Discretization of the Dirichlet Boundary Condition Difference equations on P can also be derived by the Taylor series expansions and the partial differential equation to be solved: Express u W , u E ∗ , u S , u N ∗ by the Taylor expansions of u at P . Express u x , u y , u xx , u yy on P in terms of u W , u E ∗ , u S , u N ∗ and u P . Substitute these approximation values into the differential equation (see Exercise 1.4). N N * P * n E * w e W P E ∂ Ω D s S

  7. Discretization of the Dirichlet Boundary Condition Finite difference schemes with nonuniform grid spacing: a difference equation on P using the values of U on the nodes N ∗ , S , W , E ∗ and P with truncation error O ( h ): � � U E ∗ − U P � � U N ∗ − U P � � − U P − U W − U P − U S 2 2 − + = f P . h x + h ∗ h ∗ h x h y + h ∗ h ∗ h y x x y y N N * Shortcoming: nonsymmetric. P * n E * w e W P E ∂ Ω D s S

  8. Discretization of the Dirichlet Boundary Condition Symmetric finite difference schemes with nonuniform grid spacing: a difference equation on P using the values of U on the nodes N ∗ , S , W , E ∗ and P with truncation error O (1): � 1 � U E ∗ − U P � � U N ∗ − U P � � − U P − U W + 1 − U P − U S − = f P . h x h ∗ h x h y h ∗ h y x y N N * It can be shown: the global error is O ( h 2 ). P * n E * w e W P E ∂ Ω D s S

  9. Discretization of the Dirichlet Boundary Condition Construct a finite difference equation on P based on the integral � � ∂ u form of the partial differential equation − ∂ν ds = V P f dx : ∂ V P � U W − U P � h y + φ h ∗ + U E ∗ − U P y − h ∗ h x 2 x � U S − U P � h x + θ h ∗ ( h x + θ h ∗ x )( h y + φ h ∗ + U N ∗ − U P y ) x − = f P , h ∗ h y 2 4 y N where θ h ∗ x / 2, φ h ∗ y / 2 are the N * lengthes of the line segments P * n Pe and Pn . E * w e W P E ( O ( h ), nonsymmetric) ∂ Ω D s S

  10. Finite Difference Methods for Elliptic Equations Discretization of Boundary Conditions Discretization of the Dirichlet Boundary Condition Extension of the Dirichlet Boundary Condition Nodes J D Add all of the Dirichlet boundary points used in the equations on the irregular interior nodes concerning the curved Dirichlet boundary, such as E ∗ , N ∗ and P ∗ , into the set J D to form an extended set of Dirichlet boundary nodes, still denoted by J D . N N * P * n E * w e W P E ∂ Ω D s S 10 / 36

  11. Discretization of the Neumman Boundary Condition Since N , E are not in J , P is a irregular interior node, on which we need to construct a difference equation using the Nuemman boundary condition on the nearby points N ∗ , P ∗ and/or E ∗ . The simplest way is again to apply interpolations. N a N w N * n w P * E * ξ w W P E ∂ Ω N s s w η b S w S

  12. Discretization of the Neumman Boundary Condition Let P ∗ be the closest point to P on ∂ Ω N , and α be the angle between the x -axis and the out normal to ∂ Ω N at the point P ∗ . ∂ ν u ( P ∗ ) ∼ ∇ u ( P ) · ν P ∗ , a zero order extrapolation to the out normal, leads to a difference equation on P with local truncation error O ( h ) : U P − U W cos α + U P − U S sin α = g ( P ∗ ). h x h y N N w a N * n w P * E * ξ w W P E ∂ Ω N s s w η b S w S

  13. Discretization of the Neumman Boundary Condition We can combine the nonuniform grid spacing difference equations � � U E ∗ − U P � � U N ∗ − U P � � 2 − U P − U W 2 − U P − U S + = f P , − h x + h ∗ h ∗ h x h y + h ∗ h ∗ h y x x y y � 1 or � U E ∗ − U P � � U N ∗ − U P �� − U P − U W + 1 − U P − U S = f P , − h x h ∗ h x h y h ∗ h y x y on the irregular interior node P , and add in the difference equations for the new unknowns U N ∗ and U E ∗ by making use of the boundary conditions. Say N N w a N * U N ∗ − U ξ = g ( N ∗ ), O ( h ), n w P * | ξ N ∗ | and E * ξ w W P E U E ∗ − U η = g ( E ∗ ), O ( h ). ∂ Ω N | η E ∗ | s s w η b S w S

  14. Discretization of the Neumman Boundary Condition The finite volume method based on the integral form of the � � ∂ u Poisson equation − ∂ν ds = V P f dx with V P being the ∂ V P domain enclosed by the broken line segments, where an w ⊥ PN W , leads to an asymmetric finite volume scheme on the irregular interior node P − U N W − U P | an w |− U W − U P h y − U S − U P | s w b |− g ( P ∗ ) | � ab | = f ( P ) | V P | . h x h y | N W P | N N w a N * The local truncation error is O ( h ), n w P * since numerical quadrature is not E * ξ w centered. W P E ∂ Ω N s s w η b S w S

  15. Finite Difference Methods for Elliptic Equations Discretization of Boundary Conditions Discretization of the Neumman Boundary Condition More Emphasis on Global Properties In dealing with the boundary conditions, compared with the local truncation error, more attention should be put on the more important global features: Symmetry; Maximum principle; Conservation; etc.. 15 / 36

  16. Finite Difference Methods for Elliptic Equations Discretization of Boundary Conditions Discretization of the Neumman Boundary Condition More Emphasis on Global Properties so that the finite difference approximation solution can have better stability and higher order of global convergence; inherit as much as possible the important global properties from the analytical solution; be solved by applying fast solvers. 16 / 36

  17. Finite Difference Methods for Elliptic Equations Truncation Error, Consistency, Stability and Convergence Truncation Error, Consistency, Stability and Convergence Consider the boundary value problem of a partial differential � equation − Lu ( x ) = f ( x ) , ∀ x ∈ Ω , Gu ( x ) = g ( x ) , ∀ x ∈ ∂ Ω and the corresponding finite difference approximation equation defined on a rectangular grid with spacing h − L h U j = f j , ∀ j ∈ J . Notice, if j is not a regular interior node, then L h and f j may depend on G and g as well as on L and f . Denote ¯ Lu ( x ) = Lu ( x ), if x ∈ Ω, and ¯ Lu ( x ) = Gu ( x ), if x ∈ ∂ Ω. 17 / 36

  18. Finite Difference Methods for Elliptic Equations Truncation Error, Consistency, Stability and Convergence Truncation Error and consistency Truncation Error Definition Suppose that the solution u to the problem is sufficiently smooth. Let T j ( u ) = L h u j − (¯ Lu ) j , ∀ j ∈ J . Define T j ( u ) as the local truncation error of the finite difference operator L h approximating to the differential operator ¯ L . The grid function T h ( u ) = { T j ( u ) } j ∈ J is called the truncation error of the finite difference equation approximating to the problem. Remark 1 : Briefly speaking, the truncation error measures the difference between the difference operator and the differential operator on smooth functions. Remark 2 : T h ( u ) can also be viewed as a piece-wise constant function defined on Ω via the control volumes. 18 / 36

Recommend


More recommend