Oblio: Design and performance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3732 LNCS, Issue , 2006, Pages 758-767

  Dobrian, Florin ^a   Pothen, Alex ^a  

^a ECS Building   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DIGITAL LIBRARIES; EQUATIONS OF STATE; PROBLEM SOLVING; SOFTWARE ENGINEERING;

ALGORITHMIC TECHNIQUES; SYMMETRIC LINEAR SYSTEMS;

LINEAR SYSTEMS;

EID: 33745299982     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11558958_92     Document Type: Conference Paper

References (12)

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. C. Ashcraft, R. G. Grimes, and J. G. Lewis. Accurate symmetric indefinite linear equation solvers. SIAM Journal on Matrix Analysis and Applications, 20(2):513-561, 1998.
3. F. Dobrian, G. K. Kumfert, and A. Pothen. The design of sparse direct solvers using object-oriented techniques. In H. P. Langtangen, A. M. Bruaset, and E. Quak, editors, Advances in Software Tools in Scientific Computing, volume 50 of Lecture Notes in Computational Science and Engineering, pages 89-131. Springer-Verlag, 2000.
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(4):973-996, 2001.
5. A. Gupta, M. Joshi, and V. Kumar. WSMP: A high-performance shared- and distributed-memory parallel sparse linear equation solver. Technical Report RC 22038, IBM T.J. Watson Research Center, 2001.
6. G. Karypis and V. Kumar. METIS: Family of multilevel partitioning algorithms. http://www-users.cs.umn.edu/~karypis/metis.
7. X. S. Li and J. W. Demmel. SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems. ACM Transactions on Mathematical Software, 29(2):110-140, 2003.
8. A. Pothen and S. Toledo. Elimination structures in scientific computing. In D. Mehta and S. Sahni, editors, Handbook on Data Structures und Applications, pages 59.1-59.29. CRC Press, 2004.
9. E. Rothberg and R. Schreiber. Efficient methods for out-of-core sparse Cholesky factorization. SIAM Journal on Scientific Computing, 21 (1):129-144, 1999.
10. V. Rotkin and S. Toledo. The design and implementation of a new out-of-core sparse Cholesky factorization method. ACM Transactions on Mathematical Software, 30(1):19-46, 2004.
11. O. Schenk and K. Gärtner. Solving unsymmetric sparse systems of linear equations with PARDISO. Future Generation Computer Systems, 20(3):475-487, 2004.
12. J. A. Scott, Y. Hu, and N. I. M Gould. An evaluation of sparse direct symmetric solvers: an introduction and preliminary findings. Numerical Analysis Internal Report 2004-1, Rutherford Appleton Laboratory, 2004.