Approximation of bi-variate functions: singular value decomposition versus sparse grids
From MaRDI portal
Recommendations
- Singular value decomposition versus sparse grids: refined complexity estimates
- Sparse approximation of singularity functions
- An algorithm for low-rank approximation of bivariate functions using splines
- Sparse matrix approximations for multigrid methods
- Sparse grids and related approximation schemes for higher dimensional problems
- Approximation from sparse grids and function spaces of dominating mixed smoothness
- A Krylov subspace method for the approximation of bivariate matrix functions
- A least-squares method for sparse low rank approximation of multivariate functions
- An algorithm for multivariate function estimation based on hierarchically refined sparse grids
- Sparse grid approximation in weighted Wiener spaces
Cited in
(23)- Quantifying domain uncertainty in linear elasticity
- A black-box low-rank approximation algorithm for fast matrix assembly in isogeometric analysis
- Cubature, approximation, and isotropy in the hypercube
- On the decay rate of the singular values of bivariate functions
- A discrete unified gas kinetic scheme with sparse velocity grid for rarefied gas flows
- Low-rank tensor methods for partial differential equations
- Partial tensor decomposition for decoupling isogeometric Galerkin discretizations
- Low-rank approximation of continuous functions in Sobolev spaces with dominating mixed smoothness
- On the degree of ill-posedness of multi-dimensional magnetic particle imaging
- Analysis of tensor approximation schemes for continuous functions
- Second Moment Analysis for Robin Boundary Value Problems on Random Domains
- Recompression of Hadamard Products of Tensors in Tucker Format
- Analysis of the domain mapping method for elliptic diffusion problems on random domains
- Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
- Linear panel regressions with two-way unobserved heterogeneity
- A representer theorem for deep kernel learning
- Iterative low-rank approximation solvers for the extension method for fractional diffusion
- \(\mathcal{H}\)-matrix based second moment analysis for rough random fields and finite element discretizations
- Error-controlled model approximation for Gaussian process morphable models
- Regularity and convergence analysis in Sobolev and Hölder spaces for generalized Whittle-Matérn fields
- Singular value decomposition versus sparse grids: refined complexity estimates
- Hierarchical matrix approximation for the uncertainty quantification of potentials on random domains
- Efficient approximation of random fields for numerical applications.
This page was built for publication: Approximation of bi-variate functions: singular value decomposition versus sparse grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5398447)
