8:00 a.m. A projection cutting plane algorithm for convex programming problems. Mordukh E. Primak*, Temple University, Philadelphia
Daniel B. Szyld, Temple University, Philadelphia
(868-65-25)
8:30 a.m. Parallel implementation of the hp-version of the finite element method on a shared-memory architecture. I. Babu\v ska, University of Maryland, College Park
H. C. Elman*, University of Maryland, College Park
K. Markley, Rice University
(868-65-17)
9:00 a.m. Laplace's equation and the Dirichlet-Neumann map in multiply connected domains. A. Greenbaum*, Courant Institute of Mathematical Sciences, New York University
L. Greengard, Courant Institute of Mathematical Sciences, New York University
G. B. McFadden, National Institute of Standards and Technology, Maryland
(868-65-05)
9:30 a.m. Some recent results on Schwarz type domain decomposition algorithms. Olof B. Widlund*, Courant Institute of Mathematical Sciences, New York University
(868-65-10)
1:45 p.m. On the convex hull of projection matrices. Michael L. Overton*, Courant Institute of Mathematical Sciences, New York University
Robert S. Womersley, University of New South Wales, Australia
(868-65-14)
2:15 p.m. Joint stability of two matrices and their joint spectral radius. Gilbert Strang*, Massachusetts Institute of Technology
(868-65-07)
2:45 p.m. Eigenvalues and pseudo-eigenvalues of nonsymmetric random matrices. Lloyd N. Trefethen*, Cornell University
(868-65-20)
3:15 p.m. Updatable, rank-revealing decompositions. G. W. Stewart*, University of Maryland, College Park
(868-65-01)
3:45 p.m. Numerical computation of an analytic, singular value decomposition of a matrix valued function. Angelika Bunse-Gerstner, University of Bielefeld, Germany
Ralph Byers*, University of Kansas
Volker Mehrmann, University of Bielefeld, Germany
Nancy K. Nichols, University of Reading, United Kingdom
(868-65-03)
7:30 a.m. A direct method for solving unstructed sparse linear systems. Carl D. Meyer*, North Carolina State University
(868-65-22)
8:00 a.m. A new implementation of th GMRES method. Lothar Reichel*, University of Kentucky
Z. Bai, University of Kentucky
D. Hu, University of Kentucky
(868-65-08)
8:30 a.m. Asynchronous parallel iterations for solving nonlinear systems. L. Elsner, University of Bielefeld, Germany
I. Koltracht, University of Connecticut, Storrs
M. Neumann*, University of Connecticut, Storrs
(868-65-35)
9:00 a.m. SOR for Markov chain problems. William J. Stewart*, North Carolina State University
(868-65-99)
9:30 a.m. Convergent iterative methods to find stationary distributions of Markov processes. Ivo Marek*, University Karlovy, Czechoslovakia
Daniel B. Szyld, Temple University, Philadelphia
(868-65-26)
1:45 p.m. Modifying the Shougen-Shuquin algorithm for the banded symmetric generalized matrix eigenvalue problem. Linda Kaufman*, AT&T Bell Laboratories, Murray Hill, New Jersey
(868-65-13)
2:15 p.m. Parallel solution of generalized band symmetric eigenvalue problems by sectioning. Ricardo D. Pantazis*, Duke University
(868-65-111)
2:45 p.m. Error analysis of update methods for the symmetric eigenvalue problem. Jesse L. Barlow*, Pennsylvania State University, University Park
(868-65-02)