BACK TO INDEX
Publications of A. Pothen on CSC


A. Pothen.
Sparse Null Bases and Marriage Theorems.
PhD thesis,
Department of Computer Science, Cornell University, Ithaca, New York,
1984.
Articles in journal or book chapters


A. H. Gebremedhin,
F. Manne,
and A. Pothen.
What color is your Jacobian? Graph coloring for computing derivatives.
SIAM Review,
47(4):629705,
2005.

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

A. Pothen and C. Sun.
A mapping algorithm for parallel sparse Cholesky factorization.
SIAM Journal on Scientific Computing,
14(5):12531257,
1993.
Keyword(s): Multifrontal method,
Cholesky factorization,
Task scheduling,
Proportional mapping.

A. Pothen and C.J. Fan.
Computing the block triangular form of a sparse matrix.
ACM Transactions on Mathematical Software,
16:303324,
1990.

A. Pothen,
H. D. Simon,
and K.P. Liou.
Partitioning sparse matrices with eigenvectors of graphs.
SIAM Journal on Matrix Analysis and Applications,
11(3):430452,
1990.

B. Hendrickson and A. Pothen.
Combinatorial scientific computing: The enabling power of discrete algorithms in computational science.
In M. Dayde,
M. L. M. Palma,
L. G. A. Coutinho,
E. Pacitti,
and J. C. Lopes, editors,
High Performance Computing for Computational ScienceVECPAR 2006,
volume 4395 of Lecture Notes in Computer Science,
pages 260280,
2007.
Keyword(s): Minimum degree ordering algorithm,
Coloring,
Jacobian matrix,
Sparse Hessian matrix.

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

A. Pothen.
Graph matchings in combinatorial scientific computing (Vertexweighted and parallel edgeweighted).
Presentation at Dagstuhl Seminar on Combinatorial Scientific Computing (09061),
February 2009.
BACK TO INDEX
Last modified: Wed Jul 21 11:49:20 2010
Author: Bora Uçar.