2000 character limit reached
Optimal Modal Truncation
Published 24 Sep 2020 in math.OC and math.DS | (2009.11540v1)
Abstract: This paper revisits the modal truncation from an optimisation point of view. In particular, the concept of dominant poles is formulated with respect to different systems norms as the solution of the associated optimal modal truncation problem. The latter is reformulated as an equivalent convex integer or mixed-integer program. Numerical examples highlight the concept and optimisation approach.
Sponsor
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.