A Parallel Implementation of an Iterative Substructuring Algorithm for Problems in Three Dimensions

DOI10.1137/0914025zbMath0780.65075OpenAlexW2070090138MaRDI QIDQ5286357

Barry F. Smith

Publication date: 29 June 1993

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/20969dafc543423465c72ffa7f73f1c349a8ae9a

zbMATH Keywords

preconditioningconjugate gradient methodnumerical experimentmultigrid solverdiagonal scalingNumerical resultsdomain decomposition algorithmiterative substructuring algorithms3D self-adjoint elliptic boundary value problemsIntel iPSC/860 distributed memory parallel computerwirebasket problem

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items (7)

An error-resilient redundant subspace correction method ⋮ A new parallel domain decomposition method for the adaptive finite element solution of elliptic partial differential equations ⋮ A three-level BDDC algorithm for a saddle point problem ⋮ Iterative substructuring methods for spectral elements: Problems in three dimensions based on numerical quadrature ⋮ Preconditioners for domain decomposition methods ⋮ On the use of inexact subdomain solvers for BDDC algorithms ⋮ Stochastic subspace correction methods and fault tolerance

This page was built for publication: A Parallel Implementation of an Iterative Substructuring Algorithm for Problems in Three Dimensions