Sparse-grid Sampling Recovery and Numerical Integration of Functions Having Mixed Smoothness

被引:0
作者
Dung, Dinh [1 ]
机构
[1] Vietnam Natl Univ, Informat Technol Inst, 144 Xuan Thuy,Cau Giay, Hanoi, Vietnam
关键词
Sampling recovery; Sampling widths; Numerical weighted integration; Quadrature; Unweighted and weighted Sobolev spaces of mixed smoothness; Sparse grids; Hyperbolic crosses in the function domain; Asymptotic order; OPTIMAL ORDER; SPACES; SOBOLEV; QUADRATURE; BOUNDS; RULES; ERROR; CUBATURE;
D O I
10.1007/s40306-024-00527-7
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We give a short survey of recent results on sparse-grid linear algorithms of approximate recovery and integration of functions possessing a unweighted or weighted Sobolev mixed smoothness based on their sampled values at a certain finite set. Some of them are extended to more general cases.
引用
收藏
页码:377 / 426
页数:50
相关论文
共 50 条
[1]  
Bakhvalov N., 1963, ZH VYCH MAT MAT FIZ, V4, P5
[2]   DYNAMIC PROGRAMMING [J].
BELLMAN, R .
SCIENCE, 1966, 153 (3731) :34-&
[3]  
Besov O., 1974, P STEKLOV I MATH, V131, P1
[4]  
Bungartz HJ, 2004, ACT NUMERIC, V13, P147, DOI 10.1017/S0962492904000182
[5]   Optimal sampling recovery of mixed order Sobolev embeddings via discrete Littlewood-Paley type characterizations [J].
Byrenheid, G. ;
Ullrich, T. .
ANALYSIS MATHEMATICA, 2017, 43 (02) :133-191
[6]   Sampling on energy-norm based sparse grids for the optimal recovery of Sobolev type functions in Hγ [J].
Byrenheid, Glenn ;
Dung, Dinh ;
Sickel, Winfried ;
Ullrich, Tino .
JOURNAL OF APPROXIMATION THEORY, 2016, 207 :207-231
[7]  
Chui C.K., 1992, An Introduction to Wavelets
[8]   Linear vs. nonlinear algorithms for linear problems [J].
Creutzig, J ;
Wojtaszczyk, P .
JOURNAL OF COMPLEXITY, 2004, 20 (06) :807-820
[9]   Random points are good for universal discretization [J].
Dai, F. ;
Temlyakov, V. .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2024, 529 (01)
[10]   Gaussian rules on unbounded intervals [J].
Della Vecchia, B ;
Mastroianni, G .
JOURNAL OF COMPLEXITY, 2003, 19 (03) :247-258