• Corpus ID: 4418900

Stability Analysis of Inexact Solves in Moment Matching based Model Reduction

  title={Stability Analysis of Inexact Solves in Moment Matching based Model Reduction},
  author={Navneet Pratap Singh and Kapil Ahuja},
Recently a new algorithm for model reduction of second order linear dynamical systems with proportional damping, the Adaptive Iterative Rational Global Arnoldi (AIRGA) algorithm (Bonin et. al., 2016), has been proposed. The main computational cost of the AIRGA algorithm is solving a sequence of linear systems. Usually, direct methods (e.g., LU) are used for solving these systems. As model sizes grow, direct methods become prohibitively expensive. Iterative methods (e.g., Krylov) scale well with… 

Figures and Tables from this paper

Inexact Linear Solves in Model Reduction of Bilinear Dynamical Systems
The stability analysis techniques that are proposed here can be extended to many other methods for doing the MOR of bilinear dynamical systems, e.g., using balanced truncation or the ADI methods.
ℋ2 sub-optimal model reduction for second-order network systems
This paper studies a moment matching model reduction method for second-order network systems that achieves moment matching and shows the effectiveness of the proposed method.


Stability Analysis of Bilinear Iterative Rational Krylov Algorithm
Large‐scale topology optimization using preconditioned Krylov subspace methods with recycling
It is shown that a proper rescaling of the linear systems reduces the huge condition numbers that typically occur in topology optimization to roughly those arising for a problem with constant density.
Inexact solves in interpolatory model reduction
A Robust Algorithm for Parametric Model Order Reduction Based on Implicit Moment Matching
This work proposes a numerically stable algorithm for PMOR based on multi-moment matching that generates a projection matrix for model reduction by implicit moment matching.
Approximate Inverse Preconditioners via Sparse-Sparse Iterations
Newton, "global," and column-oriented algorithms, and options for initial guesses, self-preconditioning, and dropping strategies are discussed, and some limited theoretical results on the properties and convergence of approximate inverses are derived.
Recycling BiCGSTAB with an Application to Parametric Model Order Reduction
This work modifications the BiCGSTAB algorithm to use a recycle space, which is built from left and right approximate invariant subspaces, and extends this recycling theory to Bi CGSTAB.
Global FOM and GMRES algorithms for matrix equations
Recycling Krylov Subspaces for Sequences of Linear Systems
This work proposes and analyzes two methods that significantly reduce the total number of matrix-vector products required to solve all systems and can reduce the cost of solving subsequent systems in the sequence by recycling selected subspaces generated for previous systems.
Recycling BiCG with an Application to Model Reduction
Rec recycling BiCG is introduced, a BiCG method that recycles two Krylov subspaces from one pair of dual linear systems to the next pair and builds the foundation for developing recycling variants of other bi-Lanczos based methods, such as CGS, BiCGSTAB, QMR, and TFQMR.