A new iterative scheme for obtaining eigenvectors of large, real- symmetric matrices (Q1122939): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:17, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new iterative scheme for obtaining eigenvectors of large, real- symmetric matrices |
scientific article |
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
