BACK TO INDEX
Publications of S. C. Eisenstat on CSC
|
Articles in journal or book chapters
|
-
S. C. Eisenstat and J. W. H. Liu.
A tree-based dataflow model for the unsymmetric multifrontal method.
Electronic Transactions on Numerical Analysis,
21:1-19,
2005.
-
S. C. Eisenstat and J. W. H. Liu.
The theory of elimination trees for sparse unsymmetric matrices.
SIAM Journal on Matrix Analysis and Applications,
26(3):686-705,
2005.
-
J. W. Demmel,
S. C. Eisenstat,
J. R. Gilbert,
X. S. Li,
and J. W. H. Liu.
A supernodal approach to sparse partial pivoting.
SIAM Journal on Matrix Analysis and Applications,
20(3):720-755,
1999.
-
S. C. Eisenstat,
M. C. Gursky,
M. H. Schultz,
and A. H. Sherman.
The Yale sparse matrix package I: The symmetric codes.
International Journal for Numerical Methods in Engineering,
18:1145-1151,
1982.
-
P. Heggernes,
S. C. Eisenstat,
G. Kumfert,
and A. Pothen.
The computational complexity of the minimum degree algorithm.
In Proceedings of NIK 2001---14th Norwegian Computer Science Conference,
Tromso, Norway,
pages 98-109,
2001.
BACK TO INDEX
Last modified: Wed Jul 21 11:49:20 2010
Author: Bora Uçar.