Pages that link to "Item:Q971636"
From MaRDI portal
The following pages link to Computing approximate Fekete points by QR factorizations of Vandermonde matrices (Q971636):
Displaying 34 items.
- Polynomial fitting and interpolation on circular sections (Q300175) (← links)
- On the generation of symmetric Lebesgue-like points in the triangle (Q448470) (← links)
- Polynomial approximation and cubature at approximate Fekete and Leja points of the cylinder (Q450289) (← links)
- Discrete weighted least-squares method for the Poisson and biharmonic problems on domains with smooth boundary (Q547955) (← links)
- Polynomial interpolation and cubature over polygons (Q633980) (← links)
- Computing Fekete and Lebesgue points: Simplex, square, disk (Q765300) (← links)
- Polynomial approximation and quadrature on geographic rectangles (Q1735074) (← links)
- The collocation solution of Poisson problems based on approximate Fekete points (Q1944506) (← links)
- Spectral element methods on unstructured meshes: Which interpolation points? (Q1960250) (← links)
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design (Q1985532) (← links)
- Near-optimal polynomial interpolation on spherical triangles (Q2113576) (← links)
- Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices (Q2114109) (← links)
- Polynomial chaos expansions for dependent random variables (Q2173605) (← links)
- A meshless finite difference method for elliptic interface problems based on pivoted QR decomposition (Q2227758) (← links)
- Adaptively weighted numerical integration in the finite cell method (Q2308664) (← links)
- Shape aware quadratures (Q2312178) (← links)
- Adaptively weighted numerical integration over arbitrary domains (Q2397187) (← links)
- Automatic computing of oscillatory integrals (Q2413282) (← links)
- An overdetermined B-spline collocation method for Poisson problems on complex domains (Q2451071) (← links)
- Small perturbations of polynomial meshes (Q2841189) (← links)
- A Comparison of High Order Interpolation Nodes for the Pyramid (Q2947050) (← links)
- Measure transformation and efficient quadrature in reduced-dimensional stochastic modeling of coupled problems (Q2952142) (← links)
- Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points (Q3015049) (← links)
- Compression of Multivariate Discrete Measures and Applications (Q3453803) (← links)
- Weighted Approximate Fekete Points: Sampling for Least-Squares Polynomial Approximation (Q4603503) (← links)
- Optimized Sampling for Multiscale Dynamics (Q4627447) (← links)
- Sum-of-Squares Optimization without Semidefinite Programming (Q4629344) (← links)
- Boosted optimal weighted least-squares (Q5070542) (← links)
- Padua points and fake nodes for polynomial approximation: old, new and open problems (Q5078980) (← links)
- A Robust and Scalable Implementation of the Parks-McClellan Algorithm for Designing FIR Filters (Q5270769) (← links)
- On the Use of Compressed Polyhedral Quadrature Formulas in Embedded Interface Methods (Q5275044) (← links)
- Fekete polynomials and shapes of Julia sets (Q5380503) (← links)
- A faster interior-point method for sum-of-squares optimization (Q6053475) (← links)
- Sensitivity-enhanced generalized polynomial chaos for efficient uncertainty quantification (Q6095126) (← links)