On Some Bounds on the Perturbation of Invariant Subspaces of Normal Matrices with Application to a Graph Connection Problem

03/17/2021
by   Subhrajit Bhattacharya, et al.
0

We provide upper bounds on the perturbation of invariant subspaces of normal matrices measured using a metric on the space of vector subspaces of ℂ^n in terms of the spectrum of both the unperturbed & perturbed matrices, as well as, spectrum of the unperturbed matrix only. The results presented give tighter bounds than the Davis-Khan sinΘ theorem. We apply the result to a graph perturbation problem.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 6

page 7

page 8

page 9

page 13

page 16

page 18

page 25

05/20/2019

Uniform bounds for invariant subspace perturbations

For a fixed matrix A and perturbation E we develop purely deterministic ...
01/18/2020

Verified computation of matrix gamma function

Two numerical algorithms are proposed for computing an interval matrix c...
06/25/2020

The Spectrum of the Singular Values of Z-Shaped Graph Matrices

Graph matrices are a type of matrix which appears when analyzing the sum...
07/12/2020

Multiplicative Perturbation Bounds for Multivariate Multiple Linear Regression in Schatten p-Norms

Multivariate multiple linear regression (MMLR), which occurs in a number...
06/10/2021

Multiplicative perturbation bounds for the Generalized block Cholesky downdating problem

The explicit expressions for the strong and the weak rigorous multiplica...
12/28/2019

Scaled Relative Graph of Normal Matrices

The Scaled Relative Graph (SRG) by Ryu, Hannah, and Yin (arXiv:1902.0978...
01/13/2020

Isomorphism Problem Revisited: Information Spectrum Approach

The isomorphism problem in the ergodic theory is revisited from the pers...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.