Matrix-based multigrid. Theory and applications (Q5907030)
From MaRDI portal
scientific article; zbMATH DE number 2004990
Language | Label | Description | Also known as |
---|---|---|---|
English | Matrix-based multigrid. Theory and applications |
scientific article; zbMATH DE number 2004990 |
Statements
Matrix-based multigrid. Theory and applications (English)
0 references
17 November 2003
0 references
The book consists of an introductory chapter, four parts, and an appendix. The introduction refers to some topics that the author sees as multilevel procedures, e.g., the representation of integer numbers with more than one digit or Euklid's algorithm for the determination of the greatest common divisor. [The reader may ask whether each recursive procedure is a multigrid algorithm.] Moreover, several topics as the wave transform are listed without details. Notations and an application of Gerschgorin's theorem to diagonally dominant matrices are added. Part I begins with a quick discussion of discretization methods for elliptic partial differential equations (finite differences, finite volumes, and finite elements). The iterative solution of linear equations (relaxation methods, conjugate gradient, and incomplete LU) is presented with emphasis on parallelization and cache-oriented codes. The general scheme of geometric and algebraic multigrid methods is described on seven pages. Part II on multigrid for structured grids with more than 50 pages is the greatest part in the book. Here the change from a presentation in terms of stencils to matrix-vector formulations is easily done in both directions. We find the automatic multigrid for the five-point stencil, a black-box multigrid method for the nine-point stencil, and the indefinite Helmholtz equation. Extra interest is given to semicoarsening and an application in image processing. Part III consists of one chapter. Grids with locally refined meshes are called semi-structured grids. A difference to the discussion in the previous part is that inner products are scaled now with respect to a diagonal matrix. Part IV on multigrid for unstructured grids refers to those grids that can be split into structured grids by domain decomposition. An alternative constitute the algebraic multilevel methods. Finally a C++ framework for unstructured grids is presented in an appendix. It is clear from the title that it is the intention of the book to focus on facts that can be stated in terms of matrices. Therefore, representations of the iteration matrices are provided, and some condition numbers are estimated. When the author speaks of the analysis of the multigrid method, he says how a convergence analysis could be done, but he does not perform it. Since convergence proofs refer to approximation properties directly or in an indirect way, they are beyond the scope of the book. Its intention is different.
0 references
multigrid
0 references
textbook
0 references
mesh refinement
0 references
conjugate gradient
0 references
incomplete LU
0 references
multigrid algorithm
0 references
finite differences
0 references
finite volumes
0 references
finite elements
0 references
relaxation methods
0 references
Helmholtz equation
0 references
semicoarsening
0 references
image processing
0 references
domain decomposition
0 references
algebraic multilevel method
0 references
condition numbers
0 references
convergence
0 references