A fast passivity test for descriptor systems via structure-preserving transformations of Skew-Hamiltonian/Hamiltonian matrix pencils

Authors:
N. Wong;C. K. Chu
Affiliations:
The University of Hong Kong, Hong Kong;The University of Hong Kong, Hong Kong
Venue:
Proceedings of the 43rd annual Design Automation Conference
Year:
2006

Citing 4
Cited 1

The generalized Schur decomposition of an arbitrary pencil A–&lgr;B—robust software with error bounds and applications. Part II: software and applications

ACM Transactions on Mathematical Software (TOMS)
Robust and optimal control

Robust and optimal control
Structure-Preserving Methods for Computing Eigenpairs of Large Sparse Skew-Hamiltonian/Hamiltonian Pencils

SIAM Journal on Scientific Computing
Guaranteed passive balancing transformations for model order reduction

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

An efficient passivity test for descriptor systems via canonical projector techniques

Proceedings of the 46th Annual Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Passivity in a VLSI model is an important property to guarantee stable global simulation. Most VLSI models are naturally described as descriptor systems (DSs) or singular state spaces. Passivity tests for DSs, however, are much less developed compared to their non-singular state space counterparts. For large-scale DSs, the existing test based on linear matrix inequality (LMI) is computationally prohibitive. Other system decoupling techniques involve complicated coding and sometimes ill-conditioned transformations. This paper proposes a simple DS passivity test based on the key insight that the sum of a passive system and its adjoint must be impulse-free. A sidetrack shows that the proper (non-impulsive) part of a passive DS can be easily decoupled along the test flow. Numerical examples confirm the effectiveness of the proposed DS passivity test over conventional approaches.