Publication

A Subspace Intersection Based Method for Faster Computation of the Storage Function for the Lossless and All-Pass Cases

Kothyari, A., Praagman, C., Belur, M. N. & Pal, D., 2016, Proceedings of the 22nd International Symposium on Mathematical Theory of Networks and Systems. p. 613-619 7 p. ThB06.2

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

The Algebraic Riccati Equation (ARE) cannot be formulated for the conservative/lossless and allpass cases, though the notion of `storage function' is well-defined for these cases too. New properties have been formulated recently about the storage function matrix for this case, which gave rise to new computational procedures. This paper targets improvement of this algorithm by avoiding some key computation intensive steps in minimal polynomial basis computation. We use the Zassenhaus method for basis computation for the sum and intersection of two subspaces. In addition to the conventional Zassenhaus method, for improved numerical accuracy, we propose LU and QR factorization methods with pivoting and compare the results.
Original languageEnglish
Title of host publicationProceedings of the 22nd International Symposium on Mathematical Theory of Networks and Systems
Pages613-619
Number of pages7
ISBN (Electronic)978-1-5323-1358-5
Publication statusPublished - 2016
Event22nd International Symposium on the Mathematical Theory of Networks and Systems - Minneapolis, MN, United States
Duration: 12-Jul-201615-Jul-2016

Conference

Conference22nd International Symposium on the Mathematical Theory of Networks and Systems
CountryUnited States
CityMinneapolis, MN
Period12/07/201615/07/2016

Event

22nd International Symposium on the Mathematical Theory of Networks and Systems

12/07/201615/07/2016

Minneapolis, MN, United States

Event: Conference

    Keywords

  • s: Computational Control, Computations in Systems Theory, Optimal Contro

ID: 35413045