Pith. sign in

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

arxiv 1002.1859 v3 pith:EEAP5ANK submitted 2010-02-09 math.NA cs.NA

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

classification math.NA cs.NA
keywords polynomialapproximationbesttwo-leveluniformmethodssmoothingaforementioned
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
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.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The matrix-vector complexity of $Ax=b$

    cs.DS 2026-02 conditional novelty 7.0

    Randomized matrix-vector algorithms need Ω(κ log(1/ε)) products for general linear systems (two-sided) and n products without the transpose, matching CGNE and GMRES.