2000 character limit reached
Infinite-time admissibility under compact perturbations
Published 25 Apr 2019 in math.OC | (1904.11380v1)
Abstract: We investigate the behavior of infinite-time admissibility under compact perturbations. We show, by means of two completely different examples, that infinite-time admissibility is not preserved under compact perturbations $Q$ of the underlying semigroup generator $A$, even if $A$ and $A+Q$ both generate strongly stable semigroups.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.