Bounding the Lebesgue function for Lagrange interpolatin in a simplex

DOI10.1016/0021-9045(83)90140-5zbMATH Open0546.41003OpenAlexW2073726076MaRDI QIDQ798545FDOQ798545

Len Bos

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

Recommendations

• The Lebesgue constant for Lagrange interpolation in the simplex
• On the order of the Lebesgue constants for interpolation by algebraic polynomials from values at uniform nodes of a simplex
• scientific article; zbMATH DE number 3989997
• Lower bound for the Lebesgue function of an interpolation process with algebraic polynomials on equidistant nodes of a simplex
• scientific article

zbMATH Keywords

Lagrange interpolationLebesgue function

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Approximation by polynomials (41A10)

Cites Work

• A characterization of the Lagrange interpolating projection with minimal Tchebycheff norm
• Proof of the conjectures of Bernstein and Erdős concerning the optimal nodes for polynomial interpolation
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (45)

• On optimal designs for a \(d\)-cube
• The optimal symmetrical points for polynomial interpolation of real functions in the tetrahedron
• Title not available (Why is that?)
• Some remarks on the Fejér problem for Lagrange interpolation in several variables
• On local RBF approximation
• Error analysis of Lagrange interpolation on tetrahedrons
• Spectral Element Methods on Simplicial Meshes
• An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
• Spectral element methods on unstructured meshes: Which interpolation points?
• Higher-order triangular spectral element method with optimized cubature points for seismic wavefield modeling
• An adaptive least-squares spectral collocation method with triangular elements for the incompressible Navier-Stokes equations
• The mystery of the shape parameter. III
• Lower bound for the Lebesgue function of an interpolation process with algebraic polynomials on equidistant nodes of a simplex
• Polynomial interpolation at points of a geometric mesh on a triangle
• Discrete Fourier analysis on a dodecahedron and a tetrahedron
• A comparison of interpolation grids over the triangle or the tetrahedron
• Spectral (finite) volume method for conservation laws on unstructured grids. II: Extension to two-dimensional scalar equation
• Title not available (Why is that?)
• On the generation of symmetric Lebesgue-like points in the triangle
• The mystery of the shape parameter. IV
• Bounds on multivariate polynomials and exponential error estimates for multiquadric interpolation
• Recursive three-term recurrence relations for the Jacobi polynomials on a triangle
• Approximate optimal points for polynomial interpolation of real functions in an interval and in a triangle
• The Lebesgue constant for Lagrange interpolation in the simplex
• Title not available (Why is that?)
• Improved Lebesgue constants on the triangle
• On the convergence of multivariable Lagrange interpolants
• Two Formulas for the General Multivariate Polynomial Which Interpolates a Regular Grid on a Simplex
• The shape parameter in the Gaussian function. II
• A numerical comparison of seven grids for polynomial interpolation on the interval
• Improved approximation results on standard quartic polynomial optimization
• A direct prediction of the shape parameter -- a purely scattered data approach
• On certain configurations of points in \(\mathbb{R}{}^ n\) which are unisolvent for polynomial interpolation
• A pseudo-spectral scheme for the incompressible Navier-Stokes equations using unstructured nodal elements
• On Fekete points for a real simplex
• On the order of the Lebesgue constants for interpolation by algebraic polynomials from values at uniform nodes of a simplex
• A characteristic of points in \({\mathbb{R}}^ 2\) having Lebesgue function of polynomial growth
• An explicit construction of interpolation nodes on the simplex
• On the complexity of optimization over the standard simplex
• Interpolation on the sphere and bounds for the Lagrangian square sums
• The upper bound for the Lebesgue constant for Lagrange interpolation in equally spaced points of the triangle
• An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution
• On the convergence rate of grid search for polynomial optimization over the simplex
• Alternative proposal of the high-order Gauss quadrature for reference triangle in the generalized finite element method
• Dispersion analysis of the spectral element method using a triangular mesh

This page was built for publication: Bounding the Lebesgue function for Lagrange interpolatin in a simplex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798545)