Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations

DOI10.1016/j.camwa.2015.10.009zbMath1443.65031OpenAlexW2178771058MaRDI QIDQ2006579

Sergiy Fialko

Publication date: 11 October 2020

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2015.10.009

zbMATH Keywords

finite element methodhigh performancemultithreadingblock matricessparse direct solvermulticore computers

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems ⋮ Block subspace projection preconditioned conjugate gradient method in modal structural analysis ⋮ Parallel finite element solver for multi-core computers with shared memory

Uses Software

• SuperLU
• MUMPS
• TAUCS
• METIS
• CHOLMOD
• UHM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• PARFES: A method for solving finite element linear equations on multi-core computers
• Sparse direct factorizations through unassembled hyper-matrices
• Multifrontal parallel distributed symmetric and unsymmetric solvers
• New parallel sparse direct solvers for multicore architectures
• Simulation of marine controlled source electromagnetic measurements using a parallel Fourier \(hp\)-finite element method
• BLIS: A Framework for Rapidly Instantiating BLAS Functionality
• Fine-Grained Multithreading for the Multifrontal $QR$ Factorization of Sparse Matrices
• On Computing Inverse Entries of a Sparse Matrix in an Out-of-Core Environment
• Anatomy of high-performance matrix multiplication
• The Evolution of the Minimum Degree Ordering Algorithm
• A Supernodal Approach to Sparse Partial Pivoting
• Efficient Methods for Out-of-Core Sparse Cholesky Factorization
• A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling
• The design and implementation of a new out-of-core sparse cholesky factorization method
• Two-level dynamic scheduling in PARDISO: Improved scalability on shared memory multiprocessing systems