pith. sign in

arxiv: 1002.1859 · v3 · pith:EEAP5ANKnew · submitted 2010-02-09 · 🧮 math.NA

Polynomial of best uniform approximation to x⁻¹ and smoothing in two-level methods

classification 🧮 math.NA
keywords polynomialapproximationbesttwo-leveluniformmethodssmoothingaforementioned
0
0 comments X
read the original abstract

We derive a three-term recurrence relation for computing the polynomial of best approximation in the uniform norm to $x^{-1}$ on a finite interval with positive endpoints. As application, we consider two-level methods for scalar elliptic partial differential equation (PDE), where the relaxation on the fine grid uses the aforementioned polynomial of best approximation. Based on a new smoothing property of this polynomial smoother that we prove, combined with a proper choice of the coarse space, we obtain as a corollary, that the convergence rate of the resulting two-level method is uniform with respect to the mesh parameters, coarsening ratio and PDE coefficient variation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.