AbstractRecently, Psarrakos obtained a lower bound, which depends on a real parameter ν, for the distance between the pseudospectrum of a matrix polynomial and a given point that lies out of it. In this note, we study the best choice of the parameter. As a consequence, the best lower bound among those given by Psarrakos is obtained
A bisection method is used to compute lower and upper bounds on the distance from a quadratic matrix...
A bisection method is used to compute lower and upper bounds on the distance froma quadratic matrix ...
In many applications it is important to sensitivity of eigenvalues of a matrix polynomial polynomial...
AbstractIn this note, we obtain a lower bound for the distance between the pseudospectrum of a matri...
Pseudospectra of matrix polynomials have been systematically investigated in the last years, since t...
Abstract. The pseudospectra of a matrix polynomial P (λ) are sets of complex numbers that are eigenv...
We show that pseudospectra of m-by-n matrices (for m n) have no more than 2m(4m 1) connected compo...
AbstractLet A be a matrix with distinct eigenvalues and let w(A) be the distance from A to the set o...
Definitions and characterizations of pseudospectra are given for rectangular matrix poly-nomials exp...
AbstractDefinitions and characterizations of pseudospectra are given for rectangular matrix poly-nom...
Abstract. We show that 2-norm pseudospectra ofm-by-nmatrices have no more than 2m(4m−1) connected co...
AbstractIn this note, we obtain a lower bound for the distance between the pseudospectrum of a matri...
We propose a method to compute the spectral norm distance from a given matrix A to the set of matric...
Abstract. The -pseudospectrum of a matrix A is the subset of the complex plane consisting of all eig...
AbstractFor two given complex matrices A, B, upper bounds are derived for the optimal matching dista...
A bisection method is used to compute lower and upper bounds on the distance from a quadratic matrix...
A bisection method is used to compute lower and upper bounds on the distance froma quadratic matrix ...
In many applications it is important to sensitivity of eigenvalues of a matrix polynomial polynomial...
AbstractIn this note, we obtain a lower bound for the distance between the pseudospectrum of a matri...
Pseudospectra of matrix polynomials have been systematically investigated in the last years, since t...
Abstract. The pseudospectra of a matrix polynomial P (λ) are sets of complex numbers that are eigenv...
We show that pseudospectra of m-by-n matrices (for m n) have no more than 2m(4m 1) connected compo...
AbstractLet A be a matrix with distinct eigenvalues and let w(A) be the distance from A to the set o...
Definitions and characterizations of pseudospectra are given for rectangular matrix poly-nomials exp...
AbstractDefinitions and characterizations of pseudospectra are given for rectangular matrix poly-nom...
Abstract. We show that 2-norm pseudospectra ofm-by-nmatrices have no more than 2m(4m−1) connected co...
AbstractIn this note, we obtain a lower bound for the distance between the pseudospectrum of a matri...
We propose a method to compute the spectral norm distance from a given matrix A to the set of matric...
Abstract. The -pseudospectrum of a matrix A is the subset of the complex plane consisting of all eig...
AbstractFor two given complex matrices A, B, upper bounds are derived for the optimal matching dista...
A bisection method is used to compute lower and upper bounds on the distance from a quadratic matrix...
A bisection method is used to compute lower and upper bounds on the distance froma quadratic matrix ...
In many applications it is important to sensitivity of eigenvalues of a matrix polynomial polynomial...
DOI
Add to ORKG