Bounds for polynomials with a unit discrete norm
From MaRDI portal
Publication:880881
DOI10.4007/annals.2007.165.55zbMath1124.41014OpenAlexW2125839646MaRDI QIDQ880881
Publication date: 29 May 2007
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4007/annals.2007.165.55
Approximation by other special function classes (41A30) Miscellaneous topics of analysis in the complex plane (30E99)
Related Items
High-order matrix method with delimited expansion domain ⋮ Searching globally optimal parameter sequence for defeating Runge phenomenon by immunity genetic algorithm ⋮ Determining projection constants of univariate polynomial spaces ⋮ Comparison of the discrete and uniform norms of polynomials on an interval and a circular arc ⋮ Pseudo-Boolean functions and the multiplicity of the zeros of polynomials ⋮ A Fast Algorithm for the Convolution of Functions with Compact Support Using Fourier Extensions ⋮ Full recovery from point values: an optimal algorithm for Chebyshev approximability prior ⋮ Extremal polynomials on the \(n\)-grid ⋮ A simple regularization of the polynomial interpolation for the resolution of the Runge phenomenon ⋮ AAA interpolation of equispaced data ⋮ On the constrained mock-Chebyshev least-squares ⋮ Spectral methods in non-tensor geometry. II: Chebyshev versus Zernike polynomials, gridding strategies and spectral extension on squircle-bounded and perturbed-quadrifolium domains ⋮ On the Multiplicity of the Zeros of Polynomials with Constrained Coefficients ⋮ Remez-type inequality for discrete sets ⋮ On rational approximation of Markov functions on finite sets ⋮ A Mapped Polynomial Method for High-Accuracy Approximations on Arbitrary Grids ⋮ On a discrete norm for polynomials ⋮ Approximation on non-tensor domains including squircles. III: Polynomial hyperinterpolation and radial basis function interpolation on Chebyshev-like grids and truncated uniform grids ⋮ NORMING SETS AND RELATED REMEZ-TYPE INEQUALITIES ⋮ Divergence (Runge phenomenon) for least-squares polynomial approximation on an equispaced grid and mock-Chebyshev subset interpolation ⋮ The Fourier extension method and discrete orthogonal polynomials on an arc of the circle ⋮ A Windowed Fourier Method for Approximation of Non-periodic Functions on Equispaced Nodes ⋮ Zero distributions for discrete orthogonal polynomials ⋮ Initial Guesses for Sequences of Linear Systems in a GPU-Accelerated Incompressible Flow Solver ⋮ Remez-Type Inequality for Smooth Functions
