ログイン 新規登録
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 研究報告
  2. ハイパフォーマンスコンピューティング(HPC)
  3. 2021
  4. 2021-HPC-180

An effective parallel-in-time method for explicit time-marching schemes

https://ipsj.ixsq.nii.ac.jp/records/211870
https://ipsj.ixsq.nii.ac.jp/records/211870
41155d66-aaf9-4715-a3bd-99e048538815
名前 / ファイル ライセンス アクション
IPSJ-HPC21180002.pdf IPSJ-HPC21180002.pdf (1.7 MB)
Copyright (c) 2021 by the Information Processing Society of Japan
オープンアクセス
Item type SIG Technical Reports(1)
公開日 2021-07-13
タイトル
タイトル An effective parallel-in-time method for explicit time-marching schemes
タイトル
言語 en
タイトル An effective parallel-in-time method for explicit time-marching schemes
言語
言語 eng
キーワード
主題Scheme Other
主題 数値計算
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_18gh
資源タイプ technical report
著者所属
The University of Tokyo
著者所属
The University of Tokyo
著者所属(英)
en
The University of Tokyo
著者所属(英)
en
The University of Tokyo
著者名 Yen-Chen, Chen

× Yen-Chen, Chen

Yen-Chen, Chen

Search repository
Kengo, Nakajima

× Kengo, Nakajima

Kengo, Nakajima

Search repository
著者名(英) Yen-Chen, Chen

× Yen-Chen, Chen

en Yen-Chen, Chen

Search repository
Kengo, Nakajima

× Kengo, Nakajima

en Kengo, Nakajima

Search repository
論文抄録
内容記述タイプ Other
内容記述 Various parallel-in-time methods have been studied since the year 1964. Methods such as parareal and multigrid reduction in time (MGRIT) have been shown to provide reasonable acceleration to PDE implicit schemes. However, only a few have applied pure explicit schemes. This research introduces a parallel-in-time method optimized for explicit schemes. The proposed method constructs a multiple coarsening layer structure similar to MGRIT and solves the parareal algorithm through coarse to fine layers and the relaxation method is defined to solve across the whole time segment divided by the number of processors. This research conducts numerical experiments for a 1-dimensional advection equation and a 2-dimensional simulation of compressible viscous flow around a circular cylinder, using explicit schemes. The research result shows that the proposed parallel-in-time method could improve the computation efficiency of explicit solvers compared to pure spatial parallelization.
論文抄録(英)
内容記述タイプ Other
内容記述 Various parallel-in-time methods have been studied since the year 1964. Methods such as parareal and multigrid reduction in time (MGRIT) have been shown to provide reasonable acceleration to PDE implicit schemes. However, only a few have applied pure explicit schemes. This research introduces a parallel-in-time method optimized for explicit schemes. The proposed method constructs a multiple coarsening layer structure similar to MGRIT and solves the parareal algorithm through coarse to fine layers and the relaxation method is defined to solve across the whole time segment divided by the number of processors. This research conducts numerical experiments for a 1- dimensional advection equation and a 2-dimensional simulation of compressible viscous flow around a circular cylinder, using explicit schemes. The research result shows that the proposed parallel-in-time method could improve the computation efficiency of explicit solvers compared to pure spatial parallelization.
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AN10463942
書誌情報 研究報告ハイパフォーマンスコンピューティング(HPC)

巻 2021-HPC-180, 号 2, p. 1-8, 発行日 2021-07-13
ISSN
収録物識別子タイプ ISSN
収録物識別子 2188-8841
Notice
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
出版者
言語 ja
出版者 情報処理学会
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-19 17:39:00.134979
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3