A new vector field method for eigen-decomposition of symmetric matrices (Q2474357)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new vector field method for eigen-decomposition of symmetric matrices |
scientific article |
Statements
A new vector field method for eigen-decomposition of symmetric matrices (English)
0 references
6 March 2008
0 references
The eigenvalue problem is one of the most researched problems in numerical linear algebra, and over the years several extremely efficient algorithms have been devised, like the QR method, divide-and-conquer approaches, and the Lanczos algorithm. The vector field approach addresses the eigenvalue computation as an optimization problem. Like LP interior point methods, it attempts to construct vector fields on the unit sphere which, although not locally optimal, result in reduced computation. In this paper the authors describe the vector field approach, establish convergence results and complexity bounds and compare the performance of recursive vector field algorithms with that of the power method. The paper concludes with a discussion of the computational results.
0 references
eigenvalue
0 references
algorithms
0 references
QR method
0 references
divide-and-conquer approaches
0 references
Lanczos algorithm
0 references
LP interior point methods
0 references
vector field approach
0 references
convergence
0 references
complexity bounds
0 references
performance
0 references
recursive vector field algorithms
0 references
power method
0 references
numerical examples
0 references