Parallel Direct Domain Decomposition Methods (D3M) for Finite Elements

02/11/2020
by   Javad Moshfegh, et al.
0

A parallel direct solution approach based on domain decomposition method (DDM) and directed acyclic graph (DAG) scheduling is outlined. Computations are represented as a sequence of small tasks that operate on domains of DDM or dense matrix blocks of a reduced matrix. These tasks can be statically scheduled for parallel execution using their DAG dependencies and weights that depend on estimates of computation and communication costs. Performance comparison with MUMPS 5.1.2 on electrically large problems suggest up to 20 better parallel efficiency, 30 while maintaining the same accuracy.

READ FULL TEXT
research
02/11/2020

Direct Domain Decomposition Method (D3M) for Finite Element Electromagnetic Computations

An exact arithmetic, memory efficient direct solution method for finite ...
research
10/14/2020

Wukong: A Scalable and Locality-Enhanced Framework for Serverless Parallel Computing

Serverless computing is increasingly being used for parallel computing, ...
research
02/11/2020

Direct Solution of FEM Models: Are Sparse Direct Solvers the Best Strategy?

A brief summary of direct solution approaches for finite element methods...
research
05/14/2018

A 3D Parallel Algorithm for QR Decomposition

Interprocessor communication often dominates the runtime of large matrix...
research
09/04/2018

Robust and parallel scalable iterative solutions for large-scale finite cell analyses

The finite cell method is a highly flexible discretization technique for...
research
09/11/2023

Parallel Selected Inversion for Space-Time Gaussian Markov Random Fields

Performing a Bayesian inference on large spatio-temporal models requires...
research
07/11/2019

State-of-The-Art Sparse Direct Solvers

In this chapter we will give an insight into modern sparse elimination m...

Please sign up or login with your details

Forgot password? Click here to reset