skip to main content
Department of Computer Science University of Colorado Boulder
cu: home | engineering | mycuinfo | about | cu a-z | search cu | contact cu cs: about | calendar | directory | catalog | schedules | mobile | contact cs
home · events · colloquia · 1999-2000 · 

Colloquium - Stewart


An Arnoldi-Schur Algorithm for Large Eigenproblems
University of Maryland, College Park

Sorensen's iteratively restarted Arnoldi algorithm is one of the most successful and flexible algorithms for finding a few eigenpairs of a large matrix. However, the need to preserve structure of the Arnoldi decomposition on which the algorithm is based restricts the range of transformations that can be performed on it. In consequence, it is difficult to deflate converged Ritz vectors from the decomposition. Moreover, the potential forward instability of the implicit QR algorithm can cause unwanted Ritz vectors to persist in the computation. In this talk we describe a generalized Arnoldi decomposition that solves both problems in a natural and efficient manner.

Joint colloquium with the Department of Applied Mathematics.
Tea will be served from 2:30pm-3:00pm in ECOT 224.

The Department holds colloquia throughout the Fall and Spring semesters. These colloquia, open to the public, are typically held on Thursday afternoons, but sometimes occur at other times as well. If you would like to receive email notification of upcoming colloquia, subscribe to our Colloquia Mailing List. If you would like to schedule a colloquium, see Colloquium Scheduling.

Sign language interpreters are available upon request. Please contact Stephanie Morris at least five days prior to the colloquium.

See also:
Department of Computer Science
College of Engineering and Applied Science
University of Colorado Boulder
Boulder, CO 80309-0430 USA
Send email to

Engineering Center Office Tower
ECOT 717
FAX +1-303-492-2844
XHTML 1.0/CSS2 ©2012 Regents of the University of Colorado
Privacy · Legal · Trademarks
May 5, 2012 (13:29)