BACK TO INDEX
Publications of I. S. Duff on CSC
|
-
I. S. Duff,
A. M. Erisman,
and J. K. Reid.
Direct Methods for Sparse Matrices.
Oxford University Press,
London,
1986.
-
I. S. Duff.
Analysis of Sparse Systems.
PhD thesis,
Oxford University,
England,
1972.
Articles in journal or book chapters
|
-
I. S. Duff and S. Pralet.
Strategies for scaling and pivoting for sparse symmetric indefinite problems.
SIAM Journal on Matrix Analysis and Applications,
27(2):313-340,
2005.
-
P. R. Amestoy,
I. S. Duff,
and C. Vömel.
Task scheduling in an asynchronous distributed memory multifrontal solver.
SIAM Journal on Matrix Analysis and Applications,
26(2):544-565,
2004.
-
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.
-
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.
-
P. R. Amestoy,
I. S. Duff,
and J.-Y. L'Excellent.
Multifrontal parallel distributed symmetric and unsymmetric solvers.
Computer methods in applied mechanics and engineering,
184(2--4):501-520,
2000.
-
I. S. Duff and J. Koster.
The design and use of algorithms for permuting large entries to the diagonal of sparse matrices.
SIAM Journal on Matrix Analysis and Applications,
20(4):889-901,
1999.
-
I. S. Duff and H. A. van der Vorst.
Developments and trends in the parallel solution of linear systems.
Parallel Computing,
25(13--14):1931-1970,
1999.
-
T. A. Davis and I. S. Duff.
An unsymmetric-pattern multifrontal method for sparse LU factorization.
SIAM Journal on Matrix Analysis and Applications,
18(1):140-158,
1997.
-
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.
-
J. J. Dongarra,
J. Du Croz,
I. S. Duff,
and S. Hammarling.
A set of level 3 Basic Linear Algebra Subprograms..
ACM Transactions on Mathematical Software,
16:1-17,
1990.
Note: Http://www.netlib.org/blas/blas3-paper.ps.
Keyword(s): BLAS,
Linear algebra.
-
I. S. Duff and G. A. Meurant.
The effect of ordering on preconditioned conjugate gradients.
BIT,
29(4):635-657,
1989.
-
I. S. Duff,
A. M. Erisman,
C. W. Gear,
and J. K. Reid.
Sparsity structure and Gaussian elimination.
SIGNUM Newsletter,
23:2-8,
1988.
-
I. S. Duff and J. K. Reid.
The multifrontal solution of unsymmetric sets of linear equations.
SIAM Journal on Scientific and Statistical Computing,
5(3):633-641,
1984.
-
I. S. Duff and J. K. Reid.
A note on the work involved in no-fill sparse matrix factorization.
IMA Journal on Numerical Analysis,
1:37-40,
1983.
-
I. S. Duff and J. K. Reid.
The multifrontal solution of indefinite sparse symmetric linear equations.
ACM Transactions on Mathematical Software,
9:302-325,
1983.
-
I. S. Duff.
Algorithm 575: Permutations for a zero-free diagonal.
ACM Transactions on Mathematical Software,
7(3):387-390,
1981.
-
I. S. Duff.
On algorithms for obtaining a maximum transversal.
ACM Transactions on Mathematical Software,
7(3):315-330,
1981.
-
I. S. Duff and J. K. Reid.
Algorithm 529: Permutations to block triangular form.
ACM Transactions on Mathematical Software,
4(2):189-192,
1978.
-
I. S. Duff and J. K. Reid.
An implementation of Tarjan's algorithm for the block triangularization of a matrix.
ACM Transactions on Mathematical Software,
4(2):137-147,
1978.
-
I. S. Duff.
On permutations to block triangular form.
Journal of the Institute of Mathematics and its Applications,
19(3):339-342,
1977.
-
I. S. Duff,
A. M. Erisman,
and J. K. Reid.
On George's nested dissection method.
SIAM Journal on Numerical Analysis,
13(5):686-695,
1976.
-
I. S. Duff.
Full matrix techniques in sparse Gaussian elimination.
In G. A. Watson, editor,
Proceedings of 1981 Dundee Biennal Conference on Numerical Analysis,
volume 912 of Lecture Notes in Mathematics,
pages 71-84,
1982.
-
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.
-
I. S. Duff,
D. Ruiz,
and B. Uçar.
Computing a class of bipartite matchings in parallel.
Presentation at SIAM 13th Conference on Parallel Processing for Scientific Computing (PP08), Atlanta, GA, USA,
March 2008.
Keyword(s): Matching.
BACK TO INDEX
Last modified: Wed Jul 21 11:49:20 2010
Author: Bora Uçar.