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
Reports

On correction equations and domain decomposition for computing invariant subspaces

Abstract : This paper considers a number of schemes for computing an approximate invariant subspace associated with the smallest eigenvalues of a sparse symmetric (real) matrix. The approach taken is that of the so-called ``correction equation'' which leads to such standard schemes as the Jacobi-Davidson method or Olsen's method. We consider the situation of block corrections and discuss two algorithms. The application of the viewpoint that is developed is then explored for Domain Decomposition methods.
Document type :
Reports
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/inria-00070271
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 7:49:54 PM
Last modification on : Thursday, January 20, 2022 - 4:19:52 PM
Long-term archiving on: : Sunday, April 4, 2010 - 8:47:54 PM

Identifiers

  • HAL Id : inria-00070271, version 1

Citation

Bernard Philippe, Yousef Saad. On correction equations and domain decomposition for computing invariant subspaces. [Research Report] RR-5748, INRIA. 2005, pp.26. ⟨inria-00070271⟩

Share

Metrics

Record views

102

Files downloads

109