A tupleware approach to domain decomposition methods

DOI10.1016/0168-9274(91)90074-AMaRDI QIDQ1181536zbMATH OpenOpenAlexFDO

Authors C. Douglas

Publication date 27 June 1992

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0168-9274(91)90074-a

zbMATH Keywords

direct methodsdomain decompositiondomain reduction methoditerative methodsLinda systemmultigridparallel computationprojection techniquestime complexity

Mathematics Subject Classification ID

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

Review text

The paper discusses the solution methods of domain decomposition, multigrid, and projection techniques for the elliptic boundary value problem. Results are derived measuring how much time and space can be reduced in the problem discretization phase by the use of these methods. A highly portable implementation using the Linda system for parallel or distributed programming is discussed. Linda adds a tuple data abstraction to a language, which is used to develop numerical software.

Recommendations

• Application des méthodes de décomposition de domaines au calcul parallèle
• scientific article; zbMATH DE number 4209523
• scientific article; zbMATH DE number 736360
• Multi-level domain decomposition methods
• Domain decomposition on parallel computers

Cites work

• A Matrix Decomposition Method for Orthotropic Elasticity Problems
• A parallel domain reduction method
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• Constructive Interference in Parallel Algorithms
• scientific article; zbMATH DE number 3880039 (Why is no real title available?)
• scientific article; zbMATH DE number 3924053 (Why is no real title available?)
• scientific article; zbMATH DE number 4062471 (Why is no real title available?)
• scientific article; zbMATH DE number 4076515 (Why is no real title available?)
• scientific article; zbMATH DE number 4078624 (Why is no real title available?)
• scientific article; zbMATH DE number 4108088 (Why is no real title available?)
• scientific article; zbMATH DE number 3438337 (Why is no real title available?)
• scientific article; zbMATH DE number 4113906 (Why is no real title available?)
• scientific article; zbMATH DE number 4115880 (Why is no real title available?)
• Multi-Grid Algorithms with Applications to Elliptic Boundary Value Problems
• Multi-Level Adaptive Solutions to Boundary-Value Problems
• Sharp Estimates for Multigrid Rates of Convergence with General Smoothing and Acceleration
• The Fast Adaptive Composite Grid (FAC) Method for Elliptic Equations
• Using Symmetries and Antisymmetries to Analyze a Parallel Multigrid Algorithm: The Elliptic Boundary Value Problem Case

Cited in

(3)

• An abstract theory for the domain reduction method
• Development of semi-coarsening techniques
• scientific article; zbMATH DE number 218262 (Why is no real title available?)

Describes a project that uses

Uses Software

• Madpack
• CGS

This page was built for publication: A tupleware approach to domain decomposition methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1181536)