Comparing (Empirical-Gramian-Based) Model Order Reduction Algorithms

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work, the empirical-Gramian-based model reduction methods: Empirical poor man’s truncated balanced realization, empirical approximate balancing, empirical dominant subspaces, empirical balanced truncation, and empirical balanced gains are compared in a non-parametric and in two parametric variants, via ten error measures: Approximate Lebesgue L0, L1, L2, L∞, Hardy H2, H∞, Hankel, Hilbert-Schmidt-Hankel, modified induced primal, and modified induced dual norms, for variants of the thermal block model reduction benchmark. This comparison is conducted via a new meta-measure for model reducibility called MORscore.

Cite

CITATION STYLE

APA

Himpe, C. (2021). Comparing (Empirical-Gramian-Based) Model Order Reduction Algorithms. In International Series of Numerical Mathematics (Vol. 171, pp. 141–164). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-72983-7_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free