Dörfler marking with minimal cardinality is a linear complexity problem (Q5118851)

From MaRDI portal
scientific article; zbMATH DE number 7240965
Language Label Description Also known as
English
Dörfler marking with minimal cardinality is a linear complexity problem
scientific article; zbMATH DE number 7240965

    Statements

    Dörfler marking with minimal cardinality is a linear complexity problem (English)
    0 references
    0 references
    0 references
    27 August 2020
    0 references
    Dörfler marking criterion
    0 references
    adaptive finite element method
    0 references
    optimal complexity
    0 references

    Identifiers

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