On the generation of symmetric Lebesgue-like points in the triangle
DOI10.1016/J.CAM.2011.11.023zbMATH Open1252.65193OpenAlexW2032466959MaRDI QIDQ448470FDOQ448470
Authors: Francesca Rapetti, Alvise Sommariva, Marco Vianello 
Publication date: 6 September 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.11.023
Recommendations
- Improved Lebesgue constants on the triangle
- The optimal symmetrical points for polynomial interpolation of real functions in the tetrahedron
- An algorithm for computing Fekete points in the triangle
- On the computation of sets of points with low Lebesgue constant on the unit disk
- High degree efficient symmetrical Gaussian quadrature rules for the triangle
trianglesymmetrynumerical examplesfinite element methodLebesgue constantbivariate polynomial interpolationsecond order elliptic equationLebesgue-type pointstriangular spectral elements
Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Cites Work
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Title not available (Why is that?)
- Computing Fekete and Lebesgue points: Simplex, square, disk
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Spectral Methods
- Approximate optimal points for polynomial interpolation of real functions in an interval and in a triangle
- Spectral methods on triangles and other domains
- Title not available (Why is that?)
- High-Order Methods for Incompressible Fluid Flow
- Uniform approximation by discrete least squares polynomials
- Weakly admissible meshes and discrete extremal sets
- Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
- Computing multivariate Fekete and Leja points by numerical linear algebra
- Computing approximate Fekete points by QR factorizations of Vandermonde matrices
- Spectral element methods on triangles and quadrilaterals: Comparisons and applications
- An algorithm for computing Fekete points in the triangle
- Thep-Version of the Finite Element Method
- Tensor product Gauss-Lobatto points are Fekete points for the cube
- An explicit construction of interpolation nodes on the simplex
- Spectral element methods on unstructured meshes: Which interpolation points?
- Basis Functions for Triangular and Quadrilateral High-Order Elements
- Polymorphic nodal elements and their application in discontinuous Galerkin methods
- Improved Lebesgue constants on the triangle
- On the spacing of Fekete points for a sphere, ball or simplex
- A numerical comparison of seven grids for polynomial interpolation on the interval
- Title not available (Why is that?)
- Bounding the Lebesgue function for Lagrange interpolatin in a simplex
Cited In (9)
- Recursive, Parameter-Free, Explicitly Defined Interpolation Nodes for Simplices
- Spectral element methods on simplicial meshes
- High order discontinuous Galerkin methods on simplicial elements for the elastodynamics equation
- Evaluating Lebesgue constants by Chebyshev polynomial meshes on cube, simplex, and ball
- Unisolvency for polynomial interpolation in simplices with symmetrical nodal distributions
- On the computation of sets of points with low Lebesgue constant on the unit disk
- A mixed interpolation-regression approximation operator on the triangle
- Improved Lebesgue constants on the triangle
- A comparison of high order interpolation nodes for the pyramid
Uses Software
This page was built for publication: On the generation of symmetric Lebesgue-like points in the triangle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q448470)
