Displaying similar documents to “Best Error Bounds for Approximation by Piecewise Polynomial Functions”

Complementarity - the way towards guaranteed error estimates

Vejchodský, Tomáš

Similarity:

This paper presents a review of the complementary technique with the emphasis on computable and guaranteed upper bounds of the approximation error. For simplicity, the approach is described on a numerical solution of the Poisson problem. We derive the complementary error bounds, prove their fundamental properties, present the method of hypercircle, mention possible generalizations and show a couple of numerical examples.

Optimization of Rational Approximations by Continued Fractions

Blomquist, Frithjof (2007)

Serdica Journal of Computing

Similarity:

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006. To get guaranteed machine enclosures of a special function f(x), an upper bound ε(f) of the relative error is needed, where ε(f) itself depends on the error bounds ε(app); ε(eval) of the approximation and evaluation error respectively. The approximation function g(x) ≈ f(x) is a rational function (Remez algorithm), and with sufficiently high...

Robust error analysis for the approximation of degree-one Ginzburg-Landau vortices

Sören Bartels (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

This article discusses the numerical approximation of time dependent Ginzburg-Landau equations. Optimal error estimates which are robust with respect to a large Ginzburg-Landau parameter are established for a semi-discrete in time and a fully discrete approximation scheme. The proofs rely on an asymptotic expansion of the exact solution and a stability result for degree-one Ginzburg-Landau vortices. The error bounds prove that degree-one vortices can be approximated robustly while...