A-stable time discretizations preserve maximal parabolic regularity
Bal\'azs Kov\'acs, Buyang Li, Christian Lubich

TL;DR
This paper proves that A-stable time discretization methods for parabolic problems preserve maximal regularity uniformly across stepsizes, enabling improved error analysis for nonlinear equations without growth restrictions.
Contribution
It establishes that A-stable linear multistep and Runge--Kutta methods maintain maximal regularity uniformly in stepsize, extending known results to higher-order methods and nonlinear problems.
Findings
A-stable methods preserve maximal regularity uniformly in stepsize.
Implicit Euler, Crank-Nicolson, BDF, Radau IIA, and Gauss methods maintain maximal regularity.
Error bounds for nonlinear parabolic equations are derived without growth conditions.
Abstract
It is shown that for a parabolic problem with maximal -regularity (for ), the time discretization by a linear multistep method or Runge--Kutta method has maximal -regularity uniformly in the stepsize if the method is A-stable (and satisfies minor additional conditions). In particular, the implicit Euler method, the Crank-Nicolson method, the second-order backward difference formula (BDF), and the Radau IIA and Gauss Runge--Kutta methods of all orders preserve maximal regularity. The proof uses Weis' characterization of maximal -regularity in terms of -boundedness of the resolvent, a discrete operator-valued Fourier multiplier theorem by Blunck, and generating function techniques that have been familiar in the stability analysis of time discretization methods since the work of Dahlquist. The A()-stable higher-order BDF methods have maximal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
