Data mining with sparse grids using simplicial basis functions
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Computing
Variable Resolution Discretization in Optimal Control
Machine Learning
Experience with the Solution of a Finite Difference Discretization on Sparse Grids
NAA '00 Revised Papers from the Second International Conference on Numerical Analysis and Its Applications
Classification with sparse grids using simplicial basis functions
Intelligent Data Analysis
Sparse adaptive finite elements for radiative transfer
Journal of Computational Physics
Journal of Computational Physics
Journal of Computational Physics
Compact data structure and scalable algorithms for the sparse grid technique
Proceedings of the 16th ACM symposium on Principles and practice of parallel programming
Hierarchical Singular Value Decomposition of Tensors
SIAM Journal on Matrix Analysis and Applications
Characterization of discontinuities in high-dimensional stochastic problems on adaptive sparse grids
Journal of Computational Physics
An adaptive dimension decomposition and reselection method for reliability analysis
Structural and Multidisciplinary Optimization
An Adaptive Sparse Grid Semi-Lagrangian Scheme for First Order Hamilton-Jacobi Bellman Equations
Journal of Scientific Computing
Journal of Computational Physics
An Efficient Approximate Residual Evaluation in the Adaptive Tensor Product Wavelet Method
Journal of Scientific Computing
Hi-index | 0.02 |
We present a multilevel approach for the solution of partialdifferential equations. It is based on a multiscale basis which isconstructed from a one-dimensional multiscale basis by the tensorproduct approach. Together with the use of hash tables as datastructure, this allows in a simple way for adaptive refinement and is,due to the tensor product approach, well suited for higher dimensionalproblems. Also, the adaptive treatment of partial differentialequations, the discretization (involving finite differences) and thesolution (here by preconditioned BiCG) can be programmed easily. Wedescribe the basic features of the method, discuss the discretization,the solution and the refinement procedures and report on the results ofdifferent numerical experiments.—Author's Abstract