### Wednesday, October 29

## MS1

Numerical Methods for Large Eigenvalue Problems

10:00 AM-12:00 PM

*Room: Ballroom 1 *

The computation of a few eigenvalues and eigenvectors of a large matrix, and the corresponding computation for matrix pencils, arises in many applications in science and engineering. In recent years many new methods that do not require the factorization of a large matrix have been developed. This minisymposium presents an overview of state-of-the-art methods of this kind. Applications and parallel implementation issues will be discussed.

**Organizers: Daniela Calvetti, **

*Stevens Institute of Technology;*

**Lothar Reichel,**

* Kent State University*

**10:00 An Iterative Block Method for Computing a Few Close Eigenvalues of Large Sparse Symmetric Matrix **
*James Baglama*, Kent State University; Daniela Calvetti and Lothar Reichel, Organizers; and A. Ruttan, Kent State University
**10:30 Computing Guided Waves for Optical Fibers**
*Richard Lehoucq*, Argonne National Laboratory; and Lawrence Cowsar, Bell Laboratories, Lucent Technologies
**11:00 An Implicitly Restarted QZ-Like Projection Method for Large Generalized Eigenproblems**
- Danny C. Sorensen, Rice University
**11:30 An Iterative Algorithm for the Partial QZ Reduction of Very Large Generalized Eigenproblems**
- Henk A. van der Vorst, University of Utrecht, The Netherlands

LA97 Homepage | Program Updates|
Registration | Hotel Information | Transportation | Program-at-a-Glance |

*MMD, 5/14/97*

*tjf, 6/13/97*