BabelNet

bn:00224219n

Noun Concept

No term available

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

Relations

Sources

IS A

eigenwaarde algoritme