This IMA Volume in Mathematics and its Applications RECENT ADVANCES IN ITERATIVE METHODS is based on the proceedings of a workshop that was an integral part of the 1991-92 IMA program on "Applied Linear Algebra. " Large systems of matrix equations arise frequently in applications and they have the prop erty that they are sparse and/or structured. The purpose of this workshop was to bring together researchers in numerical analysis and various ap plication areas to discuss where such problems arise and possible meth ods of solution. The last two days of the meeting were a celebration dedicated to Gene Golub on the occasion of his sixtieth birthday, with the program arranged by Jack Dongarra and Paul van Dooren. We are grateful to Richard Brualdi, George Cybenko, Alan George, Gene Golub, Mitchell Luskin, and Paul Van Dooren for planning and implementing the year-long program. We especially thank Gene Golub, Anne Greenbaum, and Mitchell Luskin for organizing this workshop and editing the proceed ings. The financial support of the National Science Foundation and the Min nesota Supercomputer Institute made the workshop possible. A vner Friedman Willard Miller, Jr. xi PREFACE The solution of very large linear algebra problems is an integral part of many scientific computations.

Inhalt
Some Themes in Gene H. Golub's Work on Iterative Methods.- Computing the Sparse Singular Value Decomposition via SVDPACK.- Gaussian Quadrature Applied to Adaptive Chebyshev Iteration.- Ordering Effects on Relaxation Methods Applied to the Discrete Convection-Diffusion Equation.- On the Error Computation for Polynomial Based Iteration Methods.- Transpose-Free Quasi-Minimal Residual Methods for non-Hermitian Linear Systems.- Matrices that Generate the Same Krylov Residual Spaces.- Incomplete Block Factorizations as Preconditioners for Sparse SPD Matrices.- How Fast Can Iterative Methods Be?.- Rational Krylov Algorithms for Nonsymmetric Eigenvalue Problems.- Highly Parallel Preconditioners for General Sparse Matrices.- A Two-Stage Iteration for Solving Nearly Completely Decomposable Markov Chains.- Minimum Residual Modifications to Bi-CG and to the Preconditioner.