A tupleware approach to domain decomposition methods

DOI10.1016/0168-9274(91)90074-AzbMath0745.65068OpenAlexW1997522464MaRDI QIDQ1181536

Craig 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

domain decompositionparallel computationiterative methodsmultigridtime complexitydirect methodsprojection techniquesdomain reduction methodLinda system

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) Parallel numerical computation (65Y05)

Related Items (2)

Development of semi-coarsening techniques ⋮ An abstract theory for the domain reduction method

Uses Software

• Madpack
• CGS

Cites Work

• Multi-Grid Algorithms with Applications to Elliptic Boundary Value Problems
• Constructive Interference in Parallel Algorithms
• Sharp Estimates for Multigrid Rates of Convergence with General Smoothing and Acceleration
• The Fast Adaptive Composite Grid (FAC) Method for Elliptic Equations
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• A Matrix Decomposition Method for Orthotropic Elasticity Problems
• A parallel domain reduction method
• Multi-Level Adaptive Solutions to Boundary-Value Problems
• Using Symmetries and Antisymmetries to Analyze a Parallel Multigrid Algorithm: The Elliptic Boundary Value Problem Case
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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