Finite element preconditioning for spectral multigrid methods

DOI10.1016/S0096-3003(93)90039-HzbMath0795.65078MaRDI QIDQ1316108

Wilhelm Heinrichs

Publication date: 8 September 1994

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

Chebyshev polynomialspreconditioningfinite elementmultigrid iterationspectral multigrid methodssecond-order linear elliptic equationscollocation by tensor products

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

The Navier-Stokes-\(\alpha \beta\) equations as a platform for a spectral multigrid method to solve the Navier-Stokes equations, Spectral multigrid techniques for the Navier-Stokes equations, Spectral multigrid methods for domain decomposition problems using patching techniques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral multigrid methods for elliptic equations. II
• Self-sorting mixed-radix fast Fourier transforms
• Improved spectral multigrid methods for periodic elliptic problems
• Chebyshev pseudospectral solution of second-order elliptic equations with finite element preconditioning
• Line relaxation for spectral multigrid methods
• Multigrid methods for combined finite difference and Fourier problems
• Parallelism in spectral methods
• Black box multigrid
• Spectral multigrid methods for elliptic equations
• Direct methods for the solution of the discrete Poisson equation: some comparisons
• Boundary and interface conditions within a finite element preconditioner for spectral methods
• Boundary Conditions in Chebyshev and Legendre Methods
• The fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine and Laplace transforms