Back to Search
Start Over
Lossless Systems Storage Function: New Results and Numerically Stable and Non-Iterative Computational Methods.
- Source :
- IEEE Transactions on Circuits & Systems. Part I: Regular Papers; Dec2018, Vol. 65 Issue 12, p4349-4362, 14p
- Publication Year :
- 2018
-
Abstract
- In this paper, we formulate and prove new results in the context of storage functions for lossless systems: we use these results to propose new algorithms to compute the storage function. The computation of the storage function for the lossless case is not possible using conventional algebraic Riccati equation-based algorithms, though the storage function itself is well-defined. This is because a certain “regularity condition” on the feedthrough term in the i/s/o representation of the lossless system does not hold. We formulate new results about the storage function matrix for the lossless case and use them to propose non-iterative and stable algorithms to compute the storage function directly from different representations of the given system, namely, a kernel representation, transfer function, and the i/s/o representation of the system. Across the methods, for randomly generated transfer functions, we compare: 1) the computational effort (in flops); 2) the computation time using numerical experiments; and 3) the computational error. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 15498328
- Volume :
- 65
- Issue :
- 12
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Circuits & Systems. Part I: Regular Papers
- Publication Type :
- Periodical
- Accession number :
- 132683332
- Full Text :
- https://doi.org/10.1109/TCSI.2018.2835528