Order reduction of large scale second-order systems using Krylov subspace methods

By Behnam Salimbahrami, Boris Lohmann. 2006

230 citations recorded by the source corpus.

In order reduction of large-scale linear time invariant systems, Krylov subspace methods based on moment matching are among the best choices today. However, in many technical fields, models typically consist of sets of second-order differential equations, and Krylov subspace methods cannot directly be applied. Two methods for solving this problem are presented in this paper: (1) an approach by Su and Craig is generalized and the number of matching moments is increased; (2) a new approach via first-order models is presented, resulting in an even higher number of matching moments. Both solutions preserve the specific structure of the second-order type model.

Subfields: Computational Theory and Mathematics, Numerical Analysis, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/91662085a6fc8a89c94810c603d772daace4eff8

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Tatjana Stykel
  2. Timo Reis
  3. Peter Eberhard
  4. Jörg Fehr
  5. Bernd Simeon
  6. Oliver Weeger
  7. Utz Wever
  8. Jean-Mathieu Mencik

In Numerical Analysis

  1. Peter Eberhard
  2. Jörg Fehr
  3. Bernd Simeon
  4. Oliver Weeger
  5. Utz Wever
  6. Timo Reis
  7. Tatjana Stykel
  8. Peter Benner

In Statistical and Nonlinear Physics

  1. Peter Eberhard
  2. Jörg Fehr
  3. Bernd Simeon
  4. Oliver Weeger
  5. Utz Wever
  6. Tatjana Stykel
  7. Timo Reis
  8. Peter Benner

Citations in the corpus