A dissection solver with kernel detection for symmetric finite element matrices on shared memory computers
From MaRDI portal
Publication:2952565
DOI10.1002/nme.4729zbMath1352.65457OpenAlexW2096894185MaRDI QIDQ2952565
No author found.
Publication date: 30 December 2016
Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://hal.sorbonne-universite.fr/hal-00816916/file/SuzukiRoux-Apr2014.pdf
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Numerical algorithms for specific classes of architectures (65Y10)
Related Items
Treatment of Singular Matrices in the Hybrid Total FETI Method, On the use of graph centralities to compute generalized inverse of singular finite element operators: Applications to the analysis of floating substructures
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
- On fast factorization pivoting methods for sparse symmetric indefinite systems
- Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- A new parallel sparse direct solver: Presentation and numerical experiments in large-scale structural mechanics parallel computing
- Balancing domain decomposition
- CALU: A Communication Optimal LU Factorization Algorithm
- Finite element matrices in congruent subdomains and their effective use for large-scale computations
- Direct Methods for Sparse Linear Systems
- LAPACK Users' Guide
- A method of finite element tearing and interconnecting and its parallel solution algorithm
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Numerical Experiments Using Dissection Methods to Solve n by n Grid Problems
- Algorithms for Matrix Partitioning and the Numerical Solution of Finite Element Systems
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A Supernodal Approach to Sparse Partial Pivoting
- A Cartesian Parallel Nested Dissection Algorithm
- A combined unifrontal/multifrontal method for unsymmetric sparse matrices
- An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
- SuperLU_DIST
- Two-level dynamic scheduling in PARDISO: Improved scalability on shared memory multiprocessing systems
