Robust rational function approximation algorithm for model generation
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Model reduction for DC solution of large nonlinear circuits
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Introduction to Linear Optimization
Introduction to Linear Optimization
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Sparse and passive reduction of massively coupled large multiport interconnects
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Stabilizing schemes for piecewise-linear reduced order models via projection and weighting functions
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Model Reduction for Large-Scale Systems with High-Dimensional Parametric Input Space
SIAM Journal on Scientific Computing
$\mathcal{H}_2$ Model Reduction for Large-Scale Linear Dynamical Systems
SIAM Journal on Matrix Analysis and Applications
On orthonormal Muntz-Laguerre filters
IEEE Transactions on Signal Processing
PRIMA: passive reduced-order interconnect macromodeling algorithm
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Guaranteed passive balancing transformations for model order reduction
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
General-Purpose Nonlinear Model-Order Reduction Using Piecewise-Polynomial Representations
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Efficient linear circuit analysis by Pade approximation via the Lanczos process
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
We examine a new method of producing reduced order models for LTI systems which attempts to minimize a bound on the peak error between the original and reduced order models subject to a bound on the peak value of the input. The method, which can be implemented by solving a set of linear programming problems that are parameterized via a single scalar quantity, is able to minimize an error bound subject to a number of moment matching constraints. Moreover, because all optimization is performed in the time domain, the method can also be used to perform model reduction for infinite dimensional systems, rather than being restricted to finite order state space descriptions. We begin by contrasting the method we present here with two classes of standard model reduction algorithms, namely, moment matching algorithms and singular value-based methods. After motivating the class of reduction tools we propose, we describe the algorithm (which minimizes the $L_1$ norm of the difference between the original and reduced order impulse responses) and formulate the corresponding linear programming problem that is solved during each iteration of the algorithm. We then prove that, for a certain class of LTI systems, the method we propose can be used to produce reduced order models of arbitrary accuracy even when the original system is infinite dimensional. We then show how to incorporate moment matching constraints into the basic error bound minimization algorithm, and present three examples which utilize the techniques described herein. We conclude with some comments on extensions to multi-input, multi-output systems, as well as some general comments for future work.