On the parallelization of multi-grid methods using a non-overlapping domain decomposition data structure

DOI10.1016/S0168-9274(96)00064-5zbMath0879.65084MaRDI QIDQ676140

Michael Jung

Publication date: 7 January 1998

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

zbMATH Keywords

performanceinterpolationalgorithmnumerical examplesmoothinglinear elasticitySchur complementfinite elementparallel computationmultigrid methodsnon-overlapping domain decompositionrestrictionsecond-order elliptic boundary value problemsGauss-Seidel smootherJacobi smoother

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Classical linear elasticity (74B05) 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) Complexity and performance of numerical algorithms (65Y20)

Related Items

A geometric data structure for parallel finite elements and the application to multigrid methods with block smoothing, NonInvasive Multigrid For SemiStructured Grids, Stochastic domain decomposition based on variable-separation method, A Brief History of the Parallel Dawn in Karl-Marx-Stadt/Chemnitz, Parallel Multiblock Multigrid Algorithms for Poroelastic Models, FEM and BEM parallel processing: theory and applications – a bibliography (1996‐2002)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• PARMESH - A parallel mesh generator
• Concepts for efficient multigrid implementation on SUPRENUM-like architectures
• On the multigrid F-cycle
• A capacitance matrix method for Dirichlet problem on polygon region
• Applications of multilevel methods to practical problems
• The approximate Dirichlet domain decomposition method. II: Applications to 2nd-order elliptic B.V.P.s
• Parallel solvers for nonlinear elliptic problems based on domain decomposition ideas
• Multigrid methods on parallel computers—A survey of recent developments
• Convergence Estimates for Multigrid Algorithms without Regularity Assumptions
• A New Convergence Proof for the Multigrid Method Including the V-Cycle
• Sharp Estimates for Multigrid Rates of Convergence with General Smoothing and Acceleration
• The Construction of Preconditioners for Elliptic Problems by Substructuring. II
• New Convergence Estimates for Multigrid Algorithms
• Parallelization of Robust Multigrid Methods: ILU Factorization and Frequency Decomposition Method
• A Domain Decomposition Preconditioner Based on a Change to a Multilevel Nodal Basis
• Convergence Analysis without Regularity Assumptions for Multigrid Algorithms Based on SOR Smoothing
• The Analysis of Smoothers for Multigrid Algorithms
• Ways to improve the bending response of finite elements
• A Parallel Multigrid Algorithm for Solving the Navier-Stokes Equations
• New Parallel SOR Method by Domain Partitioning
• The multigrid method in solid mechanics: Part I—Algorithm description and behaviour
• The multigrid method in solid mechanics: Part II—Practical applications