Sparse direct factorizations through unassembled hyper-matrices
DOI10.1016/J.CMA.2009.07.012zbMATH Open1227.65111OpenAlexW2047196981WikidataQ114196956 ScholiaQ114196956MaRDI QIDQ649249FDOQ649249
Paolo Bientinesi, Victor Eijkhout, Jason Kurtz, Kyungjoo Kim, Robert A. van de Geijn
Publication date: 30 November 2011
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.3317
Recommendations
- scientific article; zbMATH DE number 3976197
- Direct methods for sparse matrices
- scientific article; zbMATH DE number 1924346
- The Factorization of Sparse Symmetric Indefinite Matrices
- Factoring matrices with a tree-structured sparsity pattern
- scientific article; zbMATH DE number 1971712
- Elimination Structures for Unsymmetric Sparse $LU$ Factors
- scientific article; zbMATH DE number 194668
- Incomplete factorization methods for systems with sparse matrices
- scientific article
Computational methods for sparse matrices (65F50) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Cites Work
- SuperLU_DIST
- A Supernodal Approach to Sparse Partial Pivoting
- Title not available (Why is that?)
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- Direct Methods for Sparse Linear Systems
- Title not available (Why is that?)
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Generalized Nested Dissection
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Separator Theorem for Planar Graphs
- Basic Linear Algebra Subprograms for Fortran Usage
- A set of level 3 basic linear algebra subprograms
- Computing with hp-ADAPTIVE FINITE ELEMENTS
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- A parallel adaptive strategy for \(hp\) finite element computations
- A combined unifrontal/multifrontal method for unsymmetric sparse matrices
- An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
- Integration of \(hp\)-adaptivity and a two-grid solver for elliptic problems
- Title not available (Why is that?)
- High performance computational kernels for selected segments of a p finite element code
Cited In (9)
- Direct solvers performance on \(h\)-adapted grids
- Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations
- A comparison of high-order polynomial and wave-based methods for Helmholtz problems
- A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling
- Computational cost of isogeometric multi-frontal solvers on parallel distributed memory machines
- A direct solver with reutilization of Lu factorizations for \(h\)-adaptive finite element grids with point singularities
- A survey on direct solvers for Galerkin methods
- Impact of element-level static condensation on iterative solver performance
- Computing Petaflops over Terabytes of Data
Uses Software
This page was built for publication: Sparse direct factorizations through unassembled hyper-matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q649249)
