Skip to search formSkip to main contentSkip to account menu

Divide-and-conquer eigenvalue algorithm

Known as: Divide 
Divide-and-conquer eigenvalue algorithms are a class of eigenvalue algorithms for Hermitian or real symmetric matrices that have recently (circa… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
Arnoldi iterationComputational complexity theoryComputer scienceEigenvalue algorithm

Broader (1)

Numerical linear algebra

Search for papers about Divide-and-conquer eigenvalue algorithm

Search papers
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)