Computing the Kreiss constant of a matrix

DOI10.1137/19M1275127MaRDI QIDQ5854656zbMATH OpenOpenAlexFDO

Authors Tim Mitchell

Publication date 17 March 2021

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

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

zbMATH Keywords

pseudospectratransient growthdiscontinuity of Kreiss constantsdistance to uncontrollability algorithmsinverses of Kronecker sums

Mathematics Subject Classification ID

Matrix exponential and similar functions of matrices (15A16) Numerical computation of matrix exponential and similar matrix functions (65F60)

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(n^6)$ work, but we show how this theoretical work complexity can be lowered to $mathcalO(n^4)$ on average and $mathcalO(n^5)$ 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.

Recommendations

• Optimizing the Kreiss constant
• About the sharpness of the stability estimates in the Kreiss matrix theorem
• Two counterexamples related to the Kreiss matrix theorem
• Sublinear dimension growth in the Kreiss matrix theorem
• On a conjecture by LeVeque and Trefethen related to the Kreiss matrix theorem

Cites work

• scientific article; zbMATH DE number 3676229 (Why is no real title available?)
• scientific article; zbMATH DE number 2166998 (Why is no real title available?)
• scientific article; zbMATH DE number 2212009 (Why is no real title available?)
• A note on the numerical solution of complex Hamiltonian and skew-Hamiltonian eigenvalue problems
• A numerically stable, structure preserving method for computing the eigenvalues of real Hamiltonian or symplectic pencils
• Between controllable and uncontrollable
• Extended and improved criss-cross algorithms for computing the spectral value set abscissa and radius
• Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
• Fast Methods for Estimating the Distance to Uncontrollability
• Generalized Schur methods with condition estimators for solving the generalized Sylvester equation
• Hankel-norm approximation of large-scale descriptor systems
• New Methods for Estimating the Distance to Uncontrollability
• On a conjecture by LeVeque and Trefethen related to the Kreiss matrix theorem
• On eigenvalues of matrices dependent on a parameter
• On the resolvent condition in the Kreiss matrix theorem
• Pseudospectra of matrix pencils for transient analysis of differential-algebraic equations
• Pseudospectral Components and the Distance to Uncontrollability
• Robust stability and a criss-cross algorithm for pseudospectra
• Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
• Subspace methods for computing the pseudospectral abscissa and the stability radius
• Templates for the Solution of Algebraic Eigenvalue Problems
• The solution of the matrix equations \(AXB-CXD=E\) and \((YA-DZ,YC- BZ)=(E,F)\)
• Über Die Stabilitätsdefinition Für Differenzengleichungen Die Partielle Differentialgleichungen Approximieren

Cited in

(6)

• DoD stabilization for non-linear hyperbolic conservation laws on cut cell meshes in one dimension
• Fast Interpolation-Based Globality Certificates for Computing Kreiss Constants and the Distance to Uncontrollability
• Optimizing the Kreiss constant
• Fast computation of \(\mathrm{sep}_\lambda\) via interpolation-based globality certificates
• Convergence Rate Analysis and Improved Iterations for Numerical Radius Computation
• Computing the Additive Degree-Kirchhoff Index with the Laplacian Matrix

Describes a project that uses

Uses Software

• PROPACK
• JDQR
• Chebfun
• Eigtool
• Seigtool
• JDQZ
• MORLAB
• PSAPSR
• ROSTAPACK

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)