Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 39 for “"Sparse grids"”.
-
High dimensional density estimation with sparse grids
… range of techniques which utilize the concept of Sparse Grids. This is a technique that exploits additional regularity assumptions to allow a more efficient grid based representation of a function. This grid like approach allows an efficient treatment of massive data sets, while still possessing a …
-
Spline Interpolation and Optimization on Sparse Grids
… of functions using only data defined on sparse grids. The sparse grids provide a dramatic reduction in data compared to full grids, and spline interpolants are constructed to serve as accurate and smooth surrogates to the underlying functions being optimized. Using this approach, the …
-
Essays on Sparse-Grids and Statistical-Learning Methods in Economics
… es un estudio sobre la implementación the Sparse Grid métodos para es el estudio de modelos económicos con muchas dimensiones. Llevado a cabo mediante aplicaciones noveles del método de Smolyak con el objetivo de favorecer la tratabilidad y obtener resultados preciso. Los resultados …
-
On-the-fly multilevel sparse grids for multiscale models of heterogeneous catalysis
… This work presents a multilevel “on-the-fly” sparse grid surrogate approach (ML-OTF-SG) for replacing these high-fidelity models with cheap-to-evaluate surrogates. Two main contributions are introduced for this purpose. First, an on-the-fly local refinement strategy is presented that …
-
A Non Intrusive Reduced Order Model via Sparse Grids for Parametric Neutron Transport
… of a reduced basis. In particular, a sparse grid implementation represented the basis of the ROM. By proving effective for problems of higher dimensionality and requiring no information regarding the underlying physics of the problem, sparse grids are shown to be a reliable approach …
-
On sparse tensor structures in lattice theory and applications of the polynomial collocation method based on sparse grids
… this dissertation considers the application of sparse grid collocation algorithms for the solution of parameter-dependent partial differential equations involving high dimensionality. We consider as applications a class of stochastic eigenvalue problems and a parameter-dependent complete …
-
Sparse Grid Interpolation
… numerical discretization schemes such as full grids su ers the curse of dimensionality which is still a roadblock for the numerical treatment of high-dimensional problems. The number of basis functions or nodes (grid points) have to be stored and processed depend exponentially on the number of …
-
Efficient estimation of coherent risk measures for risk-averse optimization problems governed by partial differential equations with random inputs
… random parameters, efficient methods, such as sparse grids, exist that substantially reduce the sample size. Unfortunately, many risk-averse formulations, such as semideviation and Conditional Value-at-Risk, introduce a non-smoothness in integrand. This work demonstrates that naive application …
-
Global sensitivity analysis of reactor parameters
… namely Monte Carlo, quasi-Monte Carlo and sparse grids methods are used, and their efficiency is compared. The modified technique is illustrated and tested on a two-group cross-section dependent problem. In all the cases considered, the results obtained with sparse grids achieved much …
-
Adaptive Sparse Grid Approaches to Polynomial Chaos Expansions for Uncertainty Quantification
… This dissertation explores the use of adaptive sparse grids to reduce the computational cost of determining a polynomial model surrogate while examining and implementing new adaptive techniques.</p><p>Determination of chaos coefficients using traditional tensor product quadrature suffers the …
-
Scalable Gaussian Processes in Modern Machine Learning
… that leverages inducing points with sparse grids; (iii) a distributed aggregation framework that fuses local GP experts via optimally weighted combination. These innovations reduce computational complexity from cubic to near-linear scaling while preserving rigorous uncertainty …
-
Scalable Gaussian Processes in Modern Machine Learning
… that leverages inducing points with sparse grids; (iii) a distributed aggregation framework that fuses local GP experts via optimally weighted combination. These innovations reduce computational complexity from cubic to near-linear scaling while preserving rigorous uncertainty …
-
Scalable Gaussian Processes in Modern Machine Learning
… that leverages inducing points with sparse grids; (iii) a distributed aggregation framework that fuses local GP experts via optimally weighted combination. These innovations reduce computational complexity from cubic to near-linear scaling while preserving rigorous uncertainty …
-
Scalable Gaussian Processes in Modern Machine Learning
… that leverages inducing points with sparse grids; (iii) a distributed aggregation framework that fuses local GP experts via optimally weighted combination. These innovations reduce computational complexity from cubic to near-linear scaling while preserving rigorous uncertainty …
-
Scalable Gaussian Processes in Modern Machine Learning
… that leverages inducing points with sparse grids; (iii) a distributed aggregation framework that fuses local GP experts via optimally weighted combination. These innovations reduce computational complexity from cubic to near-linear scaling while preserving rigorous uncertainty …
-
Scalable Gaussian Processes in Modern Machine Learning
… that leverages inducing points with sparse grids; (iii) a distributed aggregation framework that fuses local GP experts via optimally weighted combination. These innovations reduce computational complexity from cubic to near-linear scaling while preserving rigorous uncertainty …
-
Multi-fidelity sparse-grid-based surrogate models
… Carlo, multi-fidelity Kriging and multi-fidelity sparse grids to accelerate the estimation of outputs of high-fidelity models. At first, our approach provides a framework to sample the input parameter space on a sparse grid, and then use sparse grid interpolation as our surrogate. For accurate but …
Page 1 of 2