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

page 6

page 7

page 8

page 9

page 13

page 16

page 18

page 25

research
02/28/2022

Perturbation of invariant subspaces for ill-conditioned eigensystem

Given a diagonalizable matrix A, we study the stability of its invariant...
research
05/20/2019

Uniform bounds for invariant subspace perturbations

For a fixed matrix A and perturbation E we develop purely deterministic ...
research
12/23/2022

Equi-isoclinic subspaces, covers of the complete graph, and complex conference matrices

In 1992, Godsil and Hensel published a ground-breaking study of distance...
research
08/19/2023

The extension of Weyl-type relative perturbation bounds

We extend several relative perturbation bounds to Hermitian matrices tha...
research
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...
research
01/18/2020

Verified computation of matrix gamma function

Two numerical algorithms are proposed for computing an interval matrix c...
research
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...

Please sign up or login with your details

Forgot password? Click here to reset