Generalized grid transfer operators for multigrid methods applied on Toeplitz matrices

Verfasser / Beitragende:
[Matthias Bolten, Marco Donatelli, Thomas Huckle, Christos Kravvaritis]
Ort, Verlag, Jahr:
2015
Enthalten in:
BIT Numerical Mathematics, 55/2(2015-06-01), 341-366
Format:
Artikel (online)
ID: 605497176
LEADER caa a22 4500
001 605497176
003 CHVBK
005 20210128100540.0
007 cr unu---uuuuu
008 210128e20150601xx s 000 0 eng
024 7 0 |a 10.1007/s10543-014-0512-2  |2 doi 
035 |a (NATIONALLICENCE)springer-10.1007/s10543-014-0512-2 
245 0 0 |a Generalized grid transfer operators for multigrid methods applied on Toeplitz matrices  |h [Elektronische Daten]  |c [Matthias Bolten, Marco Donatelli, Thomas Huckle, Christos Kravvaritis] 
520 3 |a In this paper we discuss classical sufficient conditions to be satisfied from the grid transfer operators in order to obtain optimal two-grid and V-cycle multigrid methods utilizing the theory for Toeplitz matrices. We derive relaxed conditions that allow the construction of special grid transfer operators that are computationally less expensive while preserving optimality. This is particularly useful when the generating symbol of the system matrix has a zero of higher order, like in the case of higher order PDEs. These newly derived conditions allow the use of rank deficient grid transfer operators. In this case the use of a pre-relaxation iteration that is lacking the smoothing property is proposed. Combining these pre-relaxations with the new rank deficient grid transfer operators yields a substantial reduction of the convergence rate and of the computational cost at each iteration compared with the classical choice for Toeplitz matrices. The proposed strategy, i.e. a rank deficient grid transfer operator plus a specific pre-relaxation, is applied to linear systems whose system matrix is a Toeplitz matrix where the generating symbol is a high-order polynomial. The necessity of using high-order polynomials as generating symbols for the grid transfer operators usually destroys the Toeplitz structure on the coarser levels. Therefore, we discuss some effective and computational cheap coarsening strategies found in the literature. In particular, we present numerical results showing near-optimal behavior while keeping the Toeplitz structure on the coarser levels. 
540 |a Springer Science+Business Media Dordrecht, 2014 
690 7 |a Multigrid methods  |2 nationallicence 
690 7 |a Toeplitz matrices  |2 nationallicence 
690 7 |a Grid transfer operators  |2 nationallicence 
700 1 |a Bolten  |D Matthias  |u Department of Mathematics and Science, University of Wuppertal, 42097, Wuppertal, Germany  |4 aut 
700 1 |a Donatelli  |D Marco  |u Dipartimento di Scienza e Alta Tecnologia, Università dell'Insubria, Via Valleggio 11, 22100, Como, Italy  |4 aut 
700 1 |a Huckle  |D Thomas  |u Department of Informatics, Technical University of Munich, Boltzmannstr. 3, 85748, Garching, Germany  |4 aut 
700 1 |a Kravvaritis  |D Christos  |u Department of Mathematics, University of Athens, Panepistimioupolis, 157 84, Athens, Greece  |4 aut 
773 0 |t BIT Numerical Mathematics  |d Springer Netherlands  |g 55/2(2015-06-01), 341-366  |x 0006-3835  |q 55:2<341  |1 2015  |2 55  |o 10543 
856 4 0 |u https://doi.org/10.1007/s10543-014-0512-2  |q text/html  |z Onlinezugriff via DOI 
898 |a BK010053  |b XK010053  |c XK010000 
900 7 |a Metadata rights reserved  |b Springer special CC-BY-NC licence  |2 nationallicence 
908 |D 1  |a research-article  |2 jats 
949 |B NATIONALLICENCE  |F NATIONALLICENCE  |b NL-springer 
950 |B NATIONALLICENCE  |P 856  |E 40  |u https://doi.org/10.1007/s10543-014-0512-2  |q text/html  |z Onlinezugriff via DOI 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Bolten  |D Matthias  |u Department of Mathematics and Science, University of Wuppertal, 42097, Wuppertal, Germany  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Donatelli  |D Marco  |u Dipartimento di Scienza e Alta Tecnologia, Università dell'Insubria, Via Valleggio 11, 22100, Como, Italy  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Huckle  |D Thomas  |u Department of Informatics, Technical University of Munich, Boltzmannstr. 3, 85748, Garching, Germany  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Kravvaritis  |D Christos  |u Department of Mathematics, University of Athens, Panepistimioupolis, 157 84, Athens, Greece  |4 aut 
950 |B NATIONALLICENCE  |P 773  |E 0-  |t BIT Numerical Mathematics  |d Springer Netherlands  |g 55/2(2015-06-01), 341-366  |x 0006-3835  |q 55:2<341  |1 2015  |2 55  |o 10543