[BANANA] LAPACK seminar on April 30

[Ming Gu]

               Math 290, Section 16, CS 298, Section 6,
                          Spring 2008
         (Matrix Computations and Scientific Computing)


We meet WEDNESDAYS 11:10 - noon in Room 380 Soda Hall, Berkeley campus.
The coordinators are Profs. J. Demmel (demmel at cs.berkeley.edu), 
M. Gu (mgu at math.berkeley.edu), and B. N. Parlett (parlett at math.berkeley.edu). 
The program will be a mixture of research talks and tutorials.
The tutorials will provide a partial sequel to Math 221.

Date: Apr. 30
Speaker: Ming Gu, UC Berkeley
Title: Distance Problems in Matrix Computations
Abstract: There are a number of well-known distance problems in
matrix computations, including distance to unstability and distance to
uncontrollability. For the same distance problem, the distance  
defined on the field of real numbers can also be different from that 
on the field of complex numbers. Efficient numerical methods for 
computing these distances have been elusive in many cases, especially 
in the field of reals. We show that all these distance problems can be  
reformulated as variations of the same multi-parameter eigenvalue  
problem with 2 to 3 parameters.