Sparse direct factorizations through unassembled hyper-matrices

DOI10.1016/J.CMA.2009.07.012MaRDI QIDQ649249zbMATHOpenAlexWikidataFDO

Authors Paolo Bientinesi, Victor Eijkhout, Kyungjoo Kim, Jason Kurtz, 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

zbMATH Keywords

Gaussian eliminationsparse matricesfactorizations\(hp\)-adaptive finite elements

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

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; zbMATH DE number 4217769

Cites work

• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 1227077 (Why is no real title available?)
• scientific article; zbMATH DE number 1069512 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• A Separator Theorem for Planar Graphs
• A Supernodal Approach to Sparse Partial Pivoting
• A combined unifrontal/multifrontal method for unsymmetric sparse matrices
• A fully asynchronous multifrontal solver using distributed dynamic scheduling
• A parallel adaptive strategy for \(hp\) finite element computations
• A set of level 3 basic linear algebra subprograms
• An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• Basic Linear Algebra Subprograms for Fortran Usage
• Computing with hp-ADAPTIVE FINITE ELEMENTS
• Direct Methods for Sparse Linear Systems
• Generalized Nested Dissection
• High performance computational kernels for selected segments of a p finite element code
• Integration of \(hp\)-adaptivity and a two-grid solver for elliptic problems
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Sparse hypermatrix Cholesky: customization for high performance
• SuperLU_DIST

Cited in

(9)

• Computing Petaflops over Terabytes of Data
• 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 survey on direct solvers for Galerkin methods
• 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
• Impact of element-level static condensation on iterative solver performance

Describes a project that uses

Uses Software

• SuperLU-DIST
• SuperLU
• BLAS
• PETSc
• MUMPS
• Trilinos
• symrcm
• CSparse
• 3Dhp90

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)