View in EDS

ANALYSIS ON AGGREGATION AND BLOCK SMOOTHERS IN MULTIGRID METHODS FOR BLOCK TOEPLITZ LINEAR SYSTEMS.

Saved in:
Bibliographic Details
Title: ANALYSIS ON AGGREGATION AND BLOCK SMOOTHERS IN MULTIGRID METHODS FOR BLOCK TOEPLITZ LINEAR SYSTEMS.
Authors: BOLTEN, MATTHIAS, DONATELLI, MARCO, FERRARI, PAOLA, FURCI, ISABELLA
Source: SIAM Journal on Matrix Analysis & Applications; 2025, Vol. 46 Issue 2, p1416-1443, 28p
Subject Terms: TOEPLITZ matrices, JACOBI method, SMOOTHING (Numerical analysis), COMPUTER performance, ALGEBRAIC multigrid methods, FINITE element method
Abstract: We present novel improvements in the context of symbol-based multigrid procedures for solving large block structured linear systems. We study the application of an aggregation-based grid transfer operator that transforms the symbol of a block Toeplitz matrix from matrix-valued to scalar-valued at the coarser level. Our convergence analysis of the two-grid method reveals the connection between the features of the scalar-valued symbol at the coarser level and the properties of the original matrix-valued one. This allows us to prove the convergence of a V-cycle multigrid with standard grid transfer operators for scalar Toeplitz systems at the coarser levels. Consequently, we extend the class of suitable smoothers for block Toeplitz matrices, focusing on the efficiency of block strategies, particularly the relaxed block Jacobi method. General conditions on smoothing parameters are derived, with emphasis on practical applications where these parameters can be calculated with negligible computational cost. We test the proposed strategies on linear systems stemming from the discretization of differential problems with the Qd Lagrangian finite element method or B-spline with nonmaximal regularity. The numerical results show in both cases computational advantages compared to existing methods for block structured linear systems. [ABSTRACT FROM AUTHOR]
Copyright of SIAM Journal on Matrix Analysis & Applications is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Description
Abstract:We present novel improvements in the context of symbol-based multigrid procedures for solving large block structured linear systems. We study the application of an aggregation-based grid transfer operator that transforms the symbol of a block Toeplitz matrix from matrix-valued to scalar-valued at the coarser level. Our convergence analysis of the two-grid method reveals the connection between the features of the scalar-valued symbol at the coarser level and the properties of the original matrix-valued one. This allows us to prove the convergence of a V-cycle multigrid with standard grid transfer operators for scalar Toeplitz systems at the coarser levels. Consequently, we extend the class of suitable smoothers for block Toeplitz matrices, focusing on the efficiency of block strategies, particularly the relaxed block Jacobi method. General conditions on smoothing parameters are derived, with emphasis on practical applications where these parameters can be calculated with negligible computational cost. We test the proposed strategies on linear systems stemming from the discretization of differential problems with the Qd Lagrangian finite element method or B-spline with nonmaximal regularity. The numerical results show in both cases computational advantages compared to existing methods for block structured linear systems. [ABSTRACT FROM AUTHOR]
ISSN:08954798
DOI:10.1137/24M1655147