Thursday, May 13

MS30
Numerical Methods for Structured Matrices and Applications

3:45 PM-5:45 PM
Room: Capitol Center

Many problems in sciences and engineering can be reduced to linear algebra problems. Unfortunately, practical circumstances (such as speed, storage, numerical accuracy, amenability to parallel implementations) often make methods unrealistic. Thus, one seeks to identify special structures that can be assumed in order to design more efficient algorithms. Structures is often provided by particular physical properties, giving rise to Toeplitz, Hankel, Vandermonde, Cauchy, or Pick matrices, for example. Until recently, the practical value of this approach has been underestimated and many studies in this direction had only a theoretical importance. In the last several years, there has been a profound increase of activity. In this minisymposium, the speakers will report on recent progress in this area. They will discuss new applications in coding theory, system theory, polynomial root-finding, and superfast algorithms for Toeplitz-like problems.

Organizers: Vadim Olshevsky
Georgia State University
Georg Heinig
Kuwait University, Kuwait

3:45-4:10 Superfast Algorithms for Tangential Confluent Rational Interpolation

Vadim Olshevsky, Organizer; and Amin M. Shokrollahi, Bell Laboratories, Lucent Technologies

4:15-4:40 A Displacement Approach to Decoding Algebraic Codes

Vadim Olshevsky, Organizer; and Amin M. Shokrollahi, Bell Laboratories, Lucent Technologies

4:45-5:10 Fast Matrix-Vector Multiplication for Toeplitz-Like Matrices

Georg Heinig, Organizer; and Karla Rost, Technische Universität Chemnitz, Germany

5:15-5:40 Speed and Accuracy for Tridiagonal Matrix Eigenvalues

Frank D. Uhlig, Auburn University

AN99 Home

Program

Program Updates

Speaker Index

Hotel

Transportation

Registration

LMH, 1/19/99, MMD, 1/26/99