Results 231 to 240 of about 64,373 (268)
Some of the next articles are maybe not open access.
2007
Eigenvalues and the associated eigenvectors of an endomorphism of a vector space are defined and studied, as is the spectrum of an endomorphism. The characteristic polynomial of a matrix is considered and used to define the characteristic polynomial of the endomorphism of a finitely-generated vector space.
openaire +1 more source
Eigenvalues and the associated eigenvectors of an endomorphism of a vector space are defined and studied, as is the spectrum of an endomorphism. The characteristic polynomial of a matrix is considered and used to define the characteristic polynomial of the endomorphism of a finitely-generated vector space.
openaire +1 more source
A note on unimodular eigenvalues for palindromic eigenvalue problems
International Journal of Computer Mathematics, 2012We consider the occurrence of unimodular eigenvalues for palindromic eigenvalue problems associated with the matrix polynomial where A i *= A n − i with M * ≡ M T, M H or . From the properties of palindromic eigenvalues and their characteristic polynomials, we show that eigenvalues are not generically excluded from the unit circle, thus
Chun-Yueh Chiang +2 more
openaire +1 more source
On the computation of all eigenvalues for the eigenvalue complementarity problem
Journal of Global Optimization, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luís M. Fernandes +3 more
openaire +2 more sources
Bulletin of the London Mathematical Society, 1985
The author proves that an \(n\times n\) matrix A with quaternion entries has a quaternion eigenvalue \(\lambda\) in the sense that \(\lambda\) I-A fails to be invertible.
openaire +2 more sources
The author proves that an \(n\times n\) matrix A with quaternion entries has a quaternion eigenvalue \(\lambda\) in the sense that \(\lambda\) I-A fails to be invertible.
openaire +2 more sources
On Eigenvalues and Annealing Rates
Mathematics of Operations Research, 1988We evaluate asymptotically the eigenvalues of transition rate matrices (Qijϵ)i,j=1n with Qijϵ ∼ exp(−(U(j) − U(i))+/ϵ) for some function U using Ventcel's graphic method. As a consequence, we can compare the “nearly optimal” annealing rate in (Gidas, B. 1985. Global optimization via the Langevin equation. Proc. 24th IEEE Conf. Decision and Control, Ft.
Tzuu-Shuh Chiang, Yunshyong Chow
openaire +1 more source
SIAM Journal on Matrix Analysis and Applications, 1999
A new algorithm for computing the eigenvalues of a narrow-band, nearly tridiagonal upper Hessenberg matrix is introduced. The method called BR algorithm belongs to the family of the QR algorithms. The new method works well in conjuction with the look-ahead Lanczos process: it attempts to exploit and preserve the structure of the auxiliary matrix ...
Geist, G. A. +2 more
openaire +2 more sources
A new algorithm for computing the eigenvalues of a narrow-band, nearly tridiagonal upper Hessenberg matrix is introduced. The method called BR algorithm belongs to the family of the QR algorithms. The new method works well in conjuction with the look-ahead Lanczos process: it attempts to exploit and preserve the structure of the auxiliary matrix ...
Geist, G. A. +2 more
openaire +2 more sources
Isoperimetric Inequalities and Eigenvalues
SIAM Journal on Discrete Mathematics, 1997Summary: An upper bound is given on the minimum distance between \(i\) subsets of same size of a regular graph in terms of the \(i\)th largest eigenvalue in absolute value. This yields a bound on the diameter in terms of the \(i\)th largest eigenvalue for any integer \(i\). Our bounds are shown to be asymptotically tight for explicit families of graphs
openaire +2 more sources
THE DISTRIBUTION OF THE EIGENVALUES IN CERTAIN EIGENVALUE PROBLEMS
The Quarterly Journal of Mathematics, 1964openaire +1 more source
Backward error and condition of polynomial eigenvalue problems
Linear Algebra and Its Applications, 2000Françoise Tisseur
exaly