Efficient certification of numeric solutions to eigenproblems


In this paper, we present an efficient algorithm for the certification 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.

Authors: Joris van der Hoeven, Bernard Mourrain

Keywords: ball arithmetic, interval arithmetic, reliable computing, computable analysis

View: Html, TeXmacs, Pdf, BibTeX