AbstractA technique is presented to shift an eigenvalue of a complex matrix. It can be used in the power and inverse power method to accelerate convergence to a single eigenvalue or to eliminate an eigenvalue degeneracy. Error bounds are presented that indicate how the remaining eigenvalues are perturbed with each shift
In this paper, we consider using the inexact Newton-like method for solving the inverse eigenvalue p...
AbstractWe develop the theory of convergence of a generic GR algorithm for the matrix eigenvalue pro...
AbstractTight perturbation bounds are given for the shifts in the eigenvalues and eigenvectors of a ...
AbstractA technique is presented to shift an eigenvalue of a complex matrix. It can be used in the p...
AbstractThe traditional matrix power method converges very slowly when the dominat eigenvalues have ...
Many fields make use of the concepts about eigenvalues in their studies. In engineering, physics, st...
AbstractA new method for computing several largest eigenvalues of a matrix has some common features ...
This paper describes a computational method for improving the accuracy of a given eigenvalue and its...
AbstractIn this paper higher order convergent methods for computing square roots of nonsingular comp...
The subspace iteration method is a very classical method for solving large general eigenvalue proble...
AbstractThe modified power method has been studied by many researchers to calculate the higher eigen...
AbstractA variant of the power method is analyzed, and a geometric description of the orbits is give...
Solution of generalized eigenproblem, K phi = lambda M phi, by the classical inverse iteration metho...
Power method is normally used to determine the largest eigenvalue (in magnitude) and the correspondi...
In this paper we propose a variant of the Rayleigh quotient method to compute an eigenvalue and corr...
In this paper, we consider using the inexact Newton-like method for solving the inverse eigenvalue p...
AbstractWe develop the theory of convergence of a generic GR algorithm for the matrix eigenvalue pro...
AbstractTight perturbation bounds are given for the shifts in the eigenvalues and eigenvectors of a ...
AbstractA technique is presented to shift an eigenvalue of a complex matrix. It can be used in the p...
AbstractThe traditional matrix power method converges very slowly when the dominat eigenvalues have ...
Many fields make use of the concepts about eigenvalues in their studies. In engineering, physics, st...
AbstractA new method for computing several largest eigenvalues of a matrix has some common features ...
This paper describes a computational method for improving the accuracy of a given eigenvalue and its...
AbstractIn this paper higher order convergent methods for computing square roots of nonsingular comp...
The subspace iteration method is a very classical method for solving large general eigenvalue proble...
AbstractThe modified power method has been studied by many researchers to calculate the higher eigen...
AbstractA variant of the power method is analyzed, and a geometric description of the orbits is give...
Solution of generalized eigenproblem, K phi = lambda M phi, by the classical inverse iteration metho...
Power method is normally used to determine the largest eigenvalue (in magnitude) and the correspondi...
In this paper we propose a variant of the Rayleigh quotient method to compute an eigenvalue and corr...
In this paper, we consider using the inexact Newton-like method for solving the inverse eigenvalue p...
AbstractWe develop the theory of convergence of a generic GR algorithm for the matrix eigenvalue pro...
AbstractTight perturbation bounds are given for the shifts in the eigenvalues and eigenvectors of a ...
DOI
Add to ORKG