Greedy Algorithms for High-Dimensional Eigenvalue Problems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Constructive Approximation Année : 2014

Greedy Algorithms for High-Dimensional Eigenvalue Problems

Résumé

In this article, we present two new greedy algorithms for the computation of the lowest eigenvalue (and an associated eigenvector) of a high-dimensional eigenvalue problem, and prove some convergence results for these algorithms and their orthogonalized versions. The performance of our algorithms is illustrated on numerical test cases (including the computation of the buckling modes of a microstructured plate), and compared with that of another greedy algorithm for eigenvalue problems introduced by Ammar and Chinesta.

Dates et versions

hal-00809855 , version 1 (10-04-2013)

Identifiants

Citer

Eric Cancès, Virginie Ehrlacher, Tony Lelièvre. Greedy Algorithms for High-Dimensional Eigenvalue Problems. Constructive Approximation, 2014, 40 (3), pp.387 - 423. ⟨10.1007/s00365-014-9266-y⟩. ⟨hal-00809855⟩
217 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More