AbstractThe spread of a matrix (or polynomial) is the maximum distance between any two of its eigenvalues (or its zeros). E. Deutsch has recently given upper bounds for the spread of matrices and polynomials. We obtain sharper, simpler upper bounds and observe that they are also upper bounds for the sum of the absolute values of the two largest eigenvalues (or zeros)
AbstractIn this paper, motivated by a problem posed by Wilkinson, we study the coefficient perturbat...
AbstractFor a polynomial ƒ and a matrix A we obtain formulas for ƒ(A) and bounds for ∥ƒ(A)∥ which ar...
Best paper awardInternational audienceIn this paper we derive aggregate separation bounds, named aft...
AbstractThe spread of a matrix (polynomial) is defined as the maximum distance between two of its ei...
AbstractThe spread of a matrix (or polynomial) is the maximum distance between any two of its eigenv...
AbstractThe spread of a matrix (polynomial) is defined as the maximum distance between two of its ei...
AbstractIn this paper, we exhibit new and sharper upper bounds of the spread of a matrix
AbstractSome simple lower bounds for the spread of a Hermitian matrix are derived. These bounds are ...
AbstractWe derive some new bounds for the distance between the roots of two polynomials in terms of ...
AbstractUpper and lower bounds are derived for the absolute values of the eigenvalues of a matrix po...
AbstractIn this paper, we exhibit new and sharper upper bounds of the spread of a matrix
AbstractFor two given complex matrices A, B, upper bounds are derived for the optimal matching dista...
AbstractThe spread s(M) of an n×n complex matrix M is s(M)=maxij|λi-λj|, where the maximum is taken ...
AbstractThe permanental spread of a complex square matrix A is defined to be the greatest distance b...
AbstractSeveral new inequalities are obtained for the modulus, the real part, and the imaginary part...
AbstractIn this paper, motivated by a problem posed by Wilkinson, we study the coefficient perturbat...
AbstractFor a polynomial ƒ and a matrix A we obtain formulas for ƒ(A) and bounds for ∥ƒ(A)∥ which ar...
Best paper awardInternational audienceIn this paper we derive aggregate separation bounds, named aft...
AbstractThe spread of a matrix (polynomial) is defined as the maximum distance between two of its ei...
AbstractThe spread of a matrix (or polynomial) is the maximum distance between any two of its eigenv...
AbstractThe spread of a matrix (polynomial) is defined as the maximum distance between two of its ei...
AbstractIn this paper, we exhibit new and sharper upper bounds of the spread of a matrix
AbstractSome simple lower bounds for the spread of a Hermitian matrix are derived. These bounds are ...
AbstractWe derive some new bounds for the distance between the roots of two polynomials in terms of ...
AbstractUpper and lower bounds are derived for the absolute values of the eigenvalues of a matrix po...
AbstractIn this paper, we exhibit new and sharper upper bounds of the spread of a matrix
AbstractFor two given complex matrices A, B, upper bounds are derived for the optimal matching dista...
AbstractThe spread s(M) of an n×n complex matrix M is s(M)=maxij|λi-λj|, where the maximum is taken ...
AbstractThe permanental spread of a complex square matrix A is defined to be the greatest distance b...
AbstractSeveral new inequalities are obtained for the modulus, the real part, and the imaginary part...
AbstractIn this paper, motivated by a problem posed by Wilkinson, we study the coefficient perturbat...
AbstractFor a polynomial ƒ and a matrix A we obtain formulas for ƒ(A) and bounds for ∥ƒ(A)∥ which ar...
Best paper awardInternational audienceIn this paper we derive aggregate separation bounds, named aft...
DOI
Add to ORKG