About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

Dalík, Josef
Complexity of the method of averaging. (English). In: Chleboun, J., Přikryl, P., Segeth, K. and Šístek, J. (eds.): Programs and Algorithms of Numerical Mathematics. Proceedings of Seminar. Dolní Maxov, June 6-11, 2010. Institute of Mathematics AS CR, Prague, 2010. pp. 65-77
MSC: 65D25, 65N15, 65N30
Keywords:
finite element method; superapproximation of derivatives; simplicial triangulations; averaging partial derivatives
Summary:
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 $\mathcal T$ of a bounded polytopic domain in $\Re^d$ for any $d\geq 2$ is described and its complexity is analysed.
Partner of
EuDML logo