Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Bramble–Hilbert_lemma> ?p ?o. }
Showing items 1 to 19 of
19
with 100 items per page.
- Bramble–Hilbert_lemma abstract "In mathematics, particularly numerical analysis, the Bramble–Hilbert lemma, named after James H. Bramble and Stephen Hilbert, bounds the error of an approximation of a function by a polynomial of order at most in terms of derivatives of of order . Both the error of the approximation and the derivatives of are measured by norms on a bounded domain in . This is similar to classical numerical analysis, where, for example, the error of linear interpolation can be bounded using the second derivative of . However, the Bramble–Hilbert lemma applies in any number of dimensions, not just one dimension, and the approximation error and the derivatives of are measured by more general norms involving averages, not just the maximum norm.Additional assumptions on the domain are needed for the Bramble–Hilbert lemma to hold. Essentially, the boundary of the domain must be "reasonable". For example, domains that have a spike or a slit with zero angle at the tip are excluded. Lipschitz domains are reasonable enough, which includes convex domains and domains with continuously differentiable boundary. The main use of the Bramble–Hilbert lemma is to prove bounds on the error of interpolation of function by an operator that preserves polynomials of order up to , in terms of the derivatives of of order . This is an essential step in error estimates for the finite element method. The Bramble–Hilbert lemma is applied there on the domain consisting of one element (or, in some superconvergence results, a small number of elements).".
- Bramble–Hilbert_lemma wikiPageID "13925681".
- Bramble–Hilbert_lemma wikiPageRevisionID "603248372".
- Bramble–Hilbert_lemma author "Raytcho D. Lazarov".
- Bramble–Hilbert_lemma id "B/b130220".
- Bramble–Hilbert_lemma title "Bramble–Hilbert lemma".
- Bramble–Hilbert_lemma subject Category:Approximation_theory.
- Bramble–Hilbert_lemma subject Category:Finite_element_method.
- Bramble–Hilbert_lemma subject Category:Lemmas.
- Bramble–Hilbert_lemma comment "In mathematics, particularly numerical analysis, the Bramble–Hilbert lemma, named after James H. Bramble and Stephen Hilbert, bounds the error of an approximation of a function by a polynomial of order at most in terms of derivatives of of order . Both the error of the approximation and the derivatives of are measured by norms on a bounded domain in .".
- Bramble–Hilbert_lemma label "Bramble–Hilbert lemma".
- Bramble–Hilbert_lemma label "Lemma von Bramble-Hilbert".
- Bramble–Hilbert_lemma label "Lemme de Bramble-Hilbert".
- Bramble–Hilbert_lemma sameAs Bramble%E2%80%93Hilbert_lemma.
- Bramble–Hilbert_lemma sameAs Lemma_von_Bramble-Hilbert.
- Bramble–Hilbert_lemma sameAs Lemme_de_Bramble-Hilbert.
- Bramble–Hilbert_lemma sameAs Q1816909.
- Bramble–Hilbert_lemma sameAs Q1816909.
- Bramble–Hilbert_lemma wasDerivedFrom Bramble–Hilbert_lemma?oldid=603248372.