Skip to content

Commit d69a96e

Browse files
authored
Merge pull request #915 from Parallel-in-Time/bibtex-bibbot-914-c102187
pint.bib updates
2 parents c102187 + 4a1d9f0 commit d69a96e

File tree

1 file changed

+14
-0
lines changed

1 file changed

+14
-0
lines changed

_bibliography/pint.bib

Lines changed: 14 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -7698,6 +7698,20 @@ @article{PeterssonEtAl2025
76987698
year = {2025},
76997699
}
77007700

7701+
@article{StumpEtAl2025,
7702+
author = {Stump, Benjamin C. and Arndt, Daniel and Rolchigo, Matt and Reeve, Samuel Temple},
7703+
doi = {10.1016/j.commatsci.2025.113684},
7704+
issn = {0927-0256},
7705+
journal = {Computational Materials Science},
7706+
month = {March},
7707+
pages = {113684},
7708+
publisher = {Elsevier BV},
7709+
title = {Toucan: A performance portable, scalable implementation of the DECA algorithm},
7710+
url = {http://dx.doi.org/10.1016/j.commatsci.2025.113684},
7711+
volume = {251},
7712+
year = {2025},
7713+
}
7714+
77017715
@unpublished{WangEtAl2025,
77027716
abstract = {This paper analyzes the SParareal algorithm for stochastic differential equations (SDEs). Compared to the classical Parareal algorithm, the SParareal algorithm accelerates convergence by introducing stochastic perturbations, achieving linear convergence over unbounded time intervals. We first revisit the classical Parareal algorithm and stochastic Parareal algorithm. Then we investigate mean-square stability of the SParareal algorithm based on the stochastic $\theta$-method for SDEs, deriving linear error bounds under four sampling rules. Numerical experiments demonstrate the superiority of the SParareal algorithm in solving both linear and nonlinear SDEs, reducing the number of iterations required compared to the classical Parareal algorithm.},
77037717
author = {Huanxin Wang and Junhan Lyu and Zicheng Peng and Min Li},

0 commit comments

Comments
 (0)