An Algorithm for Finding Approximate Symbolic Pole/Zero Expressions
The approximate pole/zero expressions are computed starting from the state or the “state-like” matrix. The attempts of open-circuit and short-circuit replacement of circuit elements are combined with those to cut row and column groups of the state matrix for poles or the “state-like” matrix for zeros, and with LR iterations. The expressions of all poles and zeros of a wide-band amplifier and an RLC band-stop filter are computed, obtaining significantly better results than those given by the best approach available, implemented in the Analog Insydes package.
Authors
- Florin Constantinescu
- Alexandru Gabriel Gheorghe
Institutions
- Universitatea Națională de Știință și Tehnologie Politehnica București (RO)
Publication Details
- Journal
- Mathematics
- Published
- 2025-10-17
- DOI
- https://doi.org/10.3390/math13203314
- Primary Topic
- Numerical Methods and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00