Master of Science in Applied Mathematics, University of KwaZulu-Natal, Westville, 2018.Eigenvalues are characteristic of linear operators. Once the spectrum of a matrix is known then its Jordan Canonical form can be determined which simplifies the un- derstanding of the matrix. For large matrices and spectral analysis sometimes it is only necessary to know the eigenvalues of smallest and largest absolute values. Hence we consider various strategies of bounding the spectrum in the complex plane. Such bounds may be numerically improved by various algorithms. The minimal and maximal eigenvalues are crucial to determine the condition number of linear systems
AbstractThe main aim of this note is to suggest a way of selecting the vector aT in a theorem of Bra...
This work introduces the minimax Laplace transform method, a modification of the cumulant-based matr...
AbstractLet A be a matrix of order n × n with real spectrum λ1 ≥ λ2 ≥ ⋯ ≥ λn. Let 1 ≤ k ≤ n − 2. If ...
AbstractWe show how to construct an increasing (decreasing) sequence of lower (upper) bounds for the...
AbstractUpper and lower bounds are derived for the absolute values of the eigenvalues of a matrix po...
This paper provides a listing of techniques used to determine the eigenvalue bounds of a matrix defi...
AbstractWe show how to construct an increasing (decreasing) sequence of lower (upper) bounds for the...
AbstractFor estimating error bound of computed eigenvalues of a matrix, we need more practical pertu...
summary:This paper is concerned with bounds of eigenvalues of a complex matrix. Both lower and upper...
summary:This paper is concerned with bounds of eigenvalues of a complex matrix. Both lower and upper...
Also available via the InternetSIGLEAvailable from British Library Document Supply Centre-DSC:6184.6...
Let G = (V;E) be a simple, undirected graph with maximum and minimum degree ∆ and respectively, and ...
summary:For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue...
These notes are not necessarily an accurate representation of what happened in class. The notes writ...
AbstractSeveral new inequalities are obtained for the modulus, the real part, and the imaginary part...
AbstractThe main aim of this note is to suggest a way of selecting the vector aT in a theorem of Bra...
This work introduces the minimax Laplace transform method, a modification of the cumulant-based matr...
AbstractLet A be a matrix of order n × n with real spectrum λ1 ≥ λ2 ≥ ⋯ ≥ λn. Let 1 ≤ k ≤ n − 2. If ...
AbstractWe show how to construct an increasing (decreasing) sequence of lower (upper) bounds for the...
AbstractUpper and lower bounds are derived for the absolute values of the eigenvalues of a matrix po...
This paper provides a listing of techniques used to determine the eigenvalue bounds of a matrix defi...
AbstractWe show how to construct an increasing (decreasing) sequence of lower (upper) bounds for the...
AbstractFor estimating error bound of computed eigenvalues of a matrix, we need more practical pertu...
summary:This paper is concerned with bounds of eigenvalues of a complex matrix. Both lower and upper...
summary:This paper is concerned with bounds of eigenvalues of a complex matrix. Both lower and upper...
Also available via the InternetSIGLEAvailable from British Library Document Supply Centre-DSC:6184.6...
Let G = (V;E) be a simple, undirected graph with maximum and minimum degree ∆ and respectively, and ...
summary:For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue...
These notes are not necessarily an accurate representation of what happened in class. The notes writ...
AbstractSeveral new inequalities are obtained for the modulus, the real part, and the imaginary part...
AbstractThe main aim of this note is to suggest a way of selecting the vector aT in a theorem of Bra...
This work introduces the minimax Laplace transform method, a modification of the cumulant-based matr...
AbstractLet A be a matrix of order n × n with real spectrum λ1 ≥ λ2 ≥ ⋯ ≥ λn. Let 1 ≤ k ≤ n − 2. If ...