adaptive multi scale scheme based on numerical density of
play

Adaptive multi scale scheme based on numerical density of entropy - PowerPoint PPT Presentation

Adaptive multi scale scheme based on numerical density of entropy production for conservation laws. eric Golay 2 and Lyudmyla Yushchenko 3 Mehmet Ersoy 1 , Fr ed Workshop MTM2011-29306, 18-19 February 2013 1. Mehmet.Ersoy@univ-tln.fr 2.


  1. Adaptive multi scale scheme based on numerical density of entropy production for conservation laws. eric Golay 2 and Lyudmyla Yushchenko 3 Mehmet Ersoy 1 , Fr´ ed´ Workshop MTM2011-29306, 18-19 February 2013 1. Mehmet.Ersoy@univ-tln.fr 2. Frederic.Golay@univ-tln.fr 3. Lyudmyla.Yushchenko@univ-tln.fr

  2. Outline of the talk Outline of the talk 1 Introduction 2 Construction of the adaptive multi scale scheme Numerical approximation and properties Mesh refinement algorithm The local time stepping algorithm 3 Numerical results Sod’s shock tube problem Shu and Osher test case 4 Concluding remarks& perspectives M. Ersoy (IMATH) Entropy production MTM 2 / 35

  3. Outline Outline 1 Introduction 2 Construction of the adaptive multi scale scheme Numerical approximation and properties Mesh refinement algorithm The local time stepping algorithm 3 Numerical results Sod’s shock tube problem Shu and Osher test case 4 Concluding remarks& perspectives M. Ersoy (IMATH) Entropy production MTM 3 / 35

  4. Framework We focus on general non linear hyperbolic conservation laws � ∂ w ∂t + ∂ f ( w ) = 0 , ( t, x ) ∈ R + × R (1) ∂x w (0 , x ) = w 0 ( x ) , x ∈ R . where w ∈ R d : vector state , f : flux governing the physical description of the flow. It is well-known, even if the initial data are smooth, that : at a finite time : solutions develop complex discontinuous structure uniqueness is lost Serre D., Systems of conservation laws , (99) ; Eymard R., Gallou¨ et T., Herbin R., The finite volume method , (00) ; M. Ersoy (IMATH) Entropy production MTM 4 / 35

  5. Framework We focus on general non linear hyperbolic conservation laws � ∂ w ∂t + ∂ f ( w ) = 0 , ( t, x ) ∈ R + × R (1) ∂x w (0 , x ) = w 0 ( x ) , x ∈ R . where w ∈ R d : vector state , f : flux governing the physical description of the flow. It is well-known, even if the initial data are smooth, that : at a finite time : solutions develop complex discontinuous structure uniqueness is lost and is recovered (weak physical solution) by completing the system (1) with an entropy inequality of the form : ∂s ( w ) + ∂ψ ( w ) � 0 ∂t ∂x where ( s, ψ ) stands for a convex entropy-entropy flux pair. Serre D., Systems of conservation laws , (99) ; Eymard R., Gallou¨ et T., Herbin R., The finite volume method , (00) ; M. Ersoy (IMATH) Entropy production MTM 4 / 35

  6. The role of the entropy inequality The inequality ∂s ( w ) + ∂ψ ( w ) � 0 ∂t ∂x provides information on the regularity of the solution : ≡ 0 if solutions are smooth < 0 if solutions are discontinuous Houston P., Mackenzie J.A., S¨ uli E., Warnecke G., Numer. Math. , (99) ; Karni S., Kurganov A., Petrova G., J. Comp. Phys. , (02) ; Puppo G., SIAM J. Sci. Comput. ICOSAHOM, (03) ; Puppo G., Semplice M., Commun. Comput. Phys. , (03) ; Golay F., C.R. M´ ecanique , (09) ; M. Ersoy (IMATH) Entropy production MTM 5 / 35

  7. The role of the entropy inequality The inequality ∂s ( w ) + ∂ψ ( w ) � 0 ∂t ∂x provides information on the regularity of the solution : ≡ 0 if solutions are smooth < 0 if solutions are discontinuous Numerical approximation of this inequality, called numerical density of entropy production , measure the amount of violation of the entropy equation (as a measure of the local residual). Houston P., Mackenzie J.A., S¨ uli E., Warnecke G., Numer. Math. , (99) ; Karni S., Kurganov A., Petrova G., J. Comp. Phys. , (02) ; Puppo G., SIAM J. Sci. Comput. ICOSAHOM, (03) ; Puppo G., Semplice M., Commun. Comput. Phys. , (03) ; Golay F., C.R. M´ ecanique , (09) ; M. Ersoy (IMATH) Entropy production MTM 5 / 35

  8. The role of the entropy inequality The inequality ∂s ( w ) + ∂ψ ( w ) � 0 ∂t ∂x provides information on the regularity of the solution : ≡ 0 if solutions are smooth < 0 if solutions are discontinuous Numerical approximation of this inequality, called numerical density of entropy production , measure the amount of violation of the entropy equation (as a measure of the local residual). As a consequence, the numerical density of entropy production provides information on the need : to coarsen the mesh if solutions are smooth locally refine the mesh if solutions are discontinuous Houston P., Mackenzie J.A., S¨ uli E., Warnecke G., Numer. Math. , (99) ; Karni S., Kurganov A., Petrova G., J. Comp. Phys. , (02) ; Puppo G., SIAM J. Sci. Comput. ICOSAHOM, (03) ; Puppo G., Semplice M., Commun. Comput. Phys. , (03) ; Golay F., C.R. M´ ecanique , (09) ; M. Ersoy (IMATH) Entropy production MTM 5 / 35

  9. The role of the entropy inequality The inequality ∂s ( w ) + ∂ψ ( w ) � 0 ∂t ∂x provides information on the regularity of the solution : ≡ 0 if solutions are smooth < 0 if solutions are discontinuous Numerical approximation of this inequality, called numerical density of entropy production , measure the amount of violation of the entropy equation (as a measure of the local residual). As a consequence, the numerical density of entropy production provides information on the need : to coarsen the mesh if solutions are smooth locally refine the mesh if solutions are discontinuous Conclusion : an intrinsic a posteriori error indicator = ⇒ automatic mesh refinement Houston P., Mackenzie J.A., S¨ uli E., Warnecke G., Numer. Math. , (99) ; Karni S., Kurganov A., Petrova G., J. Comp. Phys. , (02) ; Puppo G., SIAM J. Sci. Comput. ICOSAHOM, (03) ; Puppo G., Semplice M., Commun. Comput. Phys. , (03) ; Golay F., C.R. M´ ecanique , (09) ; M. Ersoy (IMATH) Entropy production MTM 5 / 35

  10. An important time restriction Explicit adaptive schemes are well-know to be time consuming due to a CFL stability condition since : the CFL imposes an upper bound on δt h where δt is the time step and h the finest mesh size. M¨ uller S., Stiriba Y., SIAM J. Sci. Comput. , (07) ; Tan Z., Zhang Z., Huang Y., Tang T., J. Comp. Phys. , (04) ; Ersoy M., Golay F., Yushchenko L., CEJM , (13) ; M. Ersoy (IMATH) Entropy production MTM 6 / 35

  11. An important time restriction, local time stepping approach Explicit adaptive schemes are well-know to be time consuming due to a CFL stability condition since : the CFL imposes an upper bound on δt h where δt is the time step and h the finest mesh size. Nevertheless, the cpu-time can be significantly reduced using the local time stepping algorithm M¨ uller S., Stiriba Y., SIAM J. Sci. Comput. , (07) ; Tan Z., Zhang Z., Huang Y., Tang T., J. Comp. Phys. , (04) ; Ersoy M., Golay F., Yushchenko L., CEJM , (13) ; M. Ersoy (IMATH) Entropy production MTM 6 / 35

  12. An important time restriction, local time stepping approach & Aims Explicit adaptive schemes are well-know to be time consuming due to a CFL stability condition since : the CFL imposes an upper bound on δt h where δt is the time step and h the finest mesh size. Nevertheless, the cpu-time can be significantly reduced using the local time stepping algorithm Aims : save the cpu-time by making use of the local time stepping algorithm M¨ uller S., Stiriba Y., SIAM J. Sci. Comput. , (07) ; Tan Z., Zhang Z., Huang Y., Tang T., J. Comp. Phys. , (04) ; Ersoy M., Golay F., Yushchenko L., CEJM , (13) ; M. Ersoy (IMATH) Entropy production MTM 6 / 35

  13. An important time restriction, local time stepping approach & Aims Explicit adaptive schemes are well-know to be time consuming due to a CFL stability condition since : the CFL imposes an upper bound on δt h where δt is the time step and h the finest mesh size. Nevertheless, the cpu-time can be significantly reduced using the local time stepping algorithm Aims : save the cpu-time keeping the order of accuracy by making use of the automatic mesh refinement algorithm local time stepping algorithm M¨ uller S., Stiriba Y., SIAM J. Sci. Comput. , (07) ; Tan Z., Zhang Z., Huang Y., Tang T., J. Comp. Phys. , (04) ; Ersoy M., Golay F., Yushchenko L., CEJM , (13) ; M. Ersoy (IMATH) Entropy production MTM 6 / 35

  14. Outline Outline 1 Introduction 2 Construction of the adaptive multi scale scheme Numerical approximation and properties Mesh refinement algorithm The local time stepping algorithm 3 Numerical results Sod’s shock tube problem Shu and Osher test case 4 Concluding remarks& perspectives M. Ersoy (IMATH) Entropy production MTM 7 / 35

  15. Outline Outline 1 Introduction 2 Construction of the adaptive multi scale scheme Numerical approximation and properties Mesh refinement algorithm The local time stepping algorithm 3 Numerical results Sod’s shock tube problem Shu and Osher test case 4 Concluding remarks& perspectives M. Ersoy (IMATH) Entropy production MTM 8 / 35

  16. Finite volume formulation of the problem Figure: a cell C k M. Ersoy (IMATH) Entropy production MTM 9 / 35

  17. Finite volume formulation of the problem Integrating  ∂ w ∂t + ∂ f ( w ) = 0   ∂x   ∂s ( w ) + ∂ψ ( w )   0 �   ∂t ∂x Figure: a cell C k over each cells C k × ( t n , t n +1 ) we obtain : � t n +1 � � w ( t n +1 , x ) dx − w ( t n , x ) dx + f ( w ( t, x i +1 / 2 )) − f ( w ( t, x i − 1 / 2 )) dt = 0 C k C k t n � t n +1 � � S = s ( w ( t n +1 , x )) dx − s ( w ( t n , x )) dx + ψ ( w ( t, x i +1 / 2 )) − ψ ( w ( t, x i − 1 / 2 )) dt C k C k t n where is the density of entropy production and should satisfy S � 0 . M. Ersoy (IMATH) Entropy production MTM 9 / 35

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend