Fast multigrid solver
type: Item
instance of: scholarly article
title: Fast multigrid solver
zbMATH Open document ID: 0824.65016
author: Petr Vaněk
published in: Applications of Mathematics
publication date: 1995-11-13T00:00:00Z
full work available at URL: https://eudml.org/doc/32899
review text: To solve a system of linear algebraic equations with a positive definite matrix arising from discretization of elliptic boundary value problems, the author suggests a variant of the multigrid algorithm with coarse spaces constructed by the aggregation of unknowns and smoothing. The performance of the algorithm is further improved by a variant of an overcorrection proposed originally by \textit{R. Blaheta} [J. Comput. Appl. Math. 24, No. 1/2, 227-239 (1988; Zbl 0663.65106)]. The convergence theory for a two-level algorithm is given. Results of numerical experiments indicate that the method presented is efficient.
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65N55
Mathematics Subject Classification ID: 65Y15
Mathematics Subject Classification ID: 35J25
zbMATH DE Number: 762070
zbMATH Keywords: multigrid algorithm
zbMATH Keywords: aggregation of unknowns
zbMATH Keywords: smoothing
zbMATH Keywords: performance
zbMATH Keywords: overcorrection
zbMATH Keywords: convergence
zbMATH Keywords: two-level algorithm
zbMATH Keywords: numerical experiments
reviewed by: Z. Dostál
MaRDI profile type: Publication
cites work: A modification of the two-level algorithm with overcorrection
cites work: Acceleration of convergence of a two-level algebraic algorithm by aggregation in smoothing process
cites work: Acceleration of convergence of a two-level algorithm by smoothing transfer operators
cites work: Q3727300
cites work: Q3323187
cites work: Balancing domain decomposition
OpenAlex ID: W2530001721
DOI: 10.21136/AM.1995.134274
description: scientific article; zbMATH DE number 762070