LEBFEK

swMATH32027MaRDI QIDQ43738FDOQ43738

Author name not available (Why is that?)

Described by source

• Computing Fekete and Lebesgue points: Simplex, square, disk

Cited In (17)

• Generation of point sets by convex optimization for interpolation in reproducing kernel Hilbert spaces
• A Comparison of High Order Interpolation Nodes for the Pyramid
• On the numerical computation of bivariate Lagrange polynomials
• Dispersion analysis of triangle-based spectral element methods for elastic wave propagation
• Interpolation on the disk
• Higher-order triangular spectral element method with optimized cubature points for seismic wavefield modeling
• On Lagrange polynomials and the rate of approximation of planar sets by polynomial Julia sets
• Polynomial fitting and interpolation on circular sections
• Stability properties of disk polynomials
• On the generation of symmetric Lebesgue-like points in the triangle
• Polynomial approximation and cubature at approximate Fekete and Leja points of the cylinder
• Kernel-based interpolation at approximate Fekete points
• Unisolvency for polynomial interpolation in simplices with symmetrical nodal distributions
• A differential quadrature hierarchical finite element method using Fekete points for triangles and tetrahedrons and its applications to structural vibration
• On the computation of sets of points with low Lebesgue constant on the unit disk
• Optimal sampling patterns for Zernike polynomials
• Algebraic Multigrid Schemes for High-Order Nodal Discontinuous Galerkin Methods

This page was built for software: LEBFEK