10:00 AM-12:00 PM
Room: Ballroom 2
Among the iterative methods for solving large linear systems or eigenvalue problems with a sparse nonsymmetric matrix, those that are based on the Lanczos process feature low computational cost and low memory requirements.In the last ten years much progress has been made regarding new, faster converging algorithms, avoiding breakdowns by look-ahead, understanding other stability problems, and taking appropriate measure to avoid or reduce them. New related results for the symmetric case are also of high relevance. In this minisymposium, the speakers will present some of the most recent findings. The presentations should be of interest to a wide audience of people applying or investigating iterative methods.
Organizer: Martin H. Gutknecht
These abstracts are posted as PostScript files at http://www.scsc.ethz.ch/~mhg/SIAM-ALAabstr.ps
LA97 Homepage | Program Updates| Registration | Hotel Information | Transportation | Program-at-a-Glance |