An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems (Q1358157): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: BLAS / rank | |||
Normal rank | |||
Revision as of 13:00, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems |
scientific article |
Statements
An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems (English)
0 references
30 June 1997
0 references
Basically theoretical paper on the subject to determine the eigenvalues of a nonsymmetric matrix \(A\) or of the generalized problem \(A-\lambda B\). An algorithm without matrix inversion is presented, analyzed and compared to other algorithms. Unfortunately there are no numerical experiments on parallel computers.
0 references
parallel computation
0 references
eigenvalues
0 references
algorithm
0 references
