BACK TO INDEX
-
J. K. Reid and J. A. Scott.
An efficient out-of-core sparse symmetric indefinite direct solver.
Technical report RAL-TR-2008-024,
Computational Sciences and Engineering Department, Rutherford Appleton Laboratory,
Oxon, OX11 0QX, England,
December 2008.
-
M. W. Gee,
C. M. Siefert,
J. J. Hu,
R. S. Tuminaro,
and M. G. Sala.
ML 5.0 smoothed aggregation user's guide.
Technical report SAND2006-2649,
Sandia National Laboratories,
2006.
-
J. K. Reid and J. A. Scott.
An out-of-core sparse Cholesky solver.
Technical report RAL-TR-2006-013,
Computational Sciences and Engineering Department, Rutherford Appleton Laboratory,
Oxon, OX11 0QX, England,
2006.
-
M. Sala and M. Heroux.
Robust algebraic preconditioners with IFPACK 3.0.
Technical report SAND-0662,
Sandia National Laboratories,
2005.
-
S. Guattery.
Graph embedding techniques for bounding condition numbers of incomplete factor preconditioners.
Technical report ICASE Report No.97-47,
Institute for Computer Applications in Science and Engineering, NASA Langley Research Center,
Hampton, Virginia,
1997.
-
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.
-
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.
-
I. S. Duff and J. K. Reid.
MA27--A set of Fortran subroutines for solving sparse symmetric sets of linear equations.
Technical report AERE R10533,
HMSO,
London, UK,
1982.
-
B. Speelpenning.
The generalized element method.
Technical report UIUCDCS-R-78-946,
Department of Computer Science, University of Illinois at Urbana-Champaign, Illinois,
1978.
BACK TO INDEX
Last modified: Wed Jul 21 11:49:20 2010
Author: Bora Uçar.