COMPUTATIONAL METHODS FOR PROPAGATING PHASE BOUNDARIES

Citation
Xg. Zhong et al., COMPUTATIONAL METHODS FOR PROPAGATING PHASE BOUNDARIES, Journal of computational physics, 124(1), 1996, pp. 192-216
Citations number
64
Categorie Soggetti
Mathematical Method, Physical Science","Computer Science Interdisciplinary Applications","Physycs, Mathematical
ISSN journal
00219991
Volume
124
Issue
1
Year of publication
1996
Pages
192 - 216
Database
ISI
SICI code
0021-9991(1996)124:1<192:CMFPPB>2.0.ZU;2-W
Abstract
This paper considers numerical methods for computing propagating phase boundaries in solids described by the physical model introduced by Ab eyaratne and Knowles. The model under consideration consists of a set of conservation laws supplemented with a kinetic relation and a nuclea tion criterion. Discontinuities between two different phases are under compressive crossing waves in the general terminology of nonstrictly h yperbolic systems of conservation laws. This paper studies numerical m ethods designed for the computation of such crossing waves. We propose a Godunov-type method combining front tracking with a capturing metho d; we also consider Glimm's random choice scheme. Both methods share t he property that the phase boundaries are sharply computed in the sens e that there are no numerical interior points for the description of a phase boundary. This properly is well known for the Glimm's scheme; o n the other hand, our front tracking algorithm is designed so that it tracks phase boundaries but captures shock waves. Phase boundaries are sensitive to numerical dissipation effects, so the above property is essential to ensure convergence toward the correct entropy weak soluti on. Convergence of the Godnuov-type method is demonstrated numerically . Extensive numerical experiments show the practical interest of both approaches for computations of undercompressive crossing waves. (C) 19 96 Academic Press, Inc.