A Divide and Conquer method for the symmetric tridiagonal eigenproblem (Q1138346): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Rank-one modification of the symmetric eigenproblem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Modified Matrix Eigenvalue Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5591853 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5674306 / rank | |||
Normal rank | |||
Revision as of 03:42, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Divide and Conquer method for the symmetric tridiagonal eigenproblem |
scientific article |
Statements
A Divide and Conquer method for the symmetric tridiagonal eigenproblem (English)
0 references
1981
0 references
Divide and Conquer method
0 references
symmetric tridiagonal eigenproblem
0 references
