A comparative study of 7 algorithms for model reduction

  • Gugercin S
  • Antoulas A
  • 4

    Readers

    Mendeley users who have this article in their library.
  • N/A

    Citations

    Citations of this article.

Abstract

Compares seven model reduction algorithms by applying them to four different dynamical systems. There are four singular value decomposition (SVD) based methods, and three moment matching based methods. The results illustrate that overall, balanced reduction and approximate balanced reduction are the best when we consider whole frequency range. Moment matching methods always lead to higher error norms than SVD based methods due to their local nature; but they are numerically more efficient. Among them, the rational Krylov algorithm gives the best results

Author-supplied keywords

  • reduced order systems;singular value decomposition

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • S Gugercin

  • A C Antoulas

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free