A tupleware approach to domain decomposition methods
From MaRDI portal
Recommendations
Cites work
- 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?)
- 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
- 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)
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)