Papers
Topics
Authors
Recent
Search
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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.