krj@na.toronto.edu (Ken Jackson) (02/22/90)
******************************************************************** | THE INTERNATIONAL LINEAR ALGEBRA SOCIETY ( ILAS ) | | ------------------------------------------------------ | | E-mail Address: MAR23AA @ TECHNION (bitnet) | | --------------------------------------------- | | Edited by Danny Hershkowitz | ==================================================================== 21 February 1990 ------------------------ ILAS-NET Message No. 68 ------------------------ CONTRIBUTED ANNOUNCEMENT: FROM: Richard A. Brualdi SUBJECT: IMA APPLIED LINEAR ALGEBRA YEAR, 1991-1992 -------------------------------------------------- IMA APPLIED LINEAR ALGEBRA YEAR, 1991-1992 The program at the INSTITUTE for MATHEMATICS and its APPLICATIONS (IMA) of the University of Minnesota in Minneapolis for the academic year 1991-1992 will be on APPLIED LINEAR ALGEBRA. The organizing committee consists of: R.A. Brualdi, G. Cybenko, A. George, G. Golub, M.B. Luskin and P. van Dooren. The program for the year is divided into three parts, corresponding to the fall, winter and spring quarters of the academic year. This division is one for reasons of emphasizing various important topics throughout the year. It is expected that there will be considerable fluidity between the various parts. The description of the three parts is: I. (September 1991-December 1991): Discrete Matrix Analysis with emphasis on the mathematical analysis of sparse matrices and combinatorial structure. II. (January 1992-March 1992): Matrix Computatations with special emphasis on iterative methods for solving systems of linear equations and eigenvalue computation of sparse and structured matrices. III. (April 1992-June 1992): Signal Processing, Systems and Control with emphasis on the matrix analysis and computations that arise in this area of application. Senior people who expect sabbaticals from their institutions in 1991-1992 are encouraged to take them at the IMA. For newer Ph.D.s there are 10 postdoctoral fellowships to be given out. The formal announcement of the postdoctoral fellowship program (including application procedures) will be made in September 1991. Confirmed long term visitors thus far are: I. September 1991-December 1991: Ake Bjorck, Richard Brualdi, Shmuel Friedland, Alan George, John Gilbert, Victor Klee, Joseph Liu, Mitchell Luskin. II. January 1991-March 1992: Adam Bojanczyk, Richard Brualdi, James Demmel, Gene Golub, Anne Greenbaum, Nicholas Higham, Mitchell Luskin, Robert Plemmons, G.W. Stewart. III. April 1992-June 1992: Adam Bojanczyk, George Cybenko, James Demmel, Gene Golub, Mitchell Luskin, Robert Plemmons, G.W. Stewart, Paul van Dooren. The preliminary planning stage of four of the six workshops is now complete and descriptions of them follow. There will also be two workshops in part III of the program on Linear Algebra in Signal Processing and Linear Algebra in Control. Announcement of these will be made after the preliminary planning stage is complete. During the year there may also be one or two minisymposia on special topics. Inquiries etc. can be made to Richard Brualdi (brualdi@math.wisc.edu or na.brualdi@na-net.stanford.edu). Postal address is: Mathematics Department, University of Wisconsin, Madison, WI 53706, USA. IMA WORKSHOP: SPARSE MATRIX COMPUTATIONS: GRAPH THEORY ISSUES and ALGORITHMS organized by Alan George and John Gilbert and Joseph Liu October 14-18, 1992 Attempts to solve efficiently very large sparse systems of equations have spawned a multitude of important and interesting problems. Some of these problems are numerical, some are combinatorial, some can be phrased in terms of questions about graphs, and some are "core computer science" questions, involving the design and implementation of good (and sometimes provably optimal) data structures. The purpose of this workshop is to bring together people who work in sparse matrix computation with those who conduct research in applied graph theory and graph algorithms. The intent of the workshop would be to foster active cross-fertilization. Those in sparse matrix computation would have the opportunity to describe some of the outstanding major graph theory questions that are prompted by sparse matrix computation. Equally, those in graph theory would have the opportunity to describe some problems that might be beneficially attacked through the use of modern sparse matrix algorithms and technology. Specific topics will include: chordal graphs, elimination trees, the minimum degree algorithm, graph separator theory and algorithms, finding independent sets, graph matching, simulated annealing, clique trees, graph traversals in sparse matrix computation. IMA WORKSHOP: COMBINATORIAL and GRAPH THEORETIC PROBLEMS in LINEAR ALGEBRA organized by Richard A. Brualdi, Shmuel Friedland and Victor Klee November 11-15, 1991 The purpose of this workshop is to bring together the diverse group of people who work on problems in linear algebra and matrix theory in which combinatorial or graph-theoretic analysis is a major component. Specific topics to be covered include: the use of graph theory and general combinatorial ideas in matrix analysis, eigenvalue estimates for graphs and finite Markov chains, qualitative properties of matrices with applications to chemistry and economics, spectra of nonnegative integral matrices with application to symbolic dynamical systems, matrices with some generic entries with application to systems analysis and controllability, the use of linear algebraic ideas in the graph isomorphism problem, and issues of computational complexity as they pertain to the problems above. IMA WORKSHOP: LINEAR ALGEBRA, MARKOV CHAINS, and QUEUING MODELS organized by James McKenna, Robert J. Plemmons and G.W.Stewart January 13-17, 1992 Markov chains and queuing models are playing an increasing role in the understanding of complex systems such as computer, communication and transportation systems. Three areas are important in the construction and numerical solution of these problems: linear algebra, Markov chains, and queuing network models. The object of this workshop is to bring together experts from these three areas to share their different points of view of the subject. The first two days of the workshop will be devoted to technical surveys by experts, two from each of the three areas. The last three days will be devoted to special topics. All speakers will be asked to furnish a tentative proceedings paper before the workshop. The survey papers will be distributed far enough in advance that the people speaking on special topics can use them in preparing theor papers. There will be an opportunity for the participants to organize informal evening sessions. Among the topics to be treated are 1. Iterative methods for large Markov chains 2. Dealing with the exponential explosion of the state space in queuing networks. 3. Transient behavior 4. Matrix geometric methods IMA WORKSHOP: ITERATIVE METHODS for SPARSE and STRUCTURED PROBLEMS organized by Gene Golub, Anne Greenbaum, and Mitchell Luskin February 24-March 1, 1992 Large systems of matrix equations arise frequently in applications and they have the property that they are sparse and/or structured. Important applications await techniques for solving large nonsymmetric systems of linear equations and eigenvalue problems. The purpose of this workshop is to bring together researchers in numerical analysis and various application areas to discuss where such problems arise and possible methods of solution. Problems involving both convection and dissipation as well as statistical applications lead to nonsymmetric and indefinite linear systems and eigenvalue problems. We intend to explore recent developments in the nonsymmetric Lanczos/Loewy algorithm, domain decomposition and substructuring, conjugate gradient - like methods, preconditioners for nonsymmetric linear systems, and other new ideas in this area. Methods that are particularly efficient on modern computer architectures will be emphasized. SPECIAL The last two days of this workshop will be a celebration dedicated to Gene Golub on the occasion of his sixtieth birthday (Feb. 29, 1992). This program for this part of the workshop is being arranged by Jack Dongarra and Paul van Dooren. --------------------- Reposted by Prof. Kenneth R. Jackson, krj@na.toronto.edu (on Internet, CSNet, Computer Science Dept., ARPAnet, BITNET) University of Toronto, krj@na.utoronto.ca (on CDNnet and other Toronto, Ontario, X.400 nets (Europe)) Canada M5S 1A4 ...!{uunet,pyramid,watmath,ubc-cs}!utai!krj (Phone: 416-978-7075) (on UUCP) (FAX: 416-978-4765)