A fast algorithm for moving interface problems

S. Dutta; J. Glimm; J. W. Grove; D. H. Sharp; Y. Zhang

doi:10.1007/3-540-44843-8_85

A fast algorithm for moving interface problems

S. Dutta
, J. Glimm
, J. W. Grove
, D. H. Sharp
, Y. Zhang

Applied Mathematics and Statistics

Stony Brook University
Los Alamos National Laboratory
Los Alamos National Laboratory Theoretical Division

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

5 Scopus citations

Abstract

Numerical simulations of a spherical shock refraction have been successfully conducted by a front tracking method. We demonstrate the efficiency of the front tracking algorithm by comparing the L₁-error of spherical simulations by tracked and untracked methods. We find that the tracked algorithm is about 64 (256) times faster than the corresponding method without tracking the interface for a 2d (3d) simulation.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Vipin Kumar, Vipin Kumar, Marina L. Gavrilova, Chih Jeng Kenneth Tan, Chih Jeng Kenneth Tan, Pierre L’Ecuyer
Publisher	Springer Verlag
Pages	782-790
Number of pages	9
ISBN (Print)	354040161X
DOIs	https://doi.org/10.1007/3-540-44843-8_85
State	Published - 2003

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2668
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Access to Document

10.1007/3-540-44843-8_85

Cite this

Dutta, S., Glimm, J., Grove, J. W., Sharp, D. H., & Zhang, Y. (2003). A fast algorithm for moving interface problems. In V. Kumar, V. Kumar, M. L. Gavrilova, C. J. K. Tan, C. J. K. Tan, & P. L’Ecuyer (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 782-790). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2668). Springer Verlag. https://doi.org/10.1007/3-540-44843-8_85

Dutta, S. ; Glimm, J. ; Grove, J. W. et al. / A fast algorithm for moving interface problems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Vipin Kumar ; Vipin Kumar ; Marina L. Gavrilova ; Chih Jeng Kenneth Tan ; Chih Jeng Kenneth Tan ; Pierre L’Ecuyer. Springer Verlag, 2003. pp. 782-790 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{f30438fc7380483c8bd390ee8eb4de26,

title = "A fast algorithm for moving interface problems",

abstract = "Numerical simulations of a spherical shock refraction have been successfully conducted by a front tracking method. We demonstrate the efficiency of the front tracking algorithm by comparing the L1-error of spherical simulations by tracked and untracked methods. We find that the tracked algorithm is about 64 (256) times faster than the corresponding method without tracking the interface for a 2d (3d) simulation.",

author = "S. Dutta and J. Glimm and Grove, \{J. W.\} and Sharp, \{D. H.\} and Y. Zhang",

year = "2003",

doi = "10.1007/3-540-44843-8\_85",

language = "English",

isbn = "354040161X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "782--790",

editor = "Vipin Kumar and Vipin Kumar and Gavrilova, \{Marina L.\} and Tan, \{Chih Jeng Kenneth\} and Tan, \{Chih Jeng Kenneth\} and Pierre L{\textquoteright}Ecuyer",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

Dutta, S, Glimm, J, Grove, JW, Sharp, DH & Zhang, Y 2003, A fast algorithm for moving interface problems. in V Kumar, V Kumar, ML Gavrilova, CJK Tan, CJK Tan & P L’Ecuyer (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2668, Springer Verlag, pp. 782-790. https://doi.org/10.1007/3-540-44843-8_85

A fast algorithm for moving interface problems. / Dutta, S.; Glimm, J.; Grove, J. W. et al.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Vipin Kumar; Vipin Kumar; Marina L. Gavrilova; Chih Jeng Kenneth Tan; Chih Jeng Kenneth Tan; Pierre L’Ecuyer. Springer Verlag, 2003. p. 782-790 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2668).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - A fast algorithm for moving interface problems

AU - Dutta, S.

AU - Glimm, J.

AU - Grove, J. W.

AU - Sharp, D. H.

AU - Zhang, Y.

PY - 2003

Y1 - 2003

N2 - Numerical simulations of a spherical shock refraction have been successfully conducted by a front tracking method. We demonstrate the efficiency of the front tracking algorithm by comparing the L1-error of spherical simulations by tracked and untracked methods. We find that the tracked algorithm is about 64 (256) times faster than the corresponding method without tracking the interface for a 2d (3d) simulation.

AB - Numerical simulations of a spherical shock refraction have been successfully conducted by a front tracking method. We demonstrate the efficiency of the front tracking algorithm by comparing the L1-error of spherical simulations by tracked and untracked methods. We find that the tracked algorithm is about 64 (256) times faster than the corresponding method without tracking the interface for a 2d (3d) simulation.

UR - https://www.scopus.com/pages/publications/35248848892

U2 - 10.1007/3-540-44843-8_85

DO - 10.1007/3-540-44843-8_85

M3 - Chapter

AN - SCOPUS:35248848892

SN - 354040161X

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 782

EP - 790

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Kumar, Vipin

A2 - Gavrilova, Marina L.

A2 - Tan, Chih Jeng Kenneth

A2 - L’Ecuyer, Pierre

PB - Springer Verlag

ER -

Dutta S, Glimm J, Grove JW, Sharp DH, Zhang Y. A fast algorithm for moving interface problems. In Kumar V, Kumar V, Gavrilova ML, Tan CJK, Tan CJK, L’Ecuyer P, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2003. p. 782-790. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44843-8_85

A fast algorithm for moving interface problems

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this