Computing the Kreiss constant of a matrix

From MaRDI portal
Publication:5854656

DOI10.1137/19M1275127zbMATH Open1464.65044arXiv1907.06537OpenAlexW3111653800MaRDI QIDQ5854656FDOQ5854656


Authors: Tim Mitchell Edit this on Wikidata


Publication date: 17 March 2021

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Abstract: We establish the first globally convergent algorithms for computing the Kreiss constant of a matrix to arbitrary accuracy. We propose three different iterations for continuous-time Kreiss constants and analogues for discrete-time Kreiss constants. With standard eigensolvers, the methods do mathcalO(n6) work, but we show how this theoretical work complexity can be lowered to mathcalO(n4) on average and mathcalO(n5) in the worst case via divide-and-conquer variants. Finally, locally optimal Kreiss constant approximations can be efficiently obtained for large-scale matrices via optimization.


Full work available at URL: https://arxiv.org/abs/1907.06537




Recommendations




Cites Work


Cited In (6)

Uses Software





This page was built for publication: Computing the Kreiss constant of a matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5854656)