๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Front tracking in two and three dimensions

โœ Scribed by J. Glimm; M.J. Graham; J. Grove; X.L. Li; T.M. Smith; D. Tan; F. Tangerman; Q. Zhang


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
713 KB
Volume
35
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis


Front tracking is a method for solving conservation laws in which the evolution of discontinuities is determined through the solution of Riemann problems. This method often does not require highly refined grids, and it has no numerical diffusion. We show the success of this method through a comparison of simulations of the Richtmyer-Meshkov instability, an unstable material interface, with experimental data. Good simulations of such instabilities are notoriously difficult, and we also demonstrate for the same physical problem that grid orientations have no effect on the numerical solution. We also present the first results of our three-dimensionai front tracking code by simulating an important aspect of the computer chip manufacturing process: material deposition and etching. Our two-and three-dimensional front tracking code is parallelized for MIMD architectures and runs on our 128 node Intel Paragon.


๐Ÿ“œ SIMILAR VOLUMES


Manual tracking in three dimensions
โœ Leigh A. Mrotek; C.C.A.M. Gielen; Martha Flanders ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 735 KB
Three-level BDDC in two dimensions
โœ Xuemin Tu ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 219 KB
Optimal Pose Estimation in Two and Three
โœ S.H. Joseph ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 307 KB

This paper concerns the problem of pose estimation, in particular the application of linear and nonlinear methods to the case of anisotropic error distributions. Incremental and batch techniques are discussed, and a linear solution to the two dimensional problem is developed by reference to the nois

Approximating Polygonal Curves in Two an
โœ Kento Miyaoku; Koichi Harada ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 134 KB

We discuss the weighted minimum number polygonal approximation problem. Eu and Toussaint (1994, CVGIP: Graphical Models Image Process. 56, 231-246) considered this problem subject to the parallel-strip error criterion in R 2 with L q distance metrics, and they concluded that it can be solved in O(n

Comparing Planetary Accretion in Two and
โœ J.E. Chambers ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 366 KB

Two ways to speed up N-body simulations of planet formation are (i) to confine motion to 2 spatial dimensions, or (ii) to artificially enhance the physical radii of the bodies. These short cuts have the same effect of increasing the collision probability between objects. Here, I compare the results