A closest point method library for PDEs on surfaces with parallel domain decomposition solvers and preconditioners

10/12/2021
by   Ian C. T. May, et al.
0

The DD-CPM software library provides a set of tools for the discretization and solution of problems arising from the closest point method (CPM) for partial differential equations on surfaces. The solvers are built on top of the well-known PETSc framework, and are supplemented by custom domain decomposition (DD) preconditioners specific to the CPM. These solvers are fully compatible with distributed memory parallelism through MPI. This library is particularly well suited to the solution of elliptic and parabolic equations, including many reaction-diffusion equations. The software is detailed herein, and a number of sample problems and benchmarks are demonstrated. Finally, the parallel scalability is measured.

READ FULL TEXT

page 8

page 9

page 11

page 12

page 13

research
07/31/2019

Domain Decomposition for the Closest Point Method

The discretization of elliptic PDEs leads to large coupled systems of eq...
research
11/14/2018

AMGCL: an Efficient, Flexible, and Extensible Algebraic Multigrid Implementation

The paper presents AMGCL – an opensource C++ library implementing the al...
research
04/01/2019

Multigrid Solvers in Reconfigurable Hardware

The problem of finding the solution of Partial Differential Equations (P...
research
01/08/2021

Parallel Newton-Krylov-BDDC and FETI-DP deluxe solvers for implicit time discretizations of the cardiac Bidomain equations

Two novel parallel Newton-Krylov Balancing Domain Decomposition by Const...
research
05/04/2022

parGeMSLR: A Parallel Multilevel Schur Complement Low-Rank Preconditioning and Solution Package for General Sparse Matrices

This paper discusses parGeMSLR, a C++/MPI software library for the solut...
research
09/18/2019

Additive Schwarz solvers and preconditioners for the closest point method

The discretization of surface intrinsic elliptic partial differential eq...
research
01/13/2023

A hybrid probabilistic domain decomposition algorithm suited for very large-scale elliptic PDEs

State of the art domain decomposition algorithms for large-scale boundar...

Please sign up or login with your details

Forgot password? Click here to reset