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

APA

Kothyari, A., Praagman, C., Belur, M. N., & Pal, D. (2016). A Subspace Intersection Based Method for Faster Computation of the Storage Function for the Lossless and All-Pass Cases. In Proceedings of the 22nd International Symposium on Mathematical Theory of Networks and Systems (pp. 613-619). [ThB06.2]

Author

Kothyari, Ashish ; Praagman, Cornelis ; Belur, Madhu N. ; Pal, Debasattam. / A Subspace Intersection Based Method for Faster Computation of the Storage Function for the Lossless and All-Pass Cases. Proceedings of the 22nd International Symposium on Mathematical Theory of Networks and Systems. 2016. pp. 613-619

Harvard

Kothyari, A, Praagman, C, Belur, MN & Pal, D 2016, A Subspace Intersection Based Method for Faster Computation of the Storage Function for the Lossless and All-Pass Cases. in Proceedings of the 22nd International Symposium on Mathematical Theory of Networks and Systems., ThB06.2, pp. 613-619, 22nd International Symposium on the Mathematical Theory of Networks and Systems, Minneapolis, MN, United States, 12/07/2016.

Standard

A Subspace Intersection Based Method for Faster Computation of the Storage Function for the Lossless and All-Pass Cases. / Kothyari, Ashish; Praagman, Cornelis; Belur, Madhu N.; Pal, Debasattam.

Proceedings of the 22nd International Symposium on Mathematical Theory of Networks and Systems. 2016. p. 613-619 ThB06.2.

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

Vancouver

Kothyari A, Praagman C, Belur MN, Pal D. A Subspace Intersection Based Method for Faster Computation of the Storage Function for the Lossless and All-Pass Cases. In Proceedings of the 22nd International Symposium on Mathematical Theory of Networks and Systems. 2016. p. 613-619. ThB06.2


BibTeX

@inproceedings{e414d5ed6c994ea587c75da5a91b57d0,
title = "A Subspace Intersection Based Method for Faster Computation of the Storage Function for the Lossless and All-Pass Cases",
abstract = "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.",
keywords = "s: Computational Control, Computations in Systems Theory, Optimal Contro",
author = "Ashish Kothyari and Cornelis Praagman and Belur, {Madhu N.} and Debasattam Pal",
year = "2016",
language = "English",
pages = "613--619",
booktitle = "Proceedings of the 22nd International Symposium on Mathematical Theory of Networks and Systems",

}

RIS

TY - GEN

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

AU - Kothyari, Ashish

AU - Praagman, Cornelis

AU - Belur, Madhu N.

AU - Pal, Debasattam

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

KW - s: Computational Control, Computations in Systems Theory, Optimal Contro

M3 - Conference contribution

SP - 613

EP - 619

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

ER -

ID: 35413045