EUVIMEDEUVIMED entdecken
Crossref

Efficient Solution of Fully Implicit Runge–Kutta Methods for Linear Wave Equations

Aman Rani, Pieter Ghysels, Victoria Howle, Katharine Long, Michal Outrata

SIAM Journal on Scientific Computing · 31.10.2026 · 48 (5) · S183-S206

DOI: 10.1137/24m1677484 ↗

Kurz gefasst

Fachartikel in der Zeitschrift SIAM Journal on Scientific Computing, online erschienen am 11.08.2025. Verfasst von Aman Rani und 4 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 45 Literaturangaben. Gefördert von: DOE, Office of Science, Office of Advanced Scientific Computing Research, Charles University.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We focus on time integration of time-dependent linear hyperbolic PDEs, where implicit Runge–Kutta (IRK) time stepping is an increasingly popular technique. However, this approach gives rise to linear block systems with a Kronecker product structure, involving the Butcher table and the mass and stiffness matrices. Taking the wave equation as the canonical example, the system arising from IRK time stepping is highly ill-conditioned but we can exploit the block structure. If [Formula: see text] is the number of degrees of freedom for the discretization of the Laplace operator, then the resulting system matrix is a block [Formula: see text] matrix where each block is of size [Formula: see text], and [Formula: see text] is the number of IRK stages. We reformulate the large [Formula: see text] block structured linear system as a Sylvester matrix equation. This leads to [Formula: see text] separate systems of order [Formula: see text], and these smaller systems are efficiently handled with the subsolves replaced by a single AMG V-cycle. We demonstrate the effectiveness of our approach on a two-dimensional wave problem. Our experiments show that our approach not only reduces runtime but also requires fewer AMG V-cycles compared to traditional methods. As the number of Runge–Kutta stages increases and the mesh is refined, the Sylvester approach proves to be at least twice as fast as other existing methods, while also requiring fewer AMG V-cycles. We also introduce a block lower triangular preconditioner based on minimization of [Formula: see text] over the lower triangular matrices [Formula: see text] ([Formula: see text] being the Butcher table), which improves on an existing method based on minimization of [Formula: see text].

Förderung

  • DOE, Office of Science, Office of Advanced Scientific Computing Research
  • Charles University

Zitieren

APA

Rani, A., Ghysels, P., Howle, V., Long, K., & Outrata, M. (2026). Efficient Solution of Fully Implicit Runge–Kutta Methods for Linear Wave Equations. SIAM Journal on Scientific Computing, 48(5), S183-S206. https://doi.org/10.1137/24m1677484

Vancouver

Rani A, Ghysels P, Howle V, Long K, Outrata M. Efficient Solution of Fully Implicit Runge–Kutta Methods for Linear Wave Equations. SIAM Journal on Scientific Computing. 2026;48(5):S183-S206. doi:10.1137/24m1677484

BibTeX
@article{Rani2026,
  author = {Rani, Aman and Ghysels, Pieter and Howle, Victoria and Long, Katharine and Outrata, Michal},
  title = {Efficient Solution of Fully Implicit Runge–Kutta Methods for Linear Wave Equations},
  journal = {SIAM Journal on Scientific Computing},
  year = {2026},
  volume = {48},
  number = {5},
  pages = {S183--S206},
  doi = {10.1137/24m1677484}
}
Kostenlos starten →