Least-squares polynomial approximation on weakly admissible meshes: Disk and triangle
DOI10.1016/j.cam.2010.06.019zbMath1200.65010OpenAlexW2057719321MaRDI QIDQ708286
Alvise Sommariva, Marco Vianello, L. P. Bos
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
triangleinterpolationdisknumerical examplessimplexpolygonsweakly admissible meshesleast-squares polynomial approximation
Numerical smoothing, curve fitting (65D10) Numerical interpolation (65D05) Multidimensional problems (41A63) Approximation by polynomials (41A10)
Related Items (8)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Spectral methods on triangles and other domains
- Bivariate polynomial interpolation on the square at new nodal sets
- Asymptotic behavior of Lebesgue constants in trigonometric interpolation
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- An Algorithm for Computing Fekete Points in the Triangle
- Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
This page was built for publication: Least-squares polynomial approximation on weakly admissible meshes: Disk and triangle