Barry W. Peyton

From MaRDI portal
Person:1311329

Available identifiers

zbMath Open peyton.barry-wMaRDI QIDQ1311329

List of research outcomes





PublicationDate of PublicationType
Fast and effective reordering of columns within supernodes using partition refinement2024-05-14Paper
Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes2021-09-22Paper
Fast Computation of Minimal Fill Inside A Given Elimination Ordering2009-11-06Paper
Maximum cardinality search for computing minimal triangulations of graphs2004-10-01Paper
Computing row and column counts for sparse \(QR\) and \(LU\) factorization2002-09-19Paper
Minimal orderings revisited2002-04-23Paper
Large-scale normal coordinate analysis for molecular structures2002-04-15Paper
Separators and structure prediction in sparse orthogonal factorization1998-02-22Paper
https://portal.mardi4nfdi.de/entity/Q43415361997-07-10Paper
Some Results on Structure Prediction in Sparse $QR$ Factorization1996-12-08Paper
A clique tree algorithm for partitioning a chordal graph into transitive subgraphs1995-09-06Paper
https://portal.mardi4nfdi.de/entity/Q47646221995-05-04Paper
https://portal.mardi4nfdi.de/entity/Q42885781995-01-02Paper
An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization1994-11-16Paper
Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers1994-04-14Paper
A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors1994-04-14Paper
Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution1994-01-26Paper
On Finding Supernodes for Sparse Matrix Computations1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q39989061992-09-17Paper
Parallel Algorithms for Sparse Linear Systems1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q57503311990-01-01Paper
A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization1989-01-01Paper

Research outcomes over time

This page was built for person: Barry W. Peyton