• Publications
  • Influence
A set of level 3 basic linear algebra subprograms
TLDR
This paper describes an extension to the set of Basic Linear Algebra Subprograms for matrix-vector operations that should provide efficient and portable implementations of algorithms for high-performance computers. Expand
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
TLDR
In this paper, we analyze the main features and discuss the tuning of the algorithms for the direct solution of sparse linear systems on distributed memory computers developed in the context of a long term European research project. Expand
Direct Methods for Sparse Matrices
The subject of sparse matrices has its roots in such diverse fields as management science, power systems analysis, surveying, circuit theory, and structural analysis. Mathematical models in all theseExpand
An updated set of basic linear algebra subprograms (BLAS)
L. SUSAN BLACKFORD Myricom, Inc. JAMES DEMMEL University of California, Berkeley JACK DONGARRA The University of Tennessee IAIN DUFF Rutherford Appleton Laboratory and CERFACS SVEN HAMMARLINGExpand
An Approximate Minimum Degree Ordering Algorithm
TLDR
An approximate minimum degree (AMD) ordering algorithm for preordering a symmetric sparse matrix prior to numerical factorization is presented. Expand
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
On etend la methode frontale pour resoudre des systemes lineaires d'equations en permettant a plus d'un front d'apparaitre en meme temps
MA57---a code for the solution of sparse symmetric definite and indefinite systems
  • I. Duff
  • Computer Science
  • TOMS
  • 1 June 2004
TLDR
We introduce a new code for the direct solution of sparse symmetric linear equations that solves indefinite systems with 2 × 2 pivoting for stability. Expand
Multifrontal parallel distributed symmetric and unsymmetric solvers
TLDR
We consider the solution of both symmetric and unsymmetric systems of sparse linear equations. Expand
On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
  • I. Duff, J. Koster
  • Mathematics, Computer Science
  • SIAM J. Matrix Anal. Appl.
  • 1 July 2000
TLDR
We consider bipartite matching algorithms for computing permutations of a sparse matrix so that the diagonal of the permuted matrix has entries of large absolute value. Expand
A proposal for a set of level 3 basic linear algebra subprograms
TLDR
This paper describes a proposal for Level 3 Basic Linear Algebra Subprograms (Level 3 BLAS) for matrix-matrix operations. Expand
...
1
2
3
4
5
...