LEBFEK

swMATH32027MaRDI QIDQ43738

No author found.

Described by source

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

Related Items (17)

Polynomial fitting and interpolation on circular sections ⋮ 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 ⋮ A Comparison of High Order Interpolation Nodes for the Pyramid ⋮ Higher-order triangular spectral element method with optimized cubature points for seismic wavefield modeling ⋮ Generation of point sets by convex optimization for interpolation in reproducing kernel Hilbert spaces ⋮ Algebraic Multigrid Schemes for High-Order Nodal Discontinuous Galerkin Methods ⋮ On the generation of symmetric Lebesgue-like points in the triangle ⋮ Polynomial approximation and cubature at approximate Fekete and Leja points of the cylinder ⋮ On the numerical computation of bivariate Lagrange polynomials ⋮ Interpolation on the disk ⋮ Optimal sampling patterns for Zernike polynomials ⋮ On Lagrange polynomials and the rate of approximation of planar sets by polynomial Julia sets ⋮ Dispersion analysis of triangle-based spectral element methods for elastic wave propagation ⋮ Stability properties of disk polynomials ⋮ Kernel-based interpolation at approximate Fekete points ⋮ On the computation of sets of points with low Lebesgue constant on the unit disk

This page was built for software: LEBFEK