Barry W. Peyton

Available identifiers

zbMath Open peyton.barry-wMaRDI QIDQ1311329

List of research outcomes

Publication	Date of Publication	Type
Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes	2021-09-22	Paper
Fast Computation of Minimal Fill Inside A Given Elimination Ordering	2009-11-06	Paper
Maximum cardinality search for computing minimal triangulations of graphs	2004-10-01	Paper
Minimal Orderings Revisited	2002-04-23	Paper
Large-Scale Normal Coordinate Analysis for Molecular Structures	2002-04-15	Paper
Separators and structure prediction in sparse orthogonal factorization	1998-02-22	Paper
https://portal.mardi4nfdi.de/entity/Q4341536	1997-07-10	Paper
Some Results on Structure Prediction in Sparse $QR$ Factorization	1996-12-08	Paper
A clique tree algorithm for partitioning a chordal graph into transitive subgraphs	1995-09-06	Paper
https://portal.mardi4nfdi.de/entity/Q4764622	1995-05-04	Paper
https://portal.mardi4nfdi.de/entity/Q4288578	1995-01-02	Paper
An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization	1994-11-16	Paper
A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors	1994-04-14	Paper
Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers	1994-04-14	Paper
Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution	1994-01-26	Paper
On Finding Supernodes for Sparse Matrix Computations	1993-05-16	Paper
https://portal.mardi4nfdi.de/entity/Q3998906	1992-09-17	Paper
Parallel Algorithms for Sparse Linear Systems	1992-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q5750331	1990-01-01	Paper
A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization	1989-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Barry W. Peyton