Discussion Overview
The discussion centers around the question of whether different eigenvector algorithms yield different results, particularly comparing the QL algorithm with implicit shifts from Numerical Recipes to MATLAB's LAPACK routines. Participants also explore the uniqueness of eigenvectors and the implications of algorithmic choices on the results obtained.
Discussion Character
Main Points Raised
- One participant questions if different eigenvector algorithms produce different results, specifically mentioning QL with implicit shifts versus MATLAB's LAPACK routines.
- Another participant states that different eigenvalues correspond to linearly independent eigenvectors, but acknowledges that two linearly independent eigenvectors can correspond to the same eigenvalue.
- A third participant asserts that eigenvectors are not unique and that different algorithmic choices can lead to different sets of eigenvectors, providing an example of scalar multiples of an eigenvector being valid.
- A fourth participant challenges the concept of uniqueness by referencing the identity map, suggesting that any non-zero vector can be considered an eigenvector, thus complicating the notion of uniqueness.
Areas of Agreement / Disagreement
Participants express differing views on the uniqueness of eigenvectors and the impact of algorithmic choices, indicating that the discussion remains unresolved with multiple competing perspectives.
Contextual Notes
Limitations include the lack of specific details on the algorithms mentioned and the potential dependence on definitions of eigenvectors and eigenvalues. The discussion does not resolve the mathematical implications of the claims made.