Balanced realization of Pade approximants of e/sup -sT/
Author:
- J. LamJLJ. Lam
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 36 (9) , 1096-1100
Abstract
An algorithm to calculate the balanced realization of all-pass Pade Approximants of e-sT is presented. The algorithm makes use of a regular C-type continued fraction expansion of e-sT and a properly scaled recurrence formula is used to generate the coefficients of the Pade denominator polynomial. A truncation property of the balanced realization is discussed.link_to_subscribed_fulltexKeywords
This publication has 10 references indexed in Scilit:
- Rational approximation of a class of infinite-dimensional systems II: Optimal convergence rates ofL ∞ approximantsMathematics of Control, Signals, and Systems, 1991
- Routh’s Algorithm: A Centennial SurveySIAM Review, 1977
- Transfer functions of generalized Bessel polynomialsIEEE Transactions on Circuits and Systems, 1977
- Filters using Bessel-type polynomialsIEEE Transactions on Circuits and Systems, 1976
- A modification of the Bessel filterIEEE Transactions on Circuits and Systems, 1975
- A Bessel rational filterIEEE Transactions on Circuits and Systems, 1974
- Low-Pass Filters Approximating-in Modulus and Phase-the Exponential FunctionIEEE Transactions on Circuit Theory, 1966
- Calculation of Quadratic Moments of High-Order Linear Systems via Routh Canonical TransformationIEEE Transactions on Applications and Industry, 1964
- Synthesis of Constant-Time-Delay Ladder Networks Using Bessel PolynomialsProceedings of the IRE, 1954
- Delay networks having maximally flat frequency characteristicsJournal of the Institution of Electrical Engineers, 1949