51. ON NONCONSERVATIVE ALGORITHMS FOR GRID INTERFACES.
- Author
-
Tang, H. S. and Zhou, T.
- Subjects
DECOMPOSITION method ,ALGORITHMS ,COMPUTERS ,SPEED ,SIMULATION methods & models ,INTERPOLATION - Abstract
In computations of fluid flows by domain decomposition methods, the necessity of conservation at grid interfaces is now widely claimed. In this paper we consider nonconservative algorithms for the interfaces. Our investigation begins with discussions about typical nonconservative interface treatments for one-dimensional calculations. The analysis shows that the conservation error of a numerical solution caused by a nonconservative interface matching has an upper bound when the solution itself is bounded. Furthermore, if the numerical solution converges as the mesh size goes to zero, it converges to a weak solution of the problem under certain conditions that may be detected numerically. Also, we acquire similar results for two-dimensional calculations on grids intersecting with each other in an arbitrary way. In order to illustrate the theoretical results, we present numerical examples and demonstrate that, under those conditions, conservation error reduces and accuracy for jumps as well as locations of discontinuities improves as the mesh size decreases. [ABSTRACT FROM AUTHOR]
- Published
- 1999
- Full Text
- View/download PDF