AN ADAPTIVE FAST INTERFACE TRACKING METHOD.
Saved in:
| Title: | AN ADAPTIVE FAST INTERFACE TRACKING METHOD. |
|---|---|
| Authors: | Yana Di1 yndi@lsec.cc.ac.cn, Popovic, Jelena2 jelenap@csc.kth.se, Runborg, Olof3 olofr@nada.kth.se |
| Source: | Journal of Computational Mathematics. Nov2015, Vol. 33 Issue 6, p576-586. 11p. |
| Subjects: | Numerical analysis, Multiresolution time-domain method, Approximation error, Runge-Kutta formulas, Data structures |
| Abstract: | An adaptive numerical scheme is developed for the propagation of an interface in a velocity field based on the fast interface tracking method proposed in [2]. A multiresolution stategy to represent the interface instead of point values, allows local grid refinement while controlling the approximation error on the interface. For time integration, we use an explicit Runge-Kutta scheme of second-order with a multiscale time step, which takes longer time steps for finer spatial scales. The implementation of the algorithm uses a dynamic tree data structure to represent data in the computer memory. We briefly review first the main algorithm, describe the essential data structures, highlight the adaptive scheme, and illustrate the computational efficiency by some numerical examples. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Computational Mathematics is the property of Global Science Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 111310721 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: AN ADAPTIVE FAST INTERFACE TRACKING METHOD. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Yana+Di%22">Yana Di</searchLink><relatesTo>1</relatesTo><i> yndi@lsec.cc.ac.cn</i><br /><searchLink fieldCode="AR" term="%22Popovic%2C+Jelena%22">Popovic, Jelena</searchLink><relatesTo>2</relatesTo><i> jelenap@csc.kth.se</i><br /><searchLink fieldCode="AR" term="%22Runborg%2C+Olof%22">Runborg, Olof</searchLink><relatesTo>3</relatesTo><i> olofr@nada.kth.se</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+Computational+Mathematics%22">Journal of Computational Mathematics</searchLink>. Nov2015, Vol. 33 Issue 6, p576-586. 11p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Numerical+analysis%22">Numerical analysis</searchLink><br /><searchLink fieldCode="DE" term="%22Multiresolution+time-domain+method%22">Multiresolution time-domain method</searchLink><br /><searchLink fieldCode="DE" term="%22Approximation+error%22">Approximation error</searchLink><br /><searchLink fieldCode="DE" term="%22Runge-Kutta+formulas%22">Runge-Kutta formulas</searchLink><br /><searchLink fieldCode="DE" term="%22Data+structures%22">Data structures</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: An adaptive numerical scheme is developed for the propagation of an interface in a velocity field based on the fast interface tracking method proposed in [2]. A multiresolution stategy to represent the interface instead of point values, allows local grid refinement while controlling the approximation error on the interface. For time integration, we use an explicit Runge-Kutta scheme of second-order with a multiscale time step, which takes longer time steps for finer spatial scales. The implementation of the algorithm uses a dynamic tree data structure to represent data in the computer memory. We briefly review first the main algorithm, describe the essential data structures, highlight the adaptive scheme, and illustrate the computational efficiency by some numerical examples. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Journal of Computational Mathematics is the property of Global Science Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=111310721 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.4208/jcm.1503-m4532 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 11 StartPage: 576 Subjects: – SubjectFull: Numerical analysis Type: general – SubjectFull: Multiresolution time-domain method Type: general – SubjectFull: Approximation error Type: general – SubjectFull: Runge-Kutta formulas Type: general – SubjectFull: Data structures Type: general Titles: – TitleFull: AN ADAPTIVE FAST INTERFACE TRACKING METHOD. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Yana Di – PersonEntity: Name: NameFull: Popovic, Jelena – PersonEntity: Name: NameFull: Runborg, Olof IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 11 Text: Nov2015 Type: published Y: 2015 Identifiers: – Type: issn-print Value: 02549409 Numbering: – Type: volume Value: 33 – Type: issue Value: 6 Titles: – TitleFull: Journal of Computational Mathematics Type: main |
| ResultId | 1 |
