Sensitivity and computation of a defective eigenvalue

03/04/2021
by   Zhonggang Zeng, et al.
0

A defective eigenvalue is well documented to be hypersensitive to data perturbations and round-off? errors, making it a formidable challenge in numerical computation particularly when the matrix is known through approximate data. This paper establishes a finitely bounded sensitivity of a defective eigenvalue with respect to perturbations that preserve the geometric multiplicity and the smallest Jordan block size. Based on this perturbation theory, numerical computation of a defective eigenvalue is regularized as a well-posed least squares problem so that it can be accurately carried out using floating point arithmetic even if the matrix is perturbed.

READ FULL TEXT
research
03/06/2021

Factorization of the Loewner matrix pencil and its consequences

This paper starts by deriving a factorization of the Loewner matrix penc...
research
06/27/2022

A homogeneous Rayleigh quotient with applications in gradient methods

Given an approximate eigenvector, its (standard) Rayleigh quotient and h...
research
05/25/2021

Backward Error of Matrix Rational Function

We consider a minimal realization of a rational matrix functions. We per...
research
03/08/2021

The numerical factorization of polynomials

Polynomial factorization in conventional sense is an ill-posed problem d...
research
03/06/2021

The numerical greatest common divisor of univariate polynomials

This paper presents a regularization theory for numerical computation of...
research
07/12/2019

Eigenvalues of the non-backtracking operator detached from the bulk

We describe the non-backtracking spectrum of a stochastic block model wi...
research
07/25/2022

Decision-oriented two-parameter Fisher information sensitivity using symplectic decomposition

The eigenvalues and eigenvectors of the Fisher information matrix (FIM) ...

Please sign up or login with your details

Forgot password? Click here to reset