View in EDS

Hybrid massively parallel fast sweeping method for static Hamilton–Jacobi equations.

Saved in:
Bibliographic Details
Title: Hybrid massively parallel fast sweeping method for static Hamilton–Jacobi equations.
Authors: Detrixhe, Miles1,2 mdetrixhe@engineering.ucsb.edu, Gibou, Frédéric1,2,3,4 fgibou@engineering.ucsb.edu
Source: Journal of Computational Physics. Oct2016, Vol. 322, p199-223. 25p.
Subjects: Fast sweeping methods (Mathematics), High performance computing, Jacobi polynomials, Hamilton's equations, Parallel algorithms, Computer architecture
Abstract: The fast sweeping method is a popular algorithm for solving a variety of static Hamilton–Jacobi equations. Fast sweeping algorithms for parallel computing have been developed, but are severely limited. In this work, we present a multilevel, hybrid parallel algorithm that combines the desirable traits of two distinct parallel methods. The fine and coarse grained components of the algorithm take advantage of heterogeneous computer architecture common in high performance computing facilities. We present the algorithm and demonstrate its effectiveness on a set of example problems including optimal control, dynamic games, and seismic wave propagation. We give results for convergence, parallel scaling, and show state-of-the-art speedup values for the fast sweeping method. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Computational Physics is the property of Academic Press Inc. 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 Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 117373655
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Hybrid massively parallel fast sweeping method for static Hamilton–Jacobi equations.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Detrixhe%2C+Miles%22">Detrixhe, Miles</searchLink><relatesTo>1,2</relatesTo><i> mdetrixhe@engineering.ucsb.edu</i><br /><searchLink fieldCode="AR" term="%22Gibou%2C+Frédéric%22">Gibou, Frédéric</searchLink><relatesTo>1,2,3,4</relatesTo><i> fgibou@engineering.ucsb.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Computational+Physics%22">Journal of Computational Physics</searchLink>. Oct2016, Vol. 322, p199-223. 25p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Fast+sweeping+methods+%28Mathematics%29%22">Fast sweeping methods (Mathematics)</searchLink><br /><searchLink fieldCode="DE" term="%22High+performance+computing%22">High performance computing</searchLink><br /><searchLink fieldCode="DE" term="%22Jacobi+polynomials%22">Jacobi polynomials</searchLink><br /><searchLink fieldCode="DE" term="%22Hamilton's+equations%22">Hamilton's equations</searchLink><br /><searchLink fieldCode="DE" term="%22Parallel+algorithms%22">Parallel algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+architecture%22">Computer architecture</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The fast sweeping method is a popular algorithm for solving a variety of static Hamilton–Jacobi equations. Fast sweeping algorithms for parallel computing have been developed, but are severely limited. In this work, we present a multilevel, hybrid parallel algorithm that combines the desirable traits of two distinct parallel methods. The fine and coarse grained components of the algorithm take advantage of heterogeneous computer architecture common in high performance computing facilities. We present the algorithm and demonstrate its effectiveness on a set of example problems including optimal control, dynamic games, and seismic wave propagation. We give results for convergence, parallel scaling, and show state-of-the-art speedup values for the fast sweeping method. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Computational Physics is the property of Academic Press Inc. 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=117373655
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.jcp.2016.06.023
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 25
        StartPage: 199
    Subjects:
      – SubjectFull: Fast sweeping methods (Mathematics)
        Type: general
      – SubjectFull: High performance computing
        Type: general
      – SubjectFull: Jacobi polynomials
        Type: general
      – SubjectFull: Hamilton's equations
        Type: general
      – SubjectFull: Parallel algorithms
        Type: general
      – SubjectFull: Computer architecture
        Type: general
    Titles:
      – TitleFull: Hybrid massively parallel fast sweeping method for static Hamilton–Jacobi equations.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Detrixhe, Miles
      – PersonEntity:
          Name:
            NameFull: Gibou, Frédéric
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 10
              Text: Oct2016
              Type: published
              Y: 2016
          Identifiers:
            – Type: issn-print
              Value: 00219991
          Numbering:
            – Type: volume
              Value: 322
          Titles:
            – TitleFull: Journal of Computational Physics
              Type: main
ResultId 1