Complexity of the method of averaging
- Programs and Algorithms of Numerical Mathematics, Publisher: Institute of Mathematics AS CR(Prague), page 65-77
Access Full Article
top
Abstract
topHow to cite
topDalík, Josef. "Complexity of the method of averaging." Programs and Algorithms of Numerical Mathematics. Prague: Institute of Mathematics AS CR, 2010. 65-77. <http://eudml.org/doc/271389>.
@inProceedings{Dalík2010,
abstract = {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\ge 2$ is described and its complexity is analysed.},
author = {Dalík, Josef},
booktitle = {Programs and Algorithms of Numerical Mathematics},
keywords = {finite element method; superapproximation of derivatives; simplicial triangulations; averaging partial derivatives},
location = {Prague},
pages = {65-77},
publisher = {Institute of Mathematics AS CR},
title = {Complexity of the method of averaging},
url = {http://eudml.org/doc/271389},
year = {2010},
}
TY - CLSWK
AU - Dalík, Josef
TI - Complexity of the method of averaging
T2 - Programs and Algorithms of Numerical Mathematics
PY - 2010
CY - Prague
PB - Institute of Mathematics AS CR
SP - 65
EP - 77
AB - 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\ge 2$ is described and its complexity is analysed.
KW - finite element method; superapproximation of derivatives; simplicial triangulations; averaging partial derivatives
UR - http://eudml.org/doc/271389
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.