Divide-and-conquer eigenvalue algorithm
Divide-and-conquer eigenvalue algorithms are a class of eigenvalue algorithms for Hermitian or real symmetric matrices that have recently (circa 1990s) become competitive in terms of stability and efficiency with more traditional algorithms such as the QR algorithm. The basic concept behind these algorithms is the divide-and-conquer approach from computer science. An eigenvalue problem is divided into two problems of roughly half the size, each of these are solved recursively, and the eigenvalues of the original problem are computed from the results of these smaller problems.
Link from a Wikipage to another Wikipage
primaryTopic
Divide-and-conquer eigenvalue algorithm
Divide-and-conquer eigenvalue algorithms are a class of eigenvalue algorithms for Hermitian or real symmetric matrices that have recently (circa 1990s) become competitive in terms of stability and efficiency with more traditional algorithms such as the QR algorithm. The basic concept behind these algorithms is the divide-and-conquer approach from computer science. An eigenvalue problem is divided into two problems of roughly half the size, each of these are solved recursively, and the eigenvalues of the original problem are computed from the results of these smaller problems.
has abstract
Divide-and-conquer eigenvalue ...... algorithm is not fully stable.
@en
Los algoritmos Divide y Vencer ...... itmo no es plenamente estable.
@es
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
937,463,207
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
Divide-and-conquer eigenvalue ...... lts of these smaller problems.
@en
Los algoritmos Divide y Vencer ...... de los problemas más pequeños.
@es
label
Algoritmo eigenvalue divide y vencerás
@es
Divide-and-conquer eigenvalue algorithm
@en