An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems (Q1358157): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s002110050264 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s002110050264 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005999980 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S002110050264 / rank | |||
Normal rank | |||
Latest revision as of 19:42, 10 December 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
