A conjectured algorithm for determining the modulus of the dominant eigenvalue of an arbitrary square matrix
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...
Saved in:
Main Authors: | Gonzalez, Emmanuel A., Estalilla, Aliento V. |
---|---|
Format: | text |
Published: |
Animo Repository
2007
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/9832 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Similar Items
-
Methods in constructing symmetric and Hermitian matrices with prescribed eigenvalues and eigenvectors
by: Arrienda, Marie Josephine N., et al.
Published: (1993) -
On some inverse eigenvalue problems for Hermitian and generalized Hamiltonian/skew-Hamiltonian matrices
by: Qian, J., et al.
Published: (2016) -
Algorithms of eigenvalues and eigenvectors
by: Atienza, Nelson T., et al.
Published: (1996) -
Computation of derivatives of repeated eigenvalues and the corresponding eigenvectors of symmetric matrix pencils
by: Andrew, A.L., et al.
Published: (2014) -
Computing derivatives of repeated eigenvalues and corresponding eigenvectors of quadratic eigenvalue problems
by: Qian, J., et al.
Published: (2014)