CSC main page
About CSC
Research groups
List server


Publications in year 2001 on CSC
  1. F. Dobrian. External Memory Algorithms for Factoring Sparse Matrices. PhD thesis, Old Dominion University, Norfolk, Virginia, USA, 2001.

Articles in journal or book chapters
  1. P. R. Amestoy, I. S. Duff, J.-Y. L'Excellent, and J. Koster. A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM Journal on Matrix Analysis and Applications, 23(1):15-41, 2001.

  2. M. Bollhöfer. A robust ILU with pivoting based on monitoring the growth of the inverse factors. Linear Algebra and its Applications, 338(1--3):201-218, 2001.

  3. R. Bridson and W.-P. Tang. A structural diagnosis of some IC orderings. SIAM Journal on Scientific Computing, 22(5):1527-1532, 2001.

  4. I. S. Duff and J. Koster. On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM Journal on Matrix Analysis and Applications, 22:973-996, 2001.

  5. D. Hysom and A. Pothen. A scalable parallel algorithm for incomplete factor preconditioning. SIAM Journal on Scientific Computing, 22(6):2194-2215, 2001.

  6. J. Schulze. Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods. BIT Numerical Mathematics, 41(4):800-841, 2001.

  7. K. Stüben. A review of algebraic multigrid. Journal of Computational and Applied Mathematics, 128(1--2):281-309, 2001.

Conference articles
  1. Ü. V. Çatalyürek and C. Aykanat. A fine-grain hypergraph model for $2$D decomposition of sparse matrices. In Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS, San Francisco, CA, 2001. Keyword(s): Sparse matrix-vector multiplication, Hypergraph partitioning, Hypergraph model, Communication cost.

  2. P. Heggernes, S. C. Eisenstat, G. Kumfert, and A. Pothen. The computational complexity of the minimum degree algorithm. In Proceedings of NIK 2001---14th Norwegian Computer Science Conference, Tromso, Norway, pages 98-109, 2001.


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