Barry W. Peyton

According to our database1, Barry W. Peyton authored at least 12 papers between 1991 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Fast and effective reordering of columns within supernodes using partition refinement.
Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, 2018

2008
Fast Computation of Minimal Fill Inside A Given Elimination Ordering.
SIAM J. Matrix Anal. Appl., 2008

2004
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs.
Algorithmica, 2004

2001
Large-Scale Normal Coordinate Analysis for Molecular Structures.
SIAM J. Sci. Comput., 2001

Minimal Orderings Revisited.
SIAM J. Matrix Anal. Appl., 2001

1999
Linear Algebra.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

1996
Some Results on Structure Prediction in Sparse QR Factorization.
SIAM J. Matrix Anal. Appl., 1996

1994
On Finding Minimum-Diameter Clique Trees.
Nord. J. Comput., 1994

1993
Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers.
SIAM J. Sci. Comput., 1993

A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors.
SIAM J. Sci. Comput., 1993

Toward a Parallel Recursive Spectral Bisection Mapping Tool.
Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1993

1991
Parallel Algorithms for Sparse Linear Systems.
SIAM Rev., 1991


  Loading...