Average case complexity of elliptic partial differential equations (Q1262102)

From MaRDI portal
Revision as of 18:00, 17 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Average case complexity of elliptic partial differential equations
scientific article

    Statements

    Average case complexity of elliptic partial differential equations (English)
    0 references
    1989
    0 references
    The author obtains tight complexity bounds for the approximate solution of elliptic partial differential equations in the worst case setting, and finds conditions that are necessary and sufficient for the finite element method to be an almost optimal complexity algorithm. Since these bounds show that elliptic partial differential equations are intractable in the worst case setting, it is natural to seek another setting in which partial differential equations are tractable. With this in mind, the author looks at the average case setting. Moreover, the author shows that the finite element method with properly chosen parameters is an almost optimal complexity algorithm in the average case.
    0 references
    0 references
    worst case setting
    0 references
    finite element method
    0 references
    almost optimal complexity algorithm
    0 references
    average case setting
    0 references

    Identifiers