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

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

Revision as of 17:05, 25 June 2024

scientific article
Language Label Description Also known as
English
On the row merge tree for sparse LU factorization with partial pivoting
scientific article

    Statements

    On the row merge tree for sparse LU factorization with partial pivoting (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2007
    0 references
    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
    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
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers