Computing approximate Fekete points by QR factorizations of Vandermonde matrices

From MaRDI portal
Publication:971636

DOI10.1016/j.camwa.2008.11.011zbMath1186.65028OpenAlexW2049049772WikidataQ114201611 ScholiaQ114201611MaRDI QIDQ971636

Alvise Sommariva, Marco Vianello

Publication date: 16 May 2010

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2008.11.011



Related Items

Polynomial fitting and interpolation on circular sections, Compression of Multivariate Discrete Measures and Applications, Boosted optimal weighted least-squares, Adaptively weighted numerical integration over arbitrary domains, Padua points and fake nodes for polynomial approximation: old, new and open problems, Polynomial chaos expansions for dependent random variables, Automatic computing of oscillatory integrals, A Comparison of High Order Interpolation Nodes for the Pyramid, Measure transformation and efficient quadrature in reduced-dimensional stochastic modeling of coupled problems, A faster interior-point method for sum-of-squares optimization, Sensitivity-enhanced generalized polynomial chaos for efficient uncertainty quantification, The collocation solution of Poisson problems based on approximate Fekete points, Weighted Approximate Fekete Points: Sampling for Least-Squares Polynomial Approximation, Polynomial interpolation and cubature over polygons, On the generation of symmetric Lebesgue-like points in the triangle, Polynomial approximation and cubature at approximate Fekete and Leja points of the cylinder, Spectral element methods on unstructured meshes: Which interpolation points?, Fekete polynomials and shapes of Julia sets, An overdetermined B-spline collocation method for Poisson problems on complex domains, Optimized Sampling for Multiscale Dynamics, Sum-of-Squares Optimization without Semidefinite Programming, A meshless finite difference method for elliptic interface problems based on pivoted QR decomposition, Polynomial approximation and quadrature on geographic rectangles, Sparse polynomial chaos expansions via compressed sensing and D-optimal design, Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points, Discrete weighted least-squares method for the Poisson and biharmonic problems on domains with smooth boundary, Adaptively weighted numerical integration in the finite cell method, Shape aware quadratures, Computing Fekete and Lebesgue points: Simplex, square, disk, Small perturbations of polynomial meshes, Near-optimal polynomial interpolation on spherical triangles, Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices, A Robust and Scalable Implementation of the Parks-McClellan Algorithm for Designing FIR Filters, On the Use of Compressed Polyhedral Quadrature Formulas in Embedded Interface Methods


Uses Software


Cites Work