Poster Session

The Program Committee plans to give an award to the two best poster presentations.

Iterative Methods for Solving Large, Sparse, and Nonsingular Linear Systems

Changjun Li, Baojia Li, and D.J. Evans, Northeastern University, People's Republic of China

Parallelism in Multifrontal Methods for Matrices with Unsymmetric Structures

Patrick R. Amestoy, ENSEEIHT-IRIT, France; Timothy A. Davis, University of Florida, Gainesville; Iain S. Duff, Rutherford Appleton Laboratory, United Kingdom and CERFACS, France; and Steven M. Hadfield, USAF Academy, Colorado

Computing the Sparse Inverse Subset: An Inverse Multifrontal Approach

Yogin E. Campbell, Old Dominion University; and Timothy A. Davis, University of Florida, Gainesville

A Comparison of the Lanczos and Arnoldi Methods

David Day, Sandia National Laboratories, Albuquerque

Direct Linear Solver for Vector and Parallel Computer

Friedrich Grund, Weierstrass Institute for Applied Analysis and Stochastics, Germany

A Comparison of Grid Orderings

Paul Fischer and Neil Miller, Brown University

New Parallel Algorithms for Solving Tri-Diagonal Systems

Anshul Gupta and Fred Gustavson, IBM T. J. Watson Research Center

Solving Large-Scale Linear Programs by Interior-Point Methods Under the MATLAB Environment

Yin Zhang, University of Maryland, Baltimore County

Experiments with Dsets, a New Storage Scheme for Sparse Matrices

Michel Bercovier and Ami Marowka, The Hebrew University of Jerusalem, Israel

The Disjoint Sets (Dsets), A New Optimal Storage Scheme for Sparse Matrices in Parallel Applications

Arie L. Schlesinger, Hebrew University of Jerusalem, Israel

Correlation Between ILU Ordering and MMD Pre-Ordering

Robert Crone, International Business Machines Corporation, Rochester, Minnesota

Parallel Sparse Triangular Solve on Large Finite Element Calculations

Shi-Pin Ho, National Cheng Kung University, Taiwan, Republic of China

Abstract Data Types for High-Performance Sparse Matrix Computations

Yan Lin, Andrew Lumsdaine, and Kaixiang Zhong, University of Notre Dame

On the Generation and Manipulation of Unstructured Grid Connectivities Using Sparse Matrix Methods

Robert J. Cochran, Mark A. Christon, and Bennie F. Blackwell, Sandia National Laboratories, Albuquerque

LU Factorization of Non-Standard Forms and Direct Multiresolution Solvers

David L. Gines, G. Beylkin, and J. Dunn, University of Colorado, Boulder

Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions

Vladimir Druskin, Schlumberger-Doll Research, Ridgefield, Connecticut and Leonid Knizhnerman, Central Geophysical Expedition, Russia

Sparse Cholesky Factorization and Automatic Differentiation: A Survey of New Applications in Statistics

Stephen P. Smith, EA Engineering, Science, and Technology Lafayette, CA

Back to SM96 Program-at-a-Glance

Registration | Hotel Information | Transportation Information | Speaker Index