REVIEW 1 cited by
Polynomial of best uniform approximation to x⁻¹ and smoothing in two-level methods
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Polynomial of best uniform approximation to x⁻¹ and smoothing in two-level methods
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.
Forward citations
Cited by 1 Pith paper
-
The matrix-vector complexity of $Ax=b$
Randomized matrix-vector algorithms need Ω(κ log(1/ε)) products for general linear systems (two-sided) and n products without the transpose, matching CGNE and GMRES.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.