Spectral element multigrid. I: Formulation and numerical results (Q1116663)

From MaRDI portal
Revision as of 10:31, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Spectral element multigrid. I: Formulation and numerical results
scientific article

    Statements

    Spectral element multigrid. I: Formulation and numerical results (English)
    0 references
    0 references
    0 references
    1987
    0 references
    A variational spectral element multigrid algorithm is proposed, and results are presented for a one-dimensional Poisson equation on a finite interval. The key features of the proposed algorithm are as follows: the nested spaces and associated hierarchical bases are intra-element, resulting in simple data structures and rapid tensor-product sum- factorization evaluations; smoothing is effected by readily constructed and efficiently inverted (diagonal) Jacobi preconditioners; the technique is readily parallelized within the context of a medium-grained paradigm; and the (work-deflated) multigrid convergence rate \({\bar \rho}\) is bounded from above well below unity, and is only a weak function of the number of spectral elements K, the (large) order of the polynomial approximation, N, and the number of multigrid levels, J. Preliminary tests indicate that these convergence properties persist in higher space dimensions.
    0 references
    p-type finite element
    0 references
    iterative methods
    0 references
    variational spectral element multigrid algorithm
    0 references
    one-dimensional Poisson equation
    0 references
    tensor-product sum-factorization evaluations
    0 references
    smoothing
    0 references
    Jacobi preconditioners
    0 references
    convergence
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references