ISSN:
1572-9265
Keywords:
advection dominated problem
;
domain decomposition
;
65N30
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract Two nonoverlapping domain decomposition algorithms are proposed for convection dominated convection–diffusion problems. In each subdomain, artificial boundary conditions are used on the inflow and outflow boundaries. If the flow is simple, each subdomain problem only needs to be solved once. If there are closed streamlines, an iterative algorithm is needed and the convergence is proved. Analysis and numerical tests reveal that the methods are advantageous when the diffusion parameter ɛ is small. In such cases, the error introduced by the domain decomposition methods is negligible in comparison with the error in the singular layers, and it allows easy and efficient grid refinement in the singular layers.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1019133818553
Permalink
