Skip to content
naulon
Not checkedNot checked for notices yet.

Riemannian Optimal Model Reduction of Stable Linear Systems

Kazuhiro Sato

IEEE Access · 2019

doi:10.1109/access.2019.2892071 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

In this paper, we develop a method for solving the problem of minimizing the H<sup>2</sup> error norm between the transfer functions of the original and reduced systems on the product set of the set of stable matrices and two Euclidean spaces. That is, we develop a method for identifying the optimal reduced system from all the asymptotically stable linear systems. However, it is difficult to develop an algorithm for solving this problem, because the set of stable matrices is highly non-convex. To overcome this issue, we show that the problem can be transformed into a tractable Riemannian optimization problem on the product manifold of the set of skew-symmetric matrices, the manifold of the symmetric positive-definite matrices, and two Euclidean spaces. The asymptotic stability of the reduced systems constructed using optimal solutions to our problem is preserved. To solve the reduced problem, the Riemannian gradient and Hessian are derived, and a Riemannian trust-region method is developed. The initial point in the proposed approach is selected using the output from the balanced truncation (BT) method. The numerical experiments demonstrate that our method considerably improves the results given by BT and other methods in terms of the H<sup>2</sup> norm and also provides the reduced systems that are globally near-optimal solutions to the problem of minimizing the H<sup>&#x221E;</sup> error norm. Moreover, we show that our method provides a better reduced model than the BT and other methods from the viewpoint of the frequency response.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.