Computing approximate Fekete points by QR factorizations of Vandermonde matrices
From MaRDI portal
Publication:971636
Recommendations
- Fast QR factorization of Vandermonde matrices
- QR factorization of confluent Vandermonde matrices
- Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation
- Computing eigenvalues of quasi-generalized Vandermonde matrices to high relative accuracy
- Factorisation QR des matrices de Tchebychev–Vandermonde confluentes
- Fast QR factorization of low-rank changes of Vandermonde-like matrices
- Computing multivariate Fekete and Leja points by numerical linear algebra
- Exact computations with quasiseparable matrices
- Accurate computations of eigenvalues of quasi-Cauchy-Vandermonde matrices
- Computing eigenvalues of quasi‐rational Bernstein–Vandermonde matrices to high relative accuracy
Cites work
- scientific article; zbMATH DE number 2127831 (Why is no real title available?)
- scientific article; zbMATH DE number 3871971 (Why is no real title available?)
- scientific article; zbMATH DE number 4160951 (Why is no real title available?)
- scientific article; zbMATH DE number 3180502 (Why is no real title available?)
- scientific article; zbMATH DE number 1862742 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 3301601 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A BLAS-3 Version of the QR Factorization with Column Pivoting
- A Cardinal Function Algorithm for Computing Multivariate Quadrature Points
- An algorithm for computing Fekete points in the triangle
- An encyclopaedia of cubature formulas.
- Bivariate Lagrange interpolation at the Padua points: Computational aspects
- Bivariate Lagrange interpolation at the Padua points: The ideal theory approach
- Bivariate Lagrange interpolation at the Padua points: the generating curve approach
- Bivariate polynomial interpolation on the square at new nodal sets
- Exponential inapproximability of selecting a maximum volume sub-matrix
- Extremal systems of points and numerical integration on the sphere
- Gauss-Green cubature and moment computation over arbitrary geometries
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- Moments in quadrature problems
- Multivariate polynomial approximation
- Nontensorial Clenshaw-Curtis cubature
- On the calculation of approximate fekete points: the univariate case
- On the distribution of Fekete points
- On the spacing of Fekete points for a sphere, ball or simplex
- On the spectral condition of rectangular Vandermonde matrices
- Orthogonal polynomials of several variables
- Product Gauss cubature over polygons based on Green's integration formula
- Pseudometrics, distances and multivariate polynomial inequalities
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- Spectral element methods on unstructured meshes: comparisons and recent advances
- Tensor product Gauss-Lobatto points are Fekete points for the cube
- The theory of multi-dimensional polynomial approximation
- Uniform approximation by discrete least squares polynomials
Cited in
(45)- The Fekete problem in segmental polynomial interpolation
- Near-optimal polynomial interpolation on spherical triangles
- Optimized Sampling for Multiscale Dynamics
- Solving clustered low-rank semidefinite programs arising from polynomial optimization
- Shape aware quadratures
- High-order discontinuous Galerkin method for time-domain electromagnetics on geometry-independent Cartesian meshes
- On ``marcov inequalities
- Weighted approximate Fekete points: sampling for least-squares polynomial approximation
- SeAr PC: sensitivity enhanced arbitrary polynomial chaos
- Small perturbations of polynomial meshes
- Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices
- Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
- Computing Fekete and Lebesgue points: Simplex, square, disk
- Discrete weighted least-squares method for the Poisson and biharmonic problems on domains with smooth boundary
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design
- Sum-of-squares optimization without semidefinite programming
- Polynomial interpolation and cubature over polygons
- The collocation solution of Poisson problems based on approximate Fekete points
- Fekete polynomials and shapes of Julia sets
- Approximate Fekete points for weighted polynomial interpolation
- A comparison of high order interpolation nodes for the pyramid
- A meshless finite difference method for elliptic interface problems based on pivoted QR decomposition
- On the calculation of approximate fekete points: the univariate case
- A faster interior-point method for sum-of-squares optimization
- Measure transformation and efficient quadrature in reduced-dimensional stochastic modeling of coupled problems
- An overdetermined B-spline collocation method for Poisson problems on complex domains
- An algorithm for computing Fekete points in the triangle
- A robust and scalable implementation of the Parks-McClellan algorithm for designing FIR filters
- Sensitivity-enhanced generalized polynomial chaos for efficient uncertainty quantification
- Polynomial chaos expansions for dependent random variables
- On the Use of Compressed Polyhedral Quadrature Formulas in Embedded Interface Methods
- Adaptively weighted numerical integration over arbitrary domains
- Computing multivariate Fekete and Leja points by numerical linear algebra
- Compression of Multivariate Discrete Measures and Applications
- Adaptively weighted numerical integration in the finite cell method
- Boosted optimal weighted least-squares
- Polynomial approximation and quadrature on geographic rectangles
- On the generation of symmetric Lebesgue-like points in the triangle
- Polynomial approximation and cubature at approximate Fekete and Leja points of the cylinder
- Padua points and ``fake nodes for polynomial approximation: old, new and open problems
- Polynomial fitting and interpolation on circular sections
- Tensor product Gauss-Lobatto points are Fekete points for the cube
- Spectral element methods on unstructured meshes: Which interpolation points?
- An energy stable high-order cut cell discontinuous Galerkin method with state redistribution for wave propagation
- Automatic computing of oscillatory integrals
This page was built for publication: Computing approximate Fekete points by QR factorizations of Vandermonde matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q971636)
