Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points

From MaRDI portal
Publication:3015049

DOI10.1090/S0025-5718-2011-02442-7zbMath1228.41002arXiv0902.0215MaRDI QIDQ3015049

Jean-Paul Calvi, Norman Levenberg, Marco Vianello, Alvise Sommariva, L. P. Bos

Publication date: 8 July 2011

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0902.0215



Related Items

Optimal polynomial admissible meshes on some classes of compact subsets of \(\mathbb{R}^d\), Polynomial fitting and interpolation on circular sections, Compression of Multivariate Discrete Measures and Applications, Adaptive density tracking by quadrature for stochastic differential equations, Low-Order Preconditioning of High-Order Triangular Finite Elements, Suboptimal Polynomial Meshes on Planar Lipschitz Domains, Padua points and fake nodes for polynomial approximation: old, new and open problems, Polynomial chaos expansions for dependent random variables, A Comparison of High Order Interpolation Nodes for the Pyramid, Constructing Least-Squares Polynomial Approximations, Weighted Approximate Fekete Points: Sampling for Least-Squares Polynomial Approximation, Polynomial interpolation and cubature over polygons, Approximation of analytic sets with proper projection by algebraic sets, On the generation of symmetric Lebesgue-like points in the triangle, Polynomial approximation and cubature at approximate Fekete and Leja points of the cylinder, Pluripotential numerics, Pseudo Leja sequences, Effectively Subsampled Quadratures for Least Squares Polynomial Approximations, Multivariate polynomial interpolation using even and odd polynomials, On generalized least power approximation, A note on total degree polynomial optimization by Chebyshev grids, On the Lebesgue constant of Leja sequences for the unit disk and its applications to multivariate interpolation, Least-squares polynomial approximation on weakly admissible meshes: Disk and triangle, A new constructive and elementary proof of a Bernstein-Walsh theorem, improved to infinite order convergence, for functions \(C^\infty\) in an intricate but smooth two-dimensional real domain, On optimal polynomial meshes, On the computation of sets of points with low Lebesgue constant on the unit disk, Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization, Computing Fekete and Lebesgue points: Simplex, square, disk, Tchakaloff polynomial meshes, Near G-optimal Tchakaloff designs, Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies, Initial Guesses for Sequences of Linear Systems in a GPU-Accelerated Incompressible Flow Solver, Mapped polynomials and discontinuous kernels for Runge and Gibbs phenomena, Randomized weakly admissible meshes, Near-optimal polynomial interpolation on spherical triangles, A Robust and Scalable Implementation of the Parks-McClellan Algorithm for Designing FIR Filters


Uses Software


Cites Work