A fully parallel method for tridiagonal eigenvalue problem (Q1338429): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| (2 intermediate revisions by one other user not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Prabhat Kumar Mahanti / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Prabhat Kumar Mahanti / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 02:59, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully parallel method for tridiagonal eigenvalue problem |
scientific article |
Statements
A fully parallel method for tridiagonal eigenvalue problem (English)
0 references
16 March 1995
0 references
The author develops a fully parallel method for the tridiagonal eigenvalue problem. This method is based on divide-and-conquer and Laguerre iteration. A number of propositions are given with proofs and numerical implementations are performed. It appears that this method is an excellent one for a variety of advanced parallel architectures.
0 references
parallel computation
0 references
divide-and-conquer method
0 references
tridiagonal eigenvalue problem
0 references
Laguerre iteration
0 references
