From 58c99600abb8497f143761b08f53b1b83d10671c Mon Sep 17 00:00:00 2001
From: pancetta <pancetta@users.noreply.github.com>
Date: Thu, 29 Feb 2024 07:49:43 +0000
Subject: [PATCH] updated pint.bib using bibbot

---
 _bibliography/pint.bib | 29 +++++++++++++++++++++++++++++
 1 file changed, 29 insertions(+)

diff --git a/_bibliography/pint.bib b/_bibliography/pint.bib
index 1b41f2aa..87b30234 100644
--- a/_bibliography/pint.bib
+++ b/_bibliography/pint.bib
@@ -6932,6 +6932,21 @@ @article{LiEtAl2024
 	year = {2024},
 }
 
+@article{MiaoEtAl2024,
+	author = {Miao, Zhen and null, Bin Wang and Jiang, Yaolin},
+	doi = {10.4208/nmtma.oa-2023-0081},
+	issn = {2079-7338},
+	journal = {Numerical Mathematics: Theory, Methods and Applications},
+	month = {June},
+	number = {1},
+	pages = {121–144},
+	publisher = {Global Science Press},
+	title = {Energy-Preserving Parareal-RKN Algorithms for Hamiltonian Systems},
+	url = {http://dx.doi.org/10.4208/nmtma.oa-2023-0081},
+	volume = {17},
+	year = {2024},
+}
+
 @unpublished{SterckEtAl2024,
 	abstract = {We consider the parallel-in-time solution of scalar nonlinear conservation laws in one spatial dimension. The equations are discretized in space with a conservative finite-volume method using weighted essentially non-oscillatory (WENO) reconstructions, and in time with high-order explicit Runge-Kutta methods. The solution of the global, discretized space-time problem is sought via a nonlinear iteration that uses a novel linearization strategy in cases of non-differentiable equations. Under certain choices of discretization and algorithmic parameters, the nonlinear iteration coincides with Newton's method, although, more generally, it is a preconditioned residual correction scheme. At each nonlinear iteration, the linearized problem takes the form of a certain discretization of a linear conservation law over the space-time domain in question. An approximate parallel-in-time solution of the linearized problem is computed with a single multigrid reduction-in-time (MGRIT) iteration. The MGRIT iteration employs a novel coarse-grid operator that is a modified conservative semi-Lagrangian discretization and generalizes those we have developed previously for non-conservative scalar linear hyperbolic problems. Numerical tests are performed for the inviscid Burgers and Buckley--Leverett equations. For many test problems, the solver converges in just a handful of iterations with convergence rate independent of mesh resolution, including problems with (interacting) shocks and rarefactions.},
 	author = {H. De Sterck and R. D. Falgout and O. A. Krzysik and J. B. Schroder},
@@ -6949,3 +6964,17 @@ @unpublished{ZhaoEtAl2024
 	url = {http://arxiv.org/abs/2401.16113v1},
 	year = {2024},
 }
+
+@article{ZhenEtAl2024,
+	author = {Zhen, Meiyuan and Liu, Xuan and Ding, Xuejun and Cai, Jinsheng},
+	doi = {10.1016/j.cma.2024.116880},
+	issn = {0045-7825},
+	journal = {Computer Methods in Applied Mechanics and Engineering},
+	month = {April},
+	pages = {116880},
+	publisher = {Elsevier BV},
+	title = {High-order space–time parallel computing of the Navier–Stokes equations},
+	url = {http://dx.doi.org/10.1016/j.cma.2024.116880},
+	volume = {423},
+	year = {2024},
+}