The known formula [ ] ( ) 1 1 / Tr N N λ = A , where A is an n n × Hermitian matrix, 1 λ is its dominant eigenvalue and N is a sufficiently large positive integer, is given the modification ( ) 1 1 / Tr N N λ = A . This modification is conjectured to apply to any n n × matrices, whether Hermitian or not and is converted into an algorithm for obtaining the modulus of the dominant eigenvalue of A . A heuristic basis for the correctness of the latter formula is given. Several numerical examples with graphical representations of their convergences are given, including an unusual case where ongoing steps give alternately the exact value and the successive approximations of the dominant eigenvalue
AbstractThe bounds of the smallest and largest eigenvalues for rank-one modification of the Hermitia...
n fi When computing eigenvalues of symmetric matrices and singular values of general matrices i nite...
AbstractLet A be a real strictly diagonally dominant M-matrix. We give a sharp upper bound for ‖A-1‖...
AbstractIn this paper we give two generalizations of the well-known power method for computing the d...
The largest eigenvalue in magnitude of an n x n matrix is called the dominant eigenvalue. Whenever t...
AbstractWe show that the number of arithmetic operations required to calculate a dominant ε-eigenvec...
AbstractTwo easily computable sequences of bounds on the subdominant modulus of an eigenvalue of a s...
summary:This paper is concerned with bounds of eigenvalues of a complex matrix. Both lower and upper...
AbstractThe permanental-dominance conjecture for positive semidefinite Hermitian matrices A has attr...
This work concerns the global minimization of a prescribed eigenvalue or a weighted sum of prescribe...
The unordered eigenvalues of a Hermitian matrix function depending on one parameter analytically is ...
Abstract. In this paper, we present new algorithms that can replace the diagonal entries of a Hermit...
AbstractOptimization involving eigenvalues arise in many engineering problems. We propose a new algo...
AbstractWe apply a novel approach to approximate within ϵ to all the eigenvalues of an n × n symmetr...
A novel method for computing the minimal eigenvalue of a symmetric positive definite Toeplitz matrix...
AbstractThe bounds of the smallest and largest eigenvalues for rank-one modification of the Hermitia...
n fi When computing eigenvalues of symmetric matrices and singular values of general matrices i nite...
AbstractLet A be a real strictly diagonally dominant M-matrix. We give a sharp upper bound for ‖A-1‖...
AbstractIn this paper we give two generalizations of the well-known power method for computing the d...
The largest eigenvalue in magnitude of an n x n matrix is called the dominant eigenvalue. Whenever t...
AbstractWe show that the number of arithmetic operations required to calculate a dominant ε-eigenvec...
AbstractTwo easily computable sequences of bounds on the subdominant modulus of an eigenvalue of a s...
summary:This paper is concerned with bounds of eigenvalues of a complex matrix. Both lower and upper...
AbstractThe permanental-dominance conjecture for positive semidefinite Hermitian matrices A has attr...
This work concerns the global minimization of a prescribed eigenvalue or a weighted sum of prescribe...
The unordered eigenvalues of a Hermitian matrix function depending on one parameter analytically is ...
Abstract. In this paper, we present new algorithms that can replace the diagonal entries of a Hermit...
AbstractOptimization involving eigenvalues arise in many engineering problems. We propose a new algo...
AbstractWe apply a novel approach to approximate within ϵ to all the eigenvalues of an n × n symmetr...
A novel method for computing the minimal eigenvalue of a symmetric positive definite Toeplitz matrix...
AbstractThe bounds of the smallest and largest eigenvalues for rank-one modification of the Hermitia...
n fi When computing eigenvalues of symmetric matrices and singular values of general matrices i nite...
AbstractLet A be a real strictly diagonally dominant M-matrix. We give a sharp upper bound for ‖A-1‖...
Add to ORKG