关注
Barry W Peyton
Barry W Peyton
Dalton State College
在 daltonstate.edu 的电子邮件经过验证
标题
引用次数
引用次数
年份
An introduction to chordal graphs and clique trees
JRS Blair, B Peyton
Graph theory and sparse matrix computation, 1-29, 1993
6651993
Parallel algorithms for sparse linear systems
MT Heath, E Ng, BW Peyton
SIAM review 33 (3), 420-460, 1991
4221991
A user's guide to PICL a portable instrumented communication library
GA Geist, MT Heath, BW Peyton, PH Worley
Oak Ridge National Lab., TN (USA), 1990
4151990
Block sparse Cholesky algorithms on advanced uniprocessor computers
EG Ng, BW Peyton
SIAM Journal on Scientific Computing 14 (5), 1034-1056, 1993
3181993
Progress in sparse matrix methods for large linear systems on vector supercomputers
C Cleveland Ashcraft, RG Grimes, JG Lewis, BW Peyton, HD Simon, ...
The International Journal of Supercomputing Applications 1 (4), 10-30, 1987
2101987
Maximum cardinality search for computing minimal triangulations of graphs
A Berry, JRS Blair, P Heggernes, BW Peyton
Algorithmica 39 (4), 287-298, 2004
1502004
On finding supernodes for sparse matrix computations
JWH Liu, EG Ng, BW Peyton
SIAM Journal on Matrix Analysis and Applications 14 (1), 242-252, 1993
1321993
A fast algorithm for reordering sparse matrices for parallel factorization
JG Lewis, BW Peyton, A Pothen
SIAM Journal on Scientific and Statistical Computing 10 (6), 1146-1173, 1989
1321989
Parallel algorithms for matrix computations
K Gallivan, M Heath, E Ng, B Peyton, R Plemmons, C Romine, A Sameh, ...
Siam, 1990
1311990
A supernodal Cholesky factorization algorithm for shared-memory multiprocessors
E Ng, BW Peyton
SIAM Journal on scientific computing 14 (4), 761-769, 1993
901993
An efficient algorithm to compute row and column counts for sparse Cholesky factorization
JR Gilbert, EG Ng, BW Peyton
SIAM Journal on Matrix Analysis and Applications 15 (4), 1075-1091, 1994
831994
Computing connection coefficients of compactly supported wavelets on bounded intervals
CH Romine, BW Peyton
Oak Ridge National Lab., Mathematical Sciences Section, TN (United States), 1997
511997
Minimal orderings revisited
BW Peyton
SIAM journal on matrix analysis and applications 23 (1), 271-294, 2001
392001
On finding minimum-diameter clique trees
JRS Blair, BW Peyton
Oak Ridge National Lab., TN (United States), 1991
331991
A machine-independent communication library
GA Geist, MT Heath, BW Peyton, PH Worley
Oak Ridge National Lab., TN (USA), 1989
331989
Computing row and column counts for sparse QR and LU factorization
JR Gilbert, XS Li, EG Ng, BW Peyton
BIT Numerical Mathematics 41 (4), 693-710, 2001
302001
Some applications of clique trees to the solution of sparse linear systems
BW Peyton
281986
Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
BW Peyton, A Pothen, X Yuan
Linear algebra and its applications 192, 329-353, 1993
261993
A blocked incomplete Cholesky preconditioner for hierarchical-memory computers
EG Ng, BW Peyton, P Raghavan
Iterative Methods in Scientific Computation IV 5, 211-221, 1999
251999
A compute-ahead implementation of the fan-in sparse distributed factorization scheme
C Ashcraft, SC Eisenstat, AH Sherman, JWH Liu, BW Peyton
Oak Ridge National Lab., TN (USA), 1990
191990
系统目前无法执行此操作,请稍后再试。
文章 1–20