Subspace recycling accelerates the parametric macro‐modeling of MEMS |
| |
Authors: | Lihong Feng Peter Benner Jan G. Korvink |
| |
Affiliation: | 1. Max Planck Institute for Dynamics of Complex Technical Systems, , Magdeburg, Germany;2. Department of Microsystems Engineering (IMTEK) and Freiburg Institute of Advanced Studies (FRIAS), University of Freiburg, , Freiburg, Germany |
| |
Abstract: | A fast computational technique that speeds up the process of parametric macro‐model extraction is proposed. An efficient starting point is the technique of parametric model order reduction (PMOR). The key step in PMOR is the computation of a projection matrix V, which requires the computation of multiple moment matrices of the underlying system. In turn, for each moment matrix, a linear system with multiple right‐hand sides has to be solved. Usually, a considerable number of linear systems must be solved when the system includes more than two free parameters. If the original system is of very large size, the linear solution step is computationally expensive. In this paper, the subspace recycling algorithm outer generalized conjugate residual method combined with generalized minimal residual method with deflated restarting (GCRO‐DR), is considered as a basis to solve the sequence of linear systems. In particular, two more efficient recycling algorithms, G‐DRvar1 and G‐DRvar2, are proposed. Theoretical analysis and simulation results show that both the GCRO‐DR method and its variants G‐DRvar1 and G‐DRvar2 are very efficient when compared with the standard solvers. Furthermore, the presented algorithms overcome the bottleneck of a recently proposed subspace recycling method the modified Krylov recycling generalized minimal residual method. From these subspace recycling algorithms, a PMOR process for macro‐model extraction can be significantly accelerated. Copyright © 2013 John Wiley & Sons, Ltd. |
| |
Keywords: | parametric model order reduction linear system subspace recycling algorithm |
|
|