By Topic

Approximate symbolic pole/zero extraction using equation-based simplification driven by eigenvalue shift prediction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
E. Hennig ; ITWM-Inst. of Ind. Math., Kaiserslautern, Germany ; R. Sommer ; M. Wiese

This paper presents a new approach to symbolic pole/zero analysis of linear electronic circuits using equation-based simplification techniques driven by novel term ranking and error control strategies. Term rankings are determined by using a linear prediction formula to estimate the shifts of the eigenvalues of interest caused by removing terms from a matrix equation. The shift estimations are based on one initial solution of a numerical generalized eigenvalue problem. Error control is achieved by tracking the true eigenvalue shifts numerically. The algorithm allows for the computation of approximated symbolic expressions for selected poles and zeros, including non-dominant ones

Published in:

Circuits and Systems, 1998. ISCAS '98. Proceedings of the 1998 IEEE International Symposium on  (Volume:6 )

Date of Conference:

31 May-3 Jun 1998