A Robust Algorithm for Parametric Model Order Reduction Based on Implicit Moment Matching

  • Benner P
  • Feng L
N/ACitations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Parametric model order reduction (PMOR) has received a tremendous amount of attention in recent years. Among the first approaches considered, mainly in system and control theory as well as computational electromagnetics and na- noelectronics, are methods based on multi-moment matching. Despite numerous other successful methods, including the reduced-basis method (RBM), other meth- ods based on (rational, matrix, manifold) interpolation, or Kriging techniques, multi- moment matching methods remain a reliable, robust, and flexible method for model reduction of linear parametric systems. Here we propose a numerically stable algo- rithm for PMOR based on multi-moment matching. Given any number of parame- ters and any number of moments of the parametric system, the algorithm generates a projection matrix for model reduction by implicit moment matching. The imple- mentation of the method based on a repeated modified Gram-Schmidt-like process renders the method numerically stable. The proposed method is simple yet efficient. Numerical experiments show that the proposed algorithm is very accurate.

Cite

CITATION STYLE

APA

Benner, P., & Feng, L. (2014). A Robust Algorithm for Parametric Model Order Reduction Based on Implicit Moment Matching. In Reduced Order Methods for Modeling and Computational Reduction (pp. 159–185). Springer International Publishing. https://doi.org/10.1007/978-3-319-02090-7_6

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