Convergence results on greedy algorithms for high-dimensional eigenvalue problems*
In this paper, we present two greedy algorithms for the computation of the lowest eigenvalue (and an associated eigenvector) of a high-dimensional eigenvalue problem, which have been introduced and analyzed recently in a joint work with Eric Cancès and Tony Lelièvre [1]...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2014-09-01
|
| Series: | ESAIM: Proceedings and Surveys |
| Online Access: | http://dx.doi.org/10.1051/proc/201445015 |