Sparse direct factorizations through unassembled hyper-matrices

DOI10.1016/J.CMA.2009.07.012zbMath1227.65111OpenAlexW2047196981WikidataQ114196956 ScholiaQ114196956MaRDI QIDQ649249

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

zbMATH Keywords

sparse matricesGaussian eliminationfactorizations\(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)

Related Items (9)

A survey on direct solvers for Galerkin methods ⋮ A direct solver with reutilization of Lu factorizations for \(h\)-adaptive finite element grids with point singularities ⋮ Direct solvers performance on \(h\)-adapted grids ⋮ Impact of element-level static condensation on iterative solver performance ⋮ 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 ⋮ Computational cost of isogeometric multi-frontal solvers on parallel distributed memory machines ⋮ Computing Petaflops over Terabytes of Data ⋮ A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling

Uses Software

• BLAS
• PETSc
• MUMPS
• Trilinos
• symrcm
• CSparse
• 3Dhp90
• Unnamed Item
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
• A parallel adaptive strategy for \(hp\) finite element computations
• Integration of \(hp\)-adaptivity and a two-grid solver for elliptic problems
• Direct Methods for Sparse Linear Systems
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• A Separator Theorem for Planar Graphs
• Generalized Nested Dissection
• Basic Linear Algebra Subprograms for Fortran Usage
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• A Supernodal Approach to Sparse Partial Pivoting
• A set of level 3 basic linear algebra subprograms
• A combined unifrontal/multifrontal method for unsymmetric sparse matrices
• An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• High performance computational kernels for selected segments of a p finite element code
• SuperLU_DIST
• Computing with hp-ADAPTIVE FINITE ELEMENTS

This page was built for publication: Sparse direct factorizations through unassembled hyper-matrices