AbstractFor two given complex matrices A, B, upper bounds are derived for the optimal matching distance between the spectra σ(A) and σ(B) in terms of ‖A - B2‖, where ‖ ⋅ ‖2 is the spectral norm. The case of arbitrary matrix norms is treated. A similar result estimates the optimal matching distance between the roots of two polynomials. These bounds replace a factor of 4 in earlier results by the value 16(3√3)≈3.08
AbstractIt has been a durable conjecture that the distance (appropriately defined) between the spect...
AbstractIt is shown that for a pair (A,B) of n × n matrices, where the eigenvalues of A lie on a str...
AbstractIt has been a durable conjecture that the distance (appropriately defined) between the spect...
AbstractFor two given complex matrices A, B, upper bounds are derived for the optimal matching dista...
Bhatia R, Elsner L, Krause G. Bounds for the variation of the roots of a polynomial and the eigenval...
We derive some new bounds for the distance between the roots of two polynomials in terms of their co...
AbstractWe derive some new bounds for the distance between the roots of two polynomials in terms of ...
AbstractWe derive some new bounds for the distance between the roots of two polynomials in terms of ...
AbstractWe establish a bound for the spectral variation of two complex n × n matrices A,B in terms o...
AbstractFor a matrix polynomial P(λ) and a given complex number μ, we introduce a (spectral norm) di...
Consider an$n\times n matrix polynomial P(\lambda). An upper bound for a spectral norm distance from...
AbstractUpper bounds for the spectral variation of two regular matrix pairs have been given in [Guox...
In this paper, motivated by a problem posed by Wilkinson, we study the coefficient perturbations of ...
AbstractIn this paper, motivated by a problem posed by Wilkinson, we study the coefficient perturbat...
AbstractSeveral “distances” between the spectra of two matrices are discussed and compared. Optimal ...
AbstractIt has been a durable conjecture that the distance (appropriately defined) between the spect...
AbstractIt is shown that for a pair (A,B) of n × n matrices, where the eigenvalues of A lie on a str...
AbstractIt has been a durable conjecture that the distance (appropriately defined) between the spect...
AbstractFor two given complex matrices A, B, upper bounds are derived for the optimal matching dista...
Bhatia R, Elsner L, Krause G. Bounds for the variation of the roots of a polynomial and the eigenval...
We derive some new bounds for the distance between the roots of two polynomials in terms of their co...
AbstractWe derive some new bounds for the distance between the roots of two polynomials in terms of ...
AbstractWe derive some new bounds for the distance between the roots of two polynomials in terms of ...
AbstractWe establish a bound for the spectral variation of two complex n × n matrices A,B in terms o...
AbstractFor a matrix polynomial P(λ) and a given complex number μ, we introduce a (spectral norm) di...
Consider an$n\times n matrix polynomial P(\lambda). An upper bound for a spectral norm distance from...
AbstractUpper bounds for the spectral variation of two regular matrix pairs have been given in [Guox...
In this paper, motivated by a problem posed by Wilkinson, we study the coefficient perturbations of ...
AbstractIn this paper, motivated by a problem posed by Wilkinson, we study the coefficient perturbat...
AbstractSeveral “distances” between the spectra of two matrices are discussed and compared. Optimal ...
AbstractIt has been a durable conjecture that the distance (appropriately defined) between the spect...
AbstractIt is shown that for a pair (A,B) of n × n matrices, where the eigenvalues of A lie on a str...
AbstractIt has been a durable conjecture that the distance (appropriately defined) between the spect...