Singular value decomposition versus sparse grids: refined complexity estimates
From MaRDI portal
Recommendations
Cited in
(16)- Regularity and convergence analysis in Sobolev and Hölder spaces for generalized Whittle-Matérn fields
- A weighted POD-reduction approach for parametrized PDE-constrained optimal control problems with random inputs and applications to environmental sciences
- Analysis of tensor approximation schemes for continuous functions
- A higher order perturbation approach for electromagnetic scattering problems on random domains
- A note on the construction of \(L\)-fold sparse tensor product spaces
- scientific article; zbMATH DE number 663830 (Why is no real title available?)
- On the construction of sparse tensor product spaces
- Approximation of bi-variate functions: singular value decomposition versus sparse grids
- Low-rank approximation of continuous functions in Sobolev spaces with dominating mixed smoothness
- A posteriori error analysis and adaptivity for high-dimensional elliptic and parabolic boundary value problems
- Low-rank tensor methods for partial differential equations
- Quantifying domain uncertainty in linear elasticity
- On the randomized SVD in infinite dimensions
- Weighted sparsity and sparse tensor networks for least squares approximation
- A discrete unified gas kinetic scheme with sparse velocity grid for rarefied gas flows
- On low-rank tensor train approximability for linear nearest neighbor systems
This page was built for publication: Singular value decomposition versus sparse grids: refined complexity estimates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5243251)
