Pages that link to "Item:Q880881"

The following pages link to Bounds for polynomials with a unit discrete norm (Q880881):

Displaying 9 items.

• Comparison of the discrete and uniform norms of polynomials on an interval and a circular arc (Q378654) (← links)
• On the constrained mock-Chebyshev least-squares (Q484851) (← links)
• A simple regularization of the polynomial interpolation for the resolution of the Runge phenomenon (Q639401) (← links)
• Spectral methods in non-tensor geometry. II: Chebyshev versus Zernike polynomials, gridding strategies and spectral extension on squircle-bounded and perturbed-quadrifolium domains (Q668728) (← links)
• On a discrete norm for polynomials (Q714051) (← links)
• Approximation on non-tensor domains including squircles. III: Polynomial hyperinterpolation and radial basis function interpolation on Chebyshev-like grids and truncated uniform grids (Q728801) (← links)
• Pseudo-Boolean functions and the multiplicity of the zeros of polynomials (Q891348) (← links)
• High-order matrix method with delimited expansion domain (Q5887456) (← links)
• Full recovery from point values: an optimal algorithm for Chebyshev approximability prior (Q6171716) (← links)