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, however, any other effective parallel-in-time method could be used in its place. 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.
翻译:本文研究一维空间中标量非线性守恒律的并行时间求解方法。方程在空间上采用保守型有限体积法进行离散,结合加权本质无振荡(WENO)重构技术;在时间上采用高阶显式Runge-Kutta方法。全局离散时空问题的求解通过非线性迭代实现,针对不可微方程提出了一种新颖的线性化策略。在特定离散化方案和算法参数选择下,该非线性迭代等价于牛顿法,但更一般地,它是一种预处理残差校正格式。每次非线性迭代中,线性化问题可表述为对应时空域上线性守恒律的某种离散形式。线性化问题的近似并行时间解通过单次多网格时间缩减(MGRIT)迭代计算,但亦可采用其他有效的并行时间方法替代。MGRIT迭代采用一种新颖的粗网格算子——改进的保守型半拉格朗日离散格式,该算子推广了我们先前针对非保守标量线性双曲问题所发展的方法。数值实验针对无粘性Burgers方程和Buckley-Leverett方程进行。对于多数测试问题,求解器仅需数次迭代即可收敛,且收敛速率与网格分辨率无关,包含存在(相互作用)激波和稀疏波的复杂问题。