An Attainable Lower Bound for the Best Normal Approximation
source link: https://epubs.siam.org/doi/10.1137/S0895479892232303
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Related Databases
Web of Science
You must be logged in with an active subscription to view this.Article Data
Publication Data
Lower bounds for the distance of a complex $n \times n$ matrix A from the variety of normal matrices are established. The weaker version gives a lower bound of the form ${\operatorname{dep}} ( A )/\sqrt{n}$, where ${\operatorname{dep}}( A )$ is Henrici’s “departure from normality.” Recall that ${\operatorname{dep}}( A )$ itself is an upper bound for the distance at issue. The tighter bound contains n diagonal sums coming from the Schur form, hence its computational cost is larger; however, it is attainable. The main result is showing this property. To this end some lemmas concerning normal and triangular matrices are needed, and a set of triangular and (closest) normal matrices with properties of independent interest is introduced.
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK