L-Infinity-Norm Computation For Large-Scale Descriptor Systems Using Structured Iterative Eigensolvers

In this article, we discuss a method for computing the L-infinity-norm for transfer functions of descriptor systems using structured iterative eigensolvers. In particular, the algorithm computes some desired imaginary eigenvalues of an even matrix pencil and uses them to determine an upper and lower bound to the L-infinity-norm. Finally, we compare our method to a previously developed algorithm using pseudopole sets. Numerical examples demonstrate the reliability and accuracy of the new method along with a significant drop in the runtime.