3,019 research outputs found

    Bootstrap Multigrid for the Laplace-Beltrami Eigenvalue Problem

    Full text link
    This paper introduces bootstrap two-grid and multigrid finite element approximations to the Laplace-Beltrami (surface Laplacian) eigen-problem on a closed surface. The proposed multigrid method is suitable for recovering eigenvalues having large multiplicity, computing interior eigenvalues, and approximating the shifted indefinite eigen-problem. Convergence analysis is carried out for a simplified two-grid algorithm and numerical experiments are presented to illustrate the basic components and ideas behind the overall bootstrap multigrid approach

    Euler solutions using an implicit multigrid technique

    Get PDF
    A coarse-grid correction algorithm has been implemented into an implicit upwind Euler solver and tested for transonic airfoil problems. The Euler solver uses split-flux formulation and penta-diagonal scalar equations, respectively, for the explicit and implicit operators. The multigrid sequence starts at the fine grid level, then steps down to each coarse grid level to smooth error components using implicit operators. Estimate of residuals can be obtained by two approaches, which differ in the level where the residuals are collected. Both approaches will lead to a work reduction factor of 12 for a Mach 0.75 flow at 2 degrees incidence on a 65x26 grid. The work reduction factor is found to increase proportional to the number of grid levels

    Multigrid applied to singular perturbation problems

    Get PDF
    The solution of the singular perturbation problem by a multigrid algorithm is considered. Theoretical and experimental results for a number of different discretizations are presented. The theoretical and observed rates agree with the results developed in an earlier work of Kamowitz and Parter. In addition, the rate of convergence of the algorithm when the coarse grid operator is the natural finite difference analog of the fine grid operator is presented. This is in contrast to the case in the previous work where the Galerkin choice (I sup H sub h L sub h,I sup h sub H) was used for the coarse grid operators

    Spectrum of the Dirac Operator and Multigrid Algorithm with Dynamical Staggered Fermions

    Full text link
    Complete spectra of the staggered Dirac operator \Dirac are determined in quenched four-dimensional SU(2)SU(2) gauge fields, and also in the presence of dynamical fermions. Periodic as well as antiperiodic boundary conditions are used. An attempt is made to relate the performance of multigrid (MG) and conjugate gradient (CG) algorithms for propagators with the distribution of the eigenvalues of~\Dirac. The convergence of the CG algorithm is determined only by the condition number~κ\kappa and by the lattice size. Since~κ\kappa's do not vary significantly when quarks become dynamic, CG convergence in unquenched fields can be predicted from quenched simulations. On the other hand, MG convergence is not affected by~κ\kappa but depends on the spectrum in a more subtle way.Comment: 19 pages, 8 figures, HUB-IEP-94/12 and KL-TH 19/94; comes as a uuencoded tar-compressed .ps-fil
    corecore