Computing Fekete and Lebesgue points: Simplex, square, disk
From MaRDI portal
Publication:765300
DOI10.1016/j.cam.2011.12.006zbMath1242.41002OpenAlexW2122765466MaRDI QIDQ765300
Marco Vianello, Matteo Briani, Alvise Sommariva
Publication date: 19 March 2012
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2011.12.006
Related Items
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, Symmetric and asymmetric Gauss and Gauss-Lobatto quadrature rules for triangles and their applications to high-order finite element analyses, Generation of point sets by convex optimization for interpolation in reproducing kernel Hilbert spaces, Dispersion relation reconstruction for 2D photonic crystals based on polynomial interpolation, Algebraic Multigrid Schemes for High-Order Nodal Discontinuous Galerkin Methods, Computing almost minimal formulas on the square, 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, LEBFEK, Computing Fekete and Lebesgue points: Simplex, square, disk
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \texttt{Padua2DM}: Fast interpolation and cubature at the Padua points in \texttt{MATLAB/Octave}
- Computing Fekete and Lebesgue points: Simplex, square, disk
- On projection constants of polynomial spaces on the unit ball in several variables
- Bivariate Lagrange interpolation at the Padua points: the generating curve approach
- An explicit construction of interpolation nodes on the simplex
- Uniform approximation by discrete least squares polynomials
- Computing approximate Fekete points by QR factorizations of Vandermonde matrices
- On the spacing of Fekete points for a sphere, ball or simplex
- On certain configurations of points in \(\mathbb{R}{}^ n\) which are unisolvent for polynomial interpolation
- Spectral methods on triangles and other domains
- Bivariate polynomial interpolation on the square at new nodal sets
- Improved Lebesgue constants on the triangle
- Spectral element methods on triangles and quadrilaterals: Comparisons and applications
- Spectral element methods on unstructured meshes: Which interpolation points?
- A numerical comparison of seven grids for polynomial interpolation on the interval
- Polynomial interpolation in several variables
- Approximate optimal points for polynomial interpolation of real functions in an interval and in a triangle
- Bivariate Lagrange interpolation at the Padua points: The ideal theory approach
- An Algorithm for Computing Fekete Points in the Triangle
- Tensor product Gauss-Lobatto points are Fekete points for the cube
- Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra
- Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
- Low cardinality admissible meshes on quadrangles, triangles and disks
- From Electrostatics to Almost Optimal Nodal Sets for Polynomial Interpolation in a Simplex
- A Lobatto interpolation grid over the triangle
