HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Arnoldi-Faber Method for Large Non Hermitian Eigenvalue Problems

Vincent Heuveline 1 Miloud Sadkane 1
1 ALADIN - Algorithms Adapted to Intensive Numerical Computing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : We propose a restarted Arnoldi's method with Faber polynomials and discuss its use for computing the rightmost eigenvalues of large non hermitian matrices. We illustrate, with the help of some practical test problems, the benefit obtained from the Faber acceleration by comparing this method with the Chebyshev based acceleration.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 1:30:45 PM
Last modification on : Friday, February 4, 2022 - 3:18:44 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:54:53 PM


  • HAL Id : inria-00073688, version 1


Vincent Heuveline, Miloud Sadkane. Arnoldi-Faber Method for Large Non Hermitian Eigenvalue Problems. [Research Report] RR-3007, INRIA. 1996. ⟨inria-00073688⟩



Record views


Files downloads