Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach (Q1077870): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Volker Mehrmann / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Volker Mehrmann / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Some Modified Matrix Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3868672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error analysis of floating-point computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963692564 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:38, 30 July 2024

scientific article
Language Label Description Also known as
English
Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
scientific article

    Statements

    Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach (English)
    0 references
    0 references
    0 references
    1986
    0 references
    For the solution of symmetric tridiagonal eigenvalue problems, a divide- and-conquer approach is presented, that is based on a sequential doubling in the evaluation of the characteristic polynomial and a bisection method. The high accuracy of the method is demonstrated by examples. It would have been very interesting to see a comparison of the method with the algorithm of Cuppen for example in its implementation by Dongarra/Sørensen.
    0 references
    tree algorithms
    0 references
    recursive doubling
    0 references
    symmetric tridiagonal eigenvalue problems
    0 references
    divide-and-conquer
    0 references
    bisection method
    0 references

    Identifiers