A divide and conquer method for unitary and orthogonal eigenproblems (Q920577): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the Spectral Decomposition of Hermitian Matrices Modified by Low Rank Perturbations with Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Divide and Conquer method for the symmetric tridiagonal eigenproblem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The QR algorithm for unitary Hessenberg matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4775345 / rank | |||
Normal rank | |||
Latest revision as of 11:14, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A divide and conquer method for unitary and orthogonal eigenproblems |
scientific article |
Statements
A divide and conquer method for unitary and orthogonal eigenproblems (English)
0 references
1990
0 references
The authors describe a divide and conquer method for a unitary eigenvalue problem which is suitable for implementation on a parallel computer. The simplifications that arise for real orthogonal matrices are also discussed.
0 references
divide and conquer method
0 references
unitary eigenvalue problem
0 references
parallel computer
0 references
orthogonal matrices
0 references
0 references
