Mathematics of Computation · 1990 · 1.6K citations · 2 references
ComputingComputational EngineeringComputational GeometryFinite Element AnalysisFinite Element MethodsApproximation AlgorithmsConvergence AnalysisFinite Element DiscretizationFinite Element FormulationNumerical AlgorithmsWeak FormulationFinite Element SpacesInterpolation TheoryLagrange InterpolationPiecewise Continuous FunctionsPiecewise Polynomial ApproximationPiecewise Polynomial InterpolationPolynomial InterpolationSobolev Spaces
In this paper, we propose a modified Lagrange type interpolation operator to approximate functions in Sobolev spaces by continuous piecewise polynomials. In order to define interpolators for "rough" functions and to preserve piecewise polynomial boundary conditions, the approximated functions are averaged appropriately either on <italic>d</italic> - or <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="left-parenthesis d minus 1 right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>d</mml:mi> <mml:mo> − </mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">(d - 1)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -simplices to generate nodal values for the interpolation operator. This combination of averaging and interpolation is shown to be a projection, and optimal error estimates are proved for the projection error.
2