The following pages link to Sparse grids (Q5292940):
Displaying 50 items.
- Dimension-dependent error estimates for sampling recovery on Smolyak grids based on B-spline quasi-interpolation (Q2286231) (← links)
- Approximating mixed Hölder functions using random samples (Q2286458) (← links)
- Explicit error bounds for randomized Smolyak algorithms and an application to infinite-dimensional integration (Q2291479) (← links)
- Information based complexity for high dimensional sparse functions (Q2303421) (← links)
- A transport-based multifidelity preconditioner for Markov chain Monte Carlo (Q2305532) (← links)
- Tensor train approximation of moment equations for elliptic equations with lognormal coefficient (Q2308598) (← links)
- Non-stationary transport phenomena in networks of fractures: effective simulations and stochastic analysis (Q2308956) (← links)
- Multi-index stochastic collocation for random PDEs (Q2309190) (← links)
- High dimensional finite elements for two-scale Maxwell wave equations (Q2309249) (← links)
- Uncertainty quantification of geochemical and mechanical compaction in layered sedimentary basins (Q2310124) (← links)
- 3D volumetric isotopological meshing for finite element and isogeometric based reduced order modeling (Q2310240) (← links)
- Adaptive reduced-basis generation for reduced-order modeling for the solution of stochastic nondestructive evaluation problems (Q2310309) (← links)
- A sparse-grid isogeometric solver (Q2310938) (← links)
- Estimation of exciton diffusion lengths of organic semiconductors in random domains (Q2311495) (← links)
- Physics-informed neural networks: a deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations (Q2314336) (← links)
- A tensor decomposition algorithm for large ODEs with conservation laws (Q2324349) (← links)
- Fast multivariate log-concave density estimation (Q2337320) (← links)
- Precomputing strategy for Hamiltonian Monte Carlo method based on regularity in parameter space (Q2358919) (← links)
- Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation (Q2369947) (← links)
- A new algorithm for high-dimensional uncertainty quantification based on dimension-adaptive sparse grid approximation and reduced basis methods (Q2374649) (← links)
- Exploiting active subspaces to quantify uncertainty in the numerical simulation of the hyshot II scramjet (Q2374810) (← links)
- Sparse grid discontinuous Galerkin methods for high-dimensional elliptic equations (Q2375128) (← links)
- Reduced basis ANOVA methods for partial differential equations with high-dimensional random inputs (Q2375274) (← links)
- On the algebraic construction of sparse multilevel approximations of elliptic tensor product problems (Q2420707) (← links)
- Multiscale simulation of polymeric fluids using the sparse grid combination technique (Q2422928) (← links)
- Stochastic collocation approach with adaptive mesh refinement for parametric uncertainty analysis (Q2425303) (← links)
- An efficient approximate residual evaluation in the adaptive tensor product wavelet method (Q2441119) (← links)
- \(N\)-widths and \(\varepsilon \)-dimensions for high-dimensional approximations (Q2441423) (← links)
- Comparison of fast boundary element methods on parametric surfaces (Q2449938) (← links)
- On weak tractability of the Clenshaw-Curtis Smolyak algorithm (Q2451171) (← links)
- Cubature formulas for function spaces with moderate smoothness (Q2465307) (← links)
- Space-time adaptive finite difference method for European multi-asset options (Q2468901) (← links)
- Convergence of an adaptive semi-Lagrangian scheme for the Vlasov-Poisson system (Q2471690) (← links)
- A sparse grid space-time discretization scheme for parabolic problems (Q2471825) (← links)
- Fast construction of the Fejér and Clenshaw-Curtis quadrature rules (Q2492729) (← links)
- Fast evaluation of trigonometric polynomials from hyperbolic crosses (Q2498993) (← links)
- Sparse grid spaces for the numerical solution of the electronic Schrödinger equation (Q2574941) (← links)
- Adaptive finite difference methods for nonlinear elliptic and parabolic partial differential equations with free boundaries (Q2631051) (← links)
- Sparse-grid, reduced-basis Bayesian inversion (Q2631530) (← links)
- On optimal approximation in periodic Besov spaces (Q2633709) (← links)
- Fast discrete algorithms for sparse Fourier expansions of high dimensional functions (Q2655801) (← links)
- Sparse tensor product high dimensional finite elements for two-scale mixed problems (Q2658823) (← links)
- Learning multivariate functions with low-dimensional structures using polynomial bases (Q2667104) (← links)
- Multivariate quadrature rules on crosslet sparse grids (Q2672714) (← links)
- A convergent iterated quasi-interpolation for periodic domain and its applications to surface PDEs (Q2676803) (← links)
- Best \(n\)-term approximation of diagonal operators and application to function spaces with mixed smoothness (Q2678414) (← links)
- Stochastic collocation method for computing eigenspaces of parameter-dependent operators (Q2678965) (← links)
- Analysis of tensor approximation schemes for continuous functions (Q2684464) (← links)
- Sparse grid approximation in weighted Wiener spaces (Q2686579) (← links)
- Efficient parallelization for 3d-3v sparse grid particle-in-cell: shared memory architectures (Q2689623) (← links)
