.png){kind=icon}
Return
An Efficient Algorithm for Computing the H∞ Norm
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2011.2122750.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This technical note addresses the computation of the H-infinity norm by directly computing the isolated common zeros of two bivariate polynomials, unlike the iteration algorithm that is currently used to find the H-infinity norm. The proposed method to H-infinity norm calculation is compared with the existing method [by Bruinsma and Steinbuch (1990)] using numerical experiments on random transfer functions of orders upto 240; the time taken is better by 15 to 30 times, in addition to improved accuracy. The proposed method uses techniques involving structured linearization of the Bezoutian matrix constructed from two bivariate polynomials.
Keywords:
Behaviors
Bezoutian matrix
dissipativity
H-infinity-norm computation
roots of bivariate polynomials
structured linearization of polynomial matrices
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
Cited Papers
Enantioselective Cyclopropanation of 2‐Cyano‐3‐arylacrylates Using Carbohydrate‐Based Crown Ethers
OAAI
.png){kind=icon}
OAAIShareSaveShareSave
ShareSaveShareSave no more
no more