A new iterative scheme for obtaining eigenvectors of large, real- symmetric matrices (Q1122939)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4108016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new iterative scheme for obtaining eigenvectors of large, real- symmetric matrices |
scientific article; zbMATH DE number 4108016 |
Statements
A new iterative scheme for obtaining eigenvectors of large, real- symmetric matrices (English)
0 references
1989
0 references
This work is directed towards obtaining an algorithm for matrix eigenvalues that arise from the discretization of self-adjoint partial differential equations. The most time-consuming parts of the proposed algorithm are a matrix multiplication and a Gauss-Seidel relaxation step which are performed on each iteration. The described method represents a reasonable compromise between simplicity, efficiency and robustness; it can handle matrices that exceed the physical memory size without serious performance degradation.
0 references
iterative method
0 references
symmetric matrices
0 references
algorithm
0 references
eigenvalues
0 references
Gauss- Seidel relaxation
0 references
0 references
0.7995174527168274
0 references
0.784713864326477
0 references
0.7803242206573486
0 references
