z-logo
Premium
A ‘divide‐and‐conquer’ spatial and temporal multiscale method for transient convection–diffusion–reaction equations
Author(s) -
Gravemeier Volker,
Wall Wolfgang A.
Publication year - 2007
Publication title -
international journal for numerical methods in fluids
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.938
H-Index - 112
eISSN - 1097-0363
pISSN - 0271-2091
DOI - 10.1002/fld.1465
Subject(s) - convection–diffusion equation , convection , flow (mathematics) , diffusion , heuristic , transient (computer programming) , mechanics , independence (probability theory) , scale (ratio) , feature (linguistics) , mathematics , computer science , physics , mathematical optimization , thermodynamics , linguistics , statistics , philosophy , quantum mechanics , operating system
A multiscale method for the numerical solution of transient convection–diffusion–reaction equations is proposed in the present paper. Two main goals have led to the development of the present method: a desired independence of any heuristic parameter such as the stabilization parameter in stabilized methods and a desire for a consistent multiscale approach in space and time. The method is constituted by solution approaches on a coarse‐ and a fine‐scale level and by inter‐scale operators for data transfer between those two levels. A particular feature of the method is that no large matrix system has to be solved. The results from three numerical test cases show that for both problematic flow regimes, that is, the regime of dominant convection and the regime of dominant convection and absorption, the present method provides completely stable solutions, which are not achieved by standard stabilized methods, particularly for the later regime. A still to be noted current shortcoming of the proposed method reveals itself in a too smooth resolution of regions with a sharp gradient in the solution field. Copyright © 2007 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here