Polynomial interpolation and cubature over polygons
From MaRDI portal
Publication:633980
DOI10.1016/j.cam.2011.05.013zbMath1221.65033OpenAlexW2037446380MaRDI QIDQ633980
Publication date: 2 August 2011
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.05.013
numerical examplespolynomial interpolationdiscrete extremal setsMatlab codealgebraic cubaturepolygon quadragulationQR and LU factorizationsrectangular Vandermonde matricesweakly admissible meshes
Related Items (14)
Discontinuous Galerkin solutions for elliptic problems on polygonal grids using arbitrary-order Bernstein-Bézier functions ⋮ Compression of Multivariate Discrete Measures and Applications ⋮ Suboptimal Polynomial Meshes on Planar Lipschitz Domains ⋮ An arbitrary order mixed virtual element formulation for coupled multi-dimensional flow problems ⋮ A node elimination algorithm for cubature of high-dimensional polytopes ⋮ Adaptive stochastic isogeometric analysis for nonlinear bending of thin functionally graded shells with material uncertainties ⋮ Computing almost minimal formulas on the square ⋮ Algebraic cubature on polygonal elements with a circular edge ⋮ Numerical hyperinterpolation over nonstandard planar regions ⋮ Taylor-type 1-step-ahead numerical differentiation rule for first-order derivative approximation and ZNN discretization ⋮ On the behaviour of constants in some polynomial inequalities ⋮ Polygint ⋮ Numerical quadrature on the intersection of planar disks ⋮ On the Use of Compressed Polyhedral Quadrature Formulas in Embedded Interface Methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Polynomial approximation and cubature at approximate Fekete and Leja points of the cylinder
- Fekete points and convergence towards equilibrium measures on complex manifolds
- Least-squares polynomial approximation on weakly admissible meshes: Disk and triangle
- Numerical integration over polygons using an eight-node quadrilateral spline finite element
- Uniform approximation by discrete least squares polynomials
- An adaptive numerical integration algorithm for polygons
- Computing approximate Fekete points by QR factorizations of Vandermonde matrices
- A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions
- Product Gauss cubature over polygons based on Green's integration formula
- On the spacing of Fekete points for a sphere, ball or simplex
- On selecting a maximum volume sub-matrix of a matrix and related problems
- Extremal systems of points and numerical integration on the sphere
- Experimental results on quadrangulations of sets of fixed points
- Stratified nested and related quadrature rules
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- 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
- Numerical integration over arbitrary polygonal domains based on Schwarz-Christoffel conformal mapping
- Spectral Methods
- Generalized Gaussian quadrature rules on arbitrary polygons
- A Cardinal Function Algorithm for Computing Multivariate Quadrature Points
This page was built for publication: Polynomial interpolation and cubature over polygons
