A randomized tensor quadrature method for high dimensional polynomial approximation
From MaRDI portal
Recommendations
- Weighted discrete least-squares polynomial approximation using randomized quadratures
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Tensor-product approximation to operators and functions in high dimensions
- Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions
- Near-optimal sampling strategies for multivariate function approximation on general domains
Cites work
- A randomized algorithm for multivariate function approximation
- A randomized Kaczmarz algorithm with exponential convergence
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Almost sure convergence of the Kaczmarz algorithm with random measurements
- An accelerated randomized Kaczmarz algorithm
- Convergence acceleration of Kaczmarz's method
- High dimensional polynomial interpolation on sparse grids
- scientific article; zbMATH DE number 3321507 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- Randomized extended Kaczmarz for solving least squares
- Randomized Kaczmarz solver for noisy linear systems
- Sparse grids
- Weighted discrete least-squares polynomial approximation using randomized quadratures
Cited in
(14)- Sequential function approximation on arbitrarily distributed point sets
- Numerical aspects for approximating governing equations using data
- Sequential approximation of functions in Sobolev spaces using random samples
- Sequential function approximation with noisy data
- Quantification of uncertainty from high-dimensional scattered data via polynomial approximation
- Generating nested quadrature rules with positive weights based on arbitrary sample sets
- Adaptive Smolyak Pseudospectral Approximations
- Reconciling alternate methods for the determination of charge distributions: a probabilistic approach to high-dimensional least-squares approximations
- On efficient algorithms for computing near-best polynomial approximations to high-dimensional, Hilbert-valued functions from limited samples
- Computing statistical moments via tensorization of polynomial chaos expansions
- Uncertainty quantification for the random HIV dynamical model driven by drug adherence
- A low-rank matrix approach to compute polynomial approximations of smooth two-dimensional functions
- An efficient stochastic particle method for moderately high-dimensional nonlinear PDEs
- \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling
This page was built for publication: A randomized tensor quadrature method for high dimensional polynomial approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5357965)
