Complexity of the method of averaging

Dalík, Josef

Programs and Algorithms of Numerical Mathematics, GDML_Books, (2010), p. 65-77 / Harvested from

Résumé

The general method of averaging for the superapproximation of an arbitrary partial derivative of a smooth function in a vertex $a$ of a simplicial triangulation $𝒯$ of a bounded polytopic domain in $ℜ^{d}$ for any $d \geq 2$ is described and its complexity is analysed.

EUDML-ID : urn:eudml:doc:271389
Mots clés:
Mots clés:

@article{702741,
     title = {Complexity of the method of averaging},
     booktitle = {Programs and Algorithms of Numerical Mathematics},
     series = {GDML\_Books},
     publisher = {Institute of Mathematics AS CR},
     address = {Prague},
     year = {2010},
     pages = {65-77},
     url = {http://dml.mathdoc.fr/item/702741}
}

Dalík, Josef. Complexity of the method of averaging, dans Programs and Algorithms of Numerical Mathematics, GDML_Books,  (2010), pp. 65-77. http://gdmltest.u-ga.fr/item/702741/