On the row merge tree for sparse LU factorization with partial pivoting (Q878210): Difference between revisions

The paper is concerned with the problem of structure prediction for sparse \(LU\) factorizations with partial pivoting. The authors define two new tools, the row merge matrix and the row merge tree, for the experimental structure prediction of a set of matrices satisfying the Hall property.

0 references

reviewed by

Constantin Popa

0 references

zbMATH Keywords

sparse LU factorization

0 references

partial pivoting

0 references

structure prediction

0 references

column elimination tree

0 references

row merge tree

0 references

Hall property

0 references

describes a project that uses

SuperLU

0 references

MC21A

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10543-007-0116-1

0 references

cites work

Parallel unsymmetric-pattern multifrontal sparse LU with column preordering

0 references

Strong Hall Matrices

0 references

Predicting fill for sparse orthogonal factorization

0 references

A column pre-ordering strategy for the unsymmetric-pattern multifrontal method

0 references

A Supernodal Approach to Sparse Partial Pivoting

0 references

An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination

0 references

Q3740904

0 references

On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix

0 references

An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix

0 references

Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting

0 references

Parallel sparse Gaussian elimination with partial pivoting

0 references

Computing row and column counts for sparse \(QR\) and \(LU\) factorization

0 references

Q4288583

0 references

Modification of the minimum-degree algorithm by multiple elimination

0 references

A compact row storage scheme for Cholesky factors using elimination trees

0 references

On General Row Merging Schemes for Sparse Givens Transformations

0 references

The Role of Elimination Trees in Sparse Factorization

0 references

Exact Prediction of QR Fill-In by Row-Merge Trees

0 references

Computing the block triangular form of a sparse matrix

0 references

<i>S</i><sup>+</sup>: Efficient 2D Sparse LU Factorization on Parallel Machines

0 references

Efficiency of a Good But Not Linear Set Union Algorithm

0 references

Identifiers

zbMATH Open document ID

1116.65036

0 references

DOI

10.1007/s10543-007-0116-1

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:878210

@@ Property / describes a project that uses @@
+SuperLU
@@ Property / describes a project that uses: SuperLU / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+MC21A
@@ Property / describes a project that uses: MC21A / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10543-007-0116-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2064762577
@@ Property / OpenAlex ID: W2064762577 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel unsymmetric-pattern multifrontal sparse LU with column preordering
+Normal rank
@@ Property / cites work @@
+Strong Hall Matrices
@@ Property / cites work: Strong Hall Matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Predicting fill for sparse orthogonal factorization
+Normal rank
@@ Property / cites work @@
+A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
+Normal rank
@@ Property / cites work @@
+A Supernodal Approach to Sparse Partial Pivoting
@@ Property / cites work: A Supernodal Approach to Sparse Partial Pivoting / rank @@
+Normal rank
@@ Property / cites work @@
+An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
+Normal rank
@@ Property / cites work @@
+Q3740904
@@ Property / cites work: Q3740904 / rank @@
+Normal rank
@@ Property / cites work @@
+On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
+Normal rank
@@ Property / cites work @@
+An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
+Normal rank
@@ Property / cites work @@
+Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
+Normal rank
@@ Property / cites work @@
+Parallel sparse Gaussian elimination with partial pivoting
+Normal rank
@@ Property / cites work @@
+Computing row and column counts for sparse \(QR\) and \(LU\) factorization
+Normal rank
@@ Property / cites work @@
+Q4288583
@@ Property / cites work: Q4288583 / rank @@
+Normal rank
@@ Property / cites work @@
+Modification of the minimum-degree algorithm by multiple elimination
+Normal rank
@@ Property / cites work @@
+A compact row storage scheme for Cholesky factors using elimination trees
+Normal rank
@@ Property / cites work @@
+On General Row Merging Schemes for Sparse Givens Transformations
+Normal rank
@@ Property / cites work @@
+The Role of Elimination Trees in Sparse Factorization
+Normal rank
@@ Property / cites work @@
+Exact Prediction of QR Fill-In by Row-Merge Trees
@@ Property / cites work: Exact Prediction of QR Fill-In by Row-Merge Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the block triangular form of a sparse matrix
+Normal rank
@@ Property / cites work @@
+<i>S</i><sup>+</sup>: Efficient 2D Sparse LU Factorization on Parallel Machines
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank