Polynomial of best uniform approximation to $x^{-1}$ and smoothing in two-level methods
Numerical Analysis
2012-05-24 v3
Abstract
We derive a three-term recurrence relation for computing the polynomial of best approximation in the uniform norm to 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.
Keywords
Cite
@article{arxiv.1002.1859,
title = {Polynomial of best uniform approximation to $x^{-1}$ and smoothing in two-level methods},
author = {Johannes K. Kraus and Panayot S. Vassilevski and Ludmil T. Zikatanov},
journal= {arXiv preprint arXiv:1002.1859},
year = {2012}
}
Comments
23 pages 5 tables and 3 figures