bn:00224219n
Noun Concept
Categories: Divide-and-conquer algorithms, Numerical linear algebra
EN
Divide-and-conquer eigenvalue algorithm
EN
Divide-and-conquer eigenvalue algorithms are a class of eigenvalue algorithms for Hermitian or real symmetric matrices that have recently become competitive in terms of stability and efficiency with more traditional algorithms such as the QR algorithm. Wikipedia
Definitions
Relations
Sources
EN
Divide-and-conquer eigenvalue algorithms are a class of eigenvalue algorithms for Hermitian or real symmetric matrices that have recently become competitive in terms of stability and efficiency with more traditional algorithms such as the QR algorithm. Wikipedia