2,033 research outputs found

    Spectral multigrid methods for the solution of homogeneous turbulence problems

    Get PDF
    New three-dimensional spectral multigrid algorithms are analyzed and implemented to solve the variable coefficient Helmholtz equation. Periodicity is assumed in all three directions which leads to a Fourier collocation representation. Convergence rates are theoretically predicted and confirmed through numerical tests. Residual averaging results in a spectral radius of 0.2 for the variable coefficient Poisson equation. In general, non-stationary Richardson must be used for the Helmholtz equation. The algorithms developed are applied to the large-eddy simulation of incompressible isotropic turbulence

    Local Fourier Analysis of the Complex Shifted Laplacian preconditioner for Helmholtz problems

    Full text link
    In this paper we solve the Helmholtz equation with multigrid preconditioned Krylov subspace methods. The class of Shifted Laplacian preconditioners are known to significantly speed-up Krylov convergence. However, these preconditioners have a parameter beta, a measure of the complex shift. Due to contradictory requirements for the multigrid and Krylov convergence, the choice of this shift parameter can be a bottleneck in applying the method. In this paper, we propose a wavenumber-dependent minimal complex shift parameter which is predicted by a rigorous k-grid Local Fourier Analysis (LFA) of the multigrid scheme. We claim that, given any (regionally constant) wavenumber, this minimal complex shift parameter provides the reader with a parameter choice that leads to efficient Krylov convergence. Numerical experiments in one and two spatial dimensions validate the theoretical results. It appears that the proposed complex shift is both the minimal requirement for a multigrid V-cycle to converge, as well as being near-optimal in terms of Krylov iteration count.Comment: 20 page

    HP-multigrid as smoother algorithm for higher order discontinuous Galerkin discretizations of advection dominated flows. Part II. Optimization of the Runge-Kutta smoother

    Get PDF
    Using a detailed multilevel analysis of the complete hp-Multigrid as Smoother algorithm accurate predictions are obtained of the spectral radius and operator norms of the multigrid error transformation operator. This multilevel analysis is used to optimize the coefficients in the semi-implicit Runge-Kutta smoother, such that the spectral radius of the multigrid error transformation operator is minimal under properly chosen constraints. The Runge-Kutta coefficients for a wide range of cell Reynolds numbers and a detailed analysis of the performance of the hp-MGS algorithm are presented. In addition, the computational complexity of the hp-MGS algorithm is investigated. The hp-MGS algorithm is tested on a fourth order accurate space-time discontinuous Galerkin finite element discretization of the advection-diffusion equation for a number of model problems, which include thin boundary layers and highly stretched meshes, and a non-constant advection velocity. For all test cases excellent multigrid convergence is obtained

    Spectral methods for CFD

    Get PDF
    One of the objectives of these notes is to provide a basic introduction to spectral methods with a particular emphasis on applications to computational fluid dynamics. Another objective is to summarize some of the most important developments in spectral methods in the last two years. The fundamentals of spectral methods for simple problems will be covered in depth, and the essential elements of several fluid dynamical applications will be sketched

    Multigrid Methods in Lattice Field Computations

    Full text link
    The multigrid methodology is reviewed. By integrating numerical processes at all scales of a problem, it seeks to perform various computational tasks at a cost that rises as slowly as possible as a function of nn, the number of degrees of freedom in the problem. Current and potential benefits for lattice field computations are outlined. They include: O(n)O(n) solution of Dirac equations; just O(1)O(1) operations in updating the solution (upon any local change of data, including the gauge field); similar efficiency in gauge fixing and updating; O(1)O(1) operations in updating the inverse matrix and in calculating the change in the logarithm of its determinant; O(n)O(n) operations per producing each independent configuration in statistical simulations (eliminating CSD), and, more important, effectively just O(1)O(1) operations per each independent measurement (eliminating the volume factor as well). These potential capabilities have been demonstrated on simple model problems. Extensions to real life are explored.Comment: 4

    Spectral methods for partial differential equations

    Get PDF
    Origins of spectral methods, especially their relation to the Method of Weighted Residuals, are surveyed. Basic Fourier, Chebyshev, and Legendre spectral concepts are reviewed, and demonstrated through application to simple model problems. Both collocation and tau methods are considered. These techniques are then applied to a number of difficult, nonlinear problems of hyperbolic, parabolic, elliptic, and mixed type. Fluid dynamical applications are emphasized

    Preconditioners for the spectral multigrid method

    Get PDF
    The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problems preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented
    • …
    corecore