Verifying Well-Posedness of Linear PDEs using Convex Optimization
Declan S. Jagt, Matthew M. Peet
- Year
- 2026
- Access
- Open access
Abstract
Ensuring that a PDE model is well-posed is a necessary precursor to any form of analysis, control, or numerical simulation. Although the Lumer-Phillips theorem provides necessary and sufficient conditions for well-posedness of dissipative PDEs, these conditions must hold only on the domain of the PDE -- a proper subspace of $L_{2}$ -- which can make them difficult to verify in practice. In this paper, we show how the Lumer-Phillips conditions for PDEs can be tested more conveniently using the equivalent Partial Integral Equation (PIE) representation. This representation introduces a fundamental state in the Hilbert space $L_{2}$ and provides a bijection between this state space and the PDE domain. Using this bijection, we reformulate the Lumer-Phillips conditions as operator inequalities on $L_{2}$. We show how these inequalities can be tested using convex optimization methods, establishing a least upper bound on the exponential growth rate of solutions. We demonstrate the effectiveness of the proposed approach by verifying well-posedness for several classical examples of parabolic and hyperbolic PDEs.
Keywords
Related papers
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Fractional Differential Equations
Igor Podlubný
2025
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
Genetic Programming: On the Programming of Computers by Means of Natural Selection
John R. Koza
1992