Publication

Lossless Systems Storage Function: New Results and Numerically Stable and Non-Iterative Computational Methods

Kothyari, A., Praagman, C. & Belur, M. N., Dec-2018, In : IEEE Transactions on Circuits and Systems I - Regular papers. 65, 12, p. 4349 - 4362 24 p.

Research output: Contribution to journalArticleAcademicpeer-review

APA

Kothyari, A., Praagman, C., & Belur, M. N. (2018). Lossless Systems Storage Function: New Results and Numerically Stable and Non-Iterative Computational Methods. IEEE Transactions on Circuits and Systems I - Regular papers, 65(12), 4349 - 4362. https://doi.org/10.1109/TCSI.2018.2835528

Author

Kothyari, Ashish ; Praagman, Cornelis ; Belur, Madhu N. / Lossless Systems Storage Function : New Results and Numerically Stable and Non-Iterative Computational Methods. In: IEEE Transactions on Circuits and Systems I - Regular papers. 2018 ; Vol. 65, No. 12. pp. 4349 - 4362.

Harvard

Kothyari, A, Praagman, C & Belur, MN 2018, 'Lossless Systems Storage Function: New Results and Numerically Stable and Non-Iterative Computational Methods', IEEE Transactions on Circuits and Systems I - Regular papers, vol. 65, no. 12, pp. 4349 - 4362. https://doi.org/10.1109/TCSI.2018.2835528

Standard

Lossless Systems Storage Function : New Results and Numerically Stable and Non-Iterative Computational Methods. / Kothyari, Ashish; Praagman, Cornelis; Belur, Madhu N.

In: IEEE Transactions on Circuits and Systems I - Regular papers, Vol. 65, No. 12, 12.2018, p. 4349 - 4362.

Research output: Contribution to journalArticleAcademicpeer-review

Vancouver

Kothyari A, Praagman C, Belur MN. Lossless Systems Storage Function: New Results and Numerically Stable and Non-Iterative Computational Methods. IEEE Transactions on Circuits and Systems I - Regular papers. 2018 Dec;65(12):4349 - 4362. https://doi.org/10.1109/TCSI.2018.2835528


BibTeX

@article{95fcbe1d76bc4aadb3462849ede30a50,
title = "Lossless Systems Storage Function: New Results and Numerically Stable and Non-Iterative Computational Methods",
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.",
keywords = "Transfer functions , Kernel , Riccati equations , Springs , Resistance , Transmission line matrix methods , Indexes, Algebraic Riccati equation (ARE), subspace intersection algorithms, Zassenhaus algorithm, QUADRATIC DIFFERENTIAL FORMS",
author = "Ashish Kothyari and Cornelis Praagman and Belur, {Madhu N.}",
year = "2018",
month = "12",
doi = "10.1109/TCSI.2018.2835528",
language = "English",
volume = "65",
pages = "4349 -- 4362",
journal = "IEEE Transactions on Circuits and Systems I - Regular papers",
issn = "1549-8328",
publisher = "IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC",
number = "12",

}

RIS

TY - JOUR

T1 - Lossless Systems Storage Function

T2 - New Results and Numerically Stable and Non-Iterative Computational Methods

AU - Kothyari, Ashish

AU - Praagman, Cornelis

AU - Belur, Madhu N.

PY - 2018/12

Y1 - 2018/12

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

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

KW - Transfer functions , Kernel , Riccati equations , Springs , Resistance , Transmission line matrix methods , Indexes

KW - Algebraic Riccati equation (ARE)

KW - subspace intersection algorithms

KW - Zassenhaus algorithm

KW - QUADRATIC DIFFERENTIAL FORMS

U2 - 10.1109/TCSI.2018.2835528

DO - 10.1109/TCSI.2018.2835528

M3 - Article

VL - 65

SP - 4349

EP - 4362

JO - IEEE Transactions on Circuits and Systems I - Regular papers

JF - IEEE Transactions on Circuits and Systems I - Regular papers

SN - 1549-8328

IS - 12

ER -

ID: 71754593