Tuesday, July 14

MS24
Numerical Methods for Structured Matrices and Applications (Part I of II)

10:30 AM-12:30 PM
Room: Sidney Smith 2102

Numerous applied mathematical and engineering problems can be formulated in array form, involving large dense structured matrices. Moreover, a particular pattern of structure, e.g., Toeplitz, Hankel, Cauchy, Bezoutian, etc., is usually introduced by a particular physical phenomenon.

Exploiting structure is a well-known topic, however until recently a practical value of the approach has been underestimated, and many results in this direction had a theoretical importance only. In the last couple of years there is an increasing activity in this area; new important classes of applied problems have been addressed in this way, and new approaches to enhance the numerical performance of structure-exploiting algorithms have been suggested.

The purpose of this minisymposium is report a recent progress in the area. The speakers will discuss The talks will cover important applications (image processing, model reduction, circuit simulations, queueing problems), rational interpolation problems (e.g., Nevanlinna-Pick and Nehari problems), ill-posed problems, Markov chains, and numerical issues and implementations.

See Part II, MS29.

10:30 Pivoting for Structured Matrices with Applications

Vadim Olshevsky, Organizer

11:00 Approximation by Structured Lower Rank Matrices

Moody T. Chu and Robert E. Funderlic, North Carolina State University; and Robert J. Plemmons, Wake Forest University

11:30 Superfast Algorithms for Classical and Tangential Nevanlinna-Pick Problems

Vadim Olshevsky, Organizer: and Victor Pan, Lehman College, City University of New York

12:00 Symmetric Cauchy-like Preconditioners for Ill-Posed Problems

Misha E. Kilmer, Northeastern University