Polynomial approximation and cubature at approximate Fekete and Leja points of the cylinder
From MaRDI portal
(Redirected from Publication:450289)
Abstract: The paper deals with polynomial interpolation, least-square approximation and cubature of functions defined on the rectangular cylinder, , with the unit disk. The nodes used for these processes are the {it Approximate Fekete Points} (AFP) and the {it Discrete Leja Points} (DLP) extracted from suitable {it Weakly Admissible Meshes} (WAMs) of the cylinder. From the analysis of the growth of the Lebesgue constants, approximation and cubature errors, we show that the AFP and the DLP extracted from WAM are good points for polynomial approximation and numerical integration of functions defined on the cylinder.
Recommendations
- Computing approximate Fekete points by QR factorizations of Vandermonde matrices
- Computing Fekete and Lebesgue points: Simplex, square, disk
- On the calculation of approximate fekete points: the univariate case
- Polynomial interpolation and cubature over polygons
- Approximate cubature formulas with simple Gaussian nodes and with multiple fixed nodes
Cites work
- scientific article; zbMATH DE number 52146 (Why is no real title available?)
- scientific article; zbMATH DE number 1077997 (Why is no real title available?)
- A discretized Fourier orthogonal expansion in orthogonal polynomials on a cylinder
- Analytic transformations of admissible meshes
- Approximate Fekete points for weighted polynomial interpolation
- Bivariate Lagrange interpolation at the Padua points: the generating curve approach
- Computing Fekete and Lebesgue points: Simplex, square, disk
- Computing approximate Fekete points by QR factorizations of Vandermonde matrices
- Computing multivariate Fekete and Leja points by numerical linear algebra
- Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
- Least-squares polynomial approximation on weakly admissible meshes: Disk and triangle
- Low cardinality admissible meshes on quadrangles, triangles and disks
- New cubature formulae and hyperinterpolation in three variables
- On optimal polynomial meshes
- On the calculation of approximate fekete points: the univariate case
- Pseudo Leja sequences
- Small perturbations of polynomial meshes
- Uniform approximation by discrete least squares polynomials
- Weakly admissible meshes and discrete extremal sets
Cited in
(11)- On generalized least square approximation
- Optimal polynomial meshes exist on any multivariate convex domain
- The universal approximation capabilities of cylindrical approximate identity neural networks
- Tensor product Gauss-Lobatto points are Fekete points for the cube
- On the calculation of approximate fekete points: the univariate case
- Bernstein type inequalities on star-like domains in \(\mathbb{R}^d\) with application to norming sets
- Polynomial interpolation and cubature over polygons
- An overdetermined B-spline collocation method for Poisson problems on complex domains
- Marcinkiewicz-Zygmund type results in multivariate domains
- Cesàro summability of Fourier orthogonal expansions on the cylinder
- On the existence of optimal meshes in every convex domain on the plane
This page was built for publication: Polynomial approximation and cubature at approximate Fekete and Leja points of the cylinder
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450289)
