Reformulating Lumer-Phillips conditions via PIE representation turns well-posedness verification for linear PDEs into convex optimization problems that bound exponential growth rates.
A state-space representation of coupled linear multivariate PDEs and stability analysis using SDP
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AP 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Verifying Well-Posedness of Linear PDEs using Convex Optimization
Reformulating Lumer-Phillips conditions via PIE representation turns well-posedness verification for linear PDEs into convex optimization problems that bound exponential growth rates.