Black box multigrid for nonsymmetric problems (Q789880): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Joel E. jun. Dendy / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Stephen F. McCormick / rank
 
Normal rank

Revision as of 05:20, 20 February 2024

scientific article
Language Label Description Also known as
English
Black box multigrid for nonsymmetric problems
scientific article

    Statements

    Black box multigrid for nonsymmetric problems (English)
    0 references
    1983
    0 references
    The essence of this paper is the extension of BOXMG [see the author, J. Comput. Phys. 48, 366-386 (1982; Zbl 0495.65047)] to scalar nonsymmetric equations. More specifically, BOXMG is a code originally designed to automatically solve the usual (logically rectangular) discretizations of linear elliptic equations with operators of the form \(L=-\nabla \cdot(D\nabla \cdot),\) where \(D>0\) need only be piecewise smooth. The basic solution process is a multigrid method where the critical choices of the interpolation and coarse grid operators are based automatically on the discrete operator itself. The present paper discusses the performance characteristics of an extension of BOXMG that includes elliptic operators with possibly dominant lower order terms, e.g. \[ L=-\nabla \cdot(D\nabla \cdot)+a\quad \partial \cdot /\partial x+b\quad \partial \cdot /\partial y. \]
    0 references
    black box multigrid
    0 references
    multigrid method
    0 references
    0 references

    Identifiers

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