BACK TO INDEX

Publications in year 1996 on CSC

Thesis

1. K. D. Gremban. Combinatorial Preconditioners for Sparse, Symmetric, Diagonally Dominant Linear Systems. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA, 1996.



2. A. Joshi. Topics in Optimization and Sparse Linear Systems. PhD thesis, Department of Computer Science, University of Illinois Urbana-Champaign, Urbana, IL, USA, December 1996.

Articles in journal or book chapters

1. P. R. Amestoy, T. A. Davis, and I. S. Duff. An approximate minimum degree ordering algorithm. SIAM Journal on Matrix Analysis and Applications, 17(4):886-905, 1996. Keyword(s): Sparse matrix ordering, Minimum degree algorithm.



2. M. Benzi, C. D. Meyer, and M. Tůma. A sparse approximate inverse preconditioner for the conjugate gradient method. SIAM Journal on Scientific Computing, 17(5):1135-1149, 1996.



3. M. Olschowka and A. Neumaier. A new pivoting strategy for Gaussian elimination. Linear Algebra and Its Applications, 240:131-151, 1996.

Internal reports

1. C. Ashcraft and J. W. H. Liu. A partition improvement algorithm for generalized nested dissection. Technical report BCSTECH-94-020, Boeing Computer Services, Seattle, WA, USA, 1996.



2. A. Gupta. Fast and effective algorithms for graph partitioning and sparse matrix ordering. Technical report RC 20496 (90799), IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY, USA, 1996.

BACK TO INDEX

---

Last modified: Wed Jul 21 11:49:20 2010
Author: Bora Uçar.