Efficient certication of numeric solutions to eigenproblems
Résumé
In this paper, we present an efficient algorithm for the certication of numeric solutions to eigenproblems. The algorithm relies on a mixture of ball arithmetic, a suitable Newton iteration, and clustering of eigenvalues that are close.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...