Compact Fourier Analysis for Designing Multigrid Methods

DOI10.1137/070702564zbMath1186.65037OpenAlexW2125682784MaRDI QIDQ5189686

Thomas Kilian Huckle

Publication date: 10 March 2010

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070702564

zbMATH Keywords

convergencesmoothingnumerical examplesFourier analysisgenerating functionmultigrid methodsPoisson equationmultilevel Toeplitz matricescoarse grid correctionsmoothing steptwo-grid step

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)

Related Items (11)

Sparse matrix approximations for multigrid methods ⋮ Function-based block multigrid strategy for a two-dimensional linear elasticity-type problem ⋮ Toeplitz momentary symbols: definition, results, and limitations in the spectral analysis of structured matrices ⋮ Automated local Fourier analysis (aLFA) ⋮ Multigrid methods for Toeplitz linear systems with different size reduction ⋮ Preconditioned HSS method for large multilevel block Toeplitz linear systems via the notion of matrix‐valued symbol ⋮ Determinant evaluations for binary circulant matrices ⋮ Smoothing and regularization with modified sparse approximate inverses ⋮ An algebraic generalization of local Fourier analysis for grid transfer operators in multigrid based on Toeplitz matrices ⋮ A Symbol-Based Analysis for Multigrid Methods for Block-Circulant and Block-Toeplitz Systems ⋮ A formalism for designing robust multigrid methods for Helmholtz-like problems

This page was built for publication: Compact Fourier Analysis for Designing Multigrid Methods