Bounding the Lebesgue function for Lagrange interpolatin in a simplex
From MaRDI portal
Publication:798545
DOI10.1016/0021-9045(83)90140-5zbMath0546.41003OpenAlexW2073726076MaRDI QIDQ798545
Publication date: 1983
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(83)90140-5
Related Items (35)
Approximate optimal points for polynomial interpolation of real functions in an interval and in a triangle ⋮ The mystery of the shape parameter. IV ⋮ The optimal symmetrical points for polynomial interpolation of real functions in the tetrahedron ⋮ A comparison of interpolation grids over the triangle or the tetrahedron ⋮ An adaptive least-squares spectral collocation method with triangular elements for the incompressible Navier-Stokes equations ⋮ An explicit construction of interpolation nodes on the simplex ⋮ Higher-order triangular spectral element method with optimized cubature points for seismic wavefield modeling ⋮ Improved approximation results on standard quartic polynomial optimization ⋮ The upper bound for the Lebesgue constant for Lagrange interpolation in equally spaced points of the triangle ⋮ On Fekete points for a real simplex ⋮ The mystery of the shape parameter. III ⋮ Polynomial interpolation at points of a geometric mesh on a triangle ⋮ On the generation of symmetric Lebesgue-like points in the triangle ⋮ Alternative proposal of the high-order Gauss quadrature for reference triangle in the generalized finite element method ⋮ The Lebesgue constant for Lagrange interpolation in the simplex ⋮ Spectral element methods on unstructured meshes: Which interpolation points? ⋮ A numerical comparison of seven grids for polynomial interpolation on the interval ⋮ The shape parameter in the Gaussian function. II ⋮ On certain configurations of points in \(\mathbb{R}{}^ n\) which are unisolvent for polynomial interpolation ⋮ Recursive three-term recurrence relations for the Jacobi polynomials on a triangle ⋮ On the complexity of optimization over the standard simplex ⋮ Bounds on multivariate polynomials and exponential error estimates for multiquadric interpolation ⋮ On the convergence rate of grid search for polynomial optimization over the simplex ⋮ Dispersion analysis of the spectral element method using a triangular mesh ⋮ On local RBF approximation ⋮ Spectral (finite) volume method for conservation laws on unstructured grids. II: Extension to two-dimensional scalar equation ⋮ Error analysis of Lagrange interpolation on tetrahedrons ⋮ Spectral Element Methods on Simplicial Meshes ⋮ Discrete Fourier analysis on a dodecahedron and a tetrahedron ⋮ Improved Lebesgue constants on the triangle ⋮ On the convergence of multivariable Lagrange interpolants ⋮ A direct prediction of the shape parameter -- a purely scattered data approach ⋮ An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution ⋮ A pseudo-spectral scheme for the incompressible Navier-Stokes equations using unstructured nodal elements ⋮ An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
Cites Work
This page was built for publication: Bounding the Lebesgue function for Lagrange interpolatin in a simplex
