Approximation of arbitrarily high-order PDEs by first-order hyperbolic relaxation
David I. Ketcheson, Abhijit Biswas
TL;DR
The paper tackles the problem of approximating arbitrarily high-order evolution PDEs by first-order hyperbolic relaxation, enabling causal, efficiently solvable reformulations. It develops a general construction that introduces auxiliary variables and uses a signed permutation to enforce consistency between the auxiliary constraints, proving a unique stable hyperbolization for linear scalar high-order PDEs and establishing convergence to the original equation as the relaxation time $\tau \to 0$. The authors prove a Fourier-space convergence result with an $O(\tau)$ error, and extend the approach to nonlinear equations including the nonlinear Schrödinger equation, Camassa–Holm, and Kuramoto–Sivashinsky, demonstrating numerical convergence in representative examples. This work broadens the applicability of hyperbolic relaxation, offering a unified methodology to transform complex high-order models into tractable, causally consistent hyperbolic systems with potential computational and analytical advantages.
Abstract
We present a framework for constructing a first-order hyperbolic system whose solution approximates that of a desired higher-order evolution equation. Constructions of this kind have received increasing interest in recent years, and are potentially useful as either analytical or computational tools for understanding the corresponding higher-order equation. We perform a systematic analysis of a family of linear model equations and show that for each member of this family there is a stable hyperbolic approximation whose solution converges to that of the model equation in a certain limit. We then show through several examples that this approach can be applied successfully to a very wide range of nonlinear PDEs of practical interest.
