Symbolic matrix inversion with application to electronic circuits
- 1 January 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 35 (2) , 235-238
- https://doi.org/10.1109/31.1727
Abstract
Summary:A theoretically attractive and computationally fast algorithm is presented for the determination of the coefficients of the determinantal polynomial and the coefficients of the adjoint polynomial matrix of a given three-dimensional (3–D) state space model of Fornasini–Marchesini type. The algorithm uses the discrete Fourier transform (DFT) and can be easily implemented on a digital computerKeywords
This publication has 5 references indexed in Scilit:
- Symbolic network function generation via discrete Fourier transformIEEE Transactions on Circuits and Systems, 1984
- An algorithm for inverting polynomial matricesInternational Journal of Control, 1979
- FFT calculation of a determinantal polynomialIEEE Transactions on Automatic Control, 1976
- A simple method to determine the characteristic functionf(lambda) = |lambda I - A|by discrete Fourier series and fast Fourier transformIEEE Transactions on Circuits and Systems, 1976
- A survey of applications of symbolic network functionsIEEE Transactions on Circuit Theory, 1973