Efficient certication of numeric solutions to eigenproblems
Abstract
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.
| Origin | Files produced by the author(s) |
|---|
Loading...