Computing semigroups with error control
Matthew J. Colbrook

TL;DR
This paper presents an algorithm for computing strongly continuous semigroups on infinite-dimensional Hilbert spaces with explicit error control, applicable to PDEs and other operators, with demonstrated numerical examples.
Contribution
It introduces a novel algorithm combining functional calculus, contour quadrature, and resolvent computation for error-controlled semigroup evaluation.
Findings
Algorithm achieves error bounds for semigroup computation.
Applicable to PDEs with polynomially bounded coefficients.
Numerical examples demonstrate effectiveness on various equations.
Abstract
We develop an algorithm that computes strongly continuous semigroups on infinite-dimensional Hilbert spaces with explicit error control. Given a generator , a time , an arbitrary initial vector and an error tolerance , the algorithm computes with error bounded by . The algorithm is based on a combination of a regularized functional calculus, suitable contour quadrature rules, and the adaptive computation of resolvents in infinite dimensions. As a particular case, we show that it is possible, even when only allowing pointwise evaluation of coefficients, to compute, with error control, semigroups on the unbounded domain that are generated by partial differential operators with polynomially bounded coefficients of locally bounded total variation. For analytic semigroups (and more general Laplace transform inversion), we…
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.
