Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
type: Item
instance of: scholarly article
title: Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
zbMATH Open document ID: 0851.65087
DOI: 10.1007/BF02238511
author: Petr Vaněk
author: Jan Mandel
author: Marian Brezina
published in: Computing
publication date: 1996-06-13T00:00:00Z
review text: The authors develop an algebraic multigrid algorithm for symmetric positive definite linear systems based on a concept of smoothed aggregation relying on a suitable decomposition of the set of nodes and a corresponding tentative interpolation. The coarsening is governed by abstract multigrid theory and by requirements reflecting practical experience. Favorable behaviour of the algorithm is demonstrated on eleven real-world examples from solid elasticity, plate bending, and shells. The code is available via internet on the address given in the paper.
reviewed by: Tomáş Roubíçek
Mathematics Subject Classification ID: 65N55
Mathematics Subject Classification ID: 74B05
Mathematics Subject Classification ID: 74S05
Mathematics Subject Classification ID: 65N30
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 35J40
Mathematics Subject Classification ID: 74K20
Mathematics Subject Classification ID: 74K15
zbMATH DE Number: 878402
zbMATH Keywords: fourth-order elliptic problems
zbMATH Keywords: linear elliptic problems
zbMATH Keywords: unstructured meshes
zbMATH Keywords: automatic coarsening
zbMATH Keywords: algebraic multigrid algorithm
zbMATH Keywords: symmetric positive definite linear systems
zbMATH Keywords: smoothed aggregation
zbMATH Keywords: solid elasticity
zbMATH Keywords: plate bending
zbMATH Keywords: shells
MaRDI profile type: Publication
cites work: The Multi-Grid Method for the Diffusion Equation with Strongly Discontinuous Coefficients
cites work: Multigrid methods for the biharmonic problem discretized by conformingC1finite elements on nonnested meshes∗
cites work: Convergence Estimates for Multigrid Algorithms without Regularity Assumptions
cites work: Algebraic multigrid theory: The symmetric case
cites work: Q3340021
cites work: An Optimal-Order Nonconforming Multigrid Method for the Biharmonic Equation
cites work: A Semicoarsening Multigrid Algorithm for SIMD Machines
cites work: Q3727300
cites work: Balancing domain decomposition
cites work: Hierarchical Conforming Finite Element Methods for the Biharmonic Equation
cites work: A conjugate gradient method and a multigrid algorithm for Morley's finite element approximation of the biharmonic equation
cites work: Q3703236
cites work: Semicoarsening Multigrid on a Hypercube
cites work: Algebraic multigrid (AMG): Experiences and comparisons
cites work: Fast multigrid solver
cites work: Acceleration of convergence of a two-level algorithm by smoothing transfer operators
cites work: Multilevel Schwarz Methods for the Biharmonic Dirichlet Problem
description: scientific article; zbMATH DE number 878402