Sparse direct factorizations through unassembled hyper-matrices (Q649249): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
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: MUMPS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047196981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4356470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: High performance computational kernels for selected segments of a <i>p</i> finite element code / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined unifrontal/multifrontal method for unsymmetric sparse matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Methods for Sparse Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with hp-ADAPTIVE FINITE ELEMENTS / 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: A set of level 3 basic linear algebra subprograms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3102304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic Linear Algebra Subprograms for Fortran Usage / rank
 
Normal rank
Property / cites work
 
Property / cites work: SuperLU_DIST / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Nested Dissection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel adaptive strategy for \(hp\) finite element computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of \(hp\)-adaptivity and a two-grid solver for elliptic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Sparse Matrices with Eigenvectors of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220650 / rank
 
Normal rank

Latest revision as of 16:39, 4 July 2024

scientific article
Language Label Description Also known as
English
Sparse direct factorizations through unassembled hyper-matrices
scientific article

    Statements

    Sparse direct factorizations through unassembled hyper-matrices (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 November 2011
    0 references
    factorizations
    0 references
    Gaussian elimination
    0 references
    sparse matrices
    0 references
    \(hp\)-adaptive finite elements
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers