Merge pull request #741 from Parallel-in-Time/bibtex-bibbot-740-03fb11b

pint.bib updates

_bibliography/pint.bib

@@ -6279,6 +6279,19 @@ @inproceedings{BarmanEtAl2023
 	year = {2023},
 }
 
+@article{BoltenEtAl2023,
+	author = {Matthias Bolten and Stephanie Friedhoff and Jens Hahne},
+	doi = {10.1016/j.parco.2023.103050},
+	journal = {Parallel Computing},
+	month = {nov},
+	pages = {103050},
+	publisher = {Elsevier {BV}},
+	title = {Task graph-based performance analysis of parallel-in-time methods},
+	url = {https://doi.org/10.1016/j.parco.2023.103050},
+	volume = {118},
+	year = {2023},
+}
+
 @unpublished{BoschEtAl2023,
 	abstract = {Probabilistic numerical solvers for ordinary differential equations (ODEs) treat the numerical simulation of dynamical systems as problems of Bayesian state estimation. Aside from producing posterior distributions over ODE solutions and thereby quantifying the numerical approximation error of the method itself, one less-often noted advantage of this formalism is the algorithmic flexibility gained by formulating numerical simulation in the framework of Bayesian filtering and smoothing. In this paper, we leverage this flexibility and build on the time-parallel formulation of iterated extended Kalman smoothers to formulate a parallel-in-time probabilistic numerical ODE solver. Instead of simulating the dynamical system sequentially in time, as done by current probabilistic solvers, the proposed method processes all time steps in parallel and thereby reduces the span cost from linear to logarithmic in the number of time steps. We demonstrate the effectiveness of our approach on a variety of ODEs and compare it to a range of both classic and probabilistic numerical ODE solvers.},
 	author = {Nathanael Bosch and Adrien Corenflos and Fatemeh Yaghoobi and Filip Tronarp and Philipp Hennig and Simo Särkkä},