Least-squares polynomial approximation on weakly admissible meshes: Disk and triangle
DOI10.1016/J.CAM.2010.06.019zbMATH Open1200.65010OpenAlexW2057719321MaRDI QIDQ708286FDOQ708286
Alvise Sommariva, Len Bos, Marco Vianello
Publication date: 11 October 2010
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.2010.06.019
Recommendations
- Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
- Optimal polynomial admissible meshes on some classes of compact subsets of \(\mathbb{R}^d\)
- On optimal polynomial meshes
- Weak Galerkin finite element methods on polytopal meshes
- Weakly admissible meshes and discrete extremal sets
- Suboptimal polynomial meshes on planar Lipschitz domains
- Weak discrete maximum principle of finite element methods in convex polyhedra
- On polynomial approximation in the uniform norm by the discrete least squares method
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
- scientific article
triangleinterpolationnumerical examplessimplexpolygonsdiskweakly admissible meshesleast-squares polynomial approximation
Numerical smoothing, curve fitting (65D10) Multidimensional problems (41A63) Numerical interpolation (65D05) Approximation by polynomials (41A10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On projection constants of polynomial spaces on the unit ball in several variables
- Bivariate Lagrange interpolation at the Padua points: the generating curve approach
- Spectral methods on triangles and other domains
- Orthogonal polynomials of several variables
- Uniform approximation by discrete least squares polynomials
- Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
- Title not available (Why is that?)
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- Bivariate polynomial interpolation on the square at new nodal sets
- An algorithm for computing Fekete points in the triangle
- An explicit construction of interpolation nodes on the simplex
- Asymptotic behavior of Lebesgue constants in trigonometric interpolation
Cited In (12)
- Interpolation on the disk
- On extremal functions and V. Markov type polynomial inequality for certain subsets of \({\mathbb{R}}^N\)
- Polynomial fitting and interpolation on circular sections
- Polynomial approximation and cubature at approximate Fekete and Leja points of the cylinder
- On the computation of sets of points with low Lebesgue constant on the unit disk
- A mixed interpolation-regression approximation operator on the triangle
- Polynomial interpolation and cubature over polygons
- Small perturbations of polynomial meshes
- Suboptimal Polynomial Meshes on Planar Lipschitz Domains
- Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
- Low cardinality admissible meshes on quadrangles, triangles and disks
- Padua points and fake nodes for polynomial approximation: old, new and open problems
Uses Software
This page was built for publication: Least-squares polynomial approximation on weakly admissible meshes: Disk and triangle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708286)
