default search action
Dinh Dung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i13]Dinh Dung:
Weighted sampling recovery of functions with mixed smoothness. CoRR abs/2405.16400 (2024) - [i12]Dinh Dung:
Weighted hyperbolic cross polynomial approximation. CoRR abs/2407.19442 (2024) - [i11]Felix Bartel, Dinh Dung:
Sampling recovery in Bochner spaces and applications to parametric PDEs with random inputs. CoRR abs/2409.05050 (2024) - 2023
- [j22]Dinh Dung
:
Numerical weighted integration of functions having mixed smoothness. J. Complex. 78: 101757 (2023) - [j21]Dinh Dung
Deep ReLU neural network approximation in Bochner spaces and applications to parametric PDEs. J. Complex. 79: 101779 (2023) - [i10]Dinh Dung:
Sparse-grid sampling recovery and numerical integration of functions having mixed smoothness. CoRR abs/2309.04994 (2023) - 2022
- [i9]Dinh Dung, Van Kien Nguyen, Christoph Schwab, Jakob Zech:
Analyticity and sparsity in uncertainty quantification for PDEs with Gaussian random field inputs. CoRR abs/2201.01912 (2022) - [i8]Dinh Dung, Van Kien Nguyen:
Optimal numerical integration and approximation of functions on Rd equipped with Gaussian measure. CoRR abs/2207.01155 (2022) - [i7]Dinh Dung:
Numerical weighted integration of functions having mixed smoothness. CoRR abs/2208.09108 (2022) - 2021
- [j20]Dinh Dung
Deep ReLU neural networks in high-dimensional approximation. Neural Networks 142: 619-635 (2021) - [i6]Dinh Dung, Van Kien Nguyen:
High-dimensional nonlinear approximation by parametric manifolds in Hölder-Nikol'skii spaces of mixed smoothness. CoRR abs/2102.04370 (2021) - [i5]Dinh Dung, Van Kien Nguyen, Mai Xuan Thao:
Computation complexity of deep ReLU neural networks in high-dimensional approximation. CoRR abs/2103.00815 (2021) - [i4]Dinh Dung:
Collocation approximation by deep neural ReLU networks for parametric elliptic PDEs with lognormal inputs. CoRR abs/2111.05504 (2021) - [i3]Dinh Dung, Van Kien Nguyen, Duong Thanh Pham:
Deep ReLU neural network approximation of parametric and stochastic elliptic PDEs with lognormal inputs. CoRR abs/2111.05854 (2021) - 2020
- [j19]Dinh Dung
Dimension-dependent error estimates for sampling recovery on Smolyak grids based on B-spline quasi-interpolation. J. Approx. Theory 250 (2020) - [i2]Dinh Dung, Van Kien Nguyen:
Sparse-grid sampling recovery and deep ReLU neural networks in high-dimensional approximation. CoRR abs/2007.08729 (2020) - [i1]Dinh Dung, Charles A. Micchelli, Vu Nhat Huy:
Approximation by linear combinations of translates of a single function. CoRR abs/2012.08086 (2020)
2010 – 2019
- 2019
- [j18]Dinh Dung
Approximation by translates of a single function of functions in space induced by the convolution with a given function. Appl. Math. Comput. 361: 777-787 (2019) - 2018
- [j17]Dinh Dung
ε-dimension in infinite dimensional hyperbolic cross approximation and application to parametric elliptic PDEs. J. Complex. 46: 66-89 (2018) - 2017
- [j16]Markus Bachmayr, Albert Cohen, Dinh Dung
Fully Discrete Approximation of Parametric and Stochastic Elliptic PDEs. SIAM J. Numer. Anal. 55(5): 2151-2186 (2017) - 2016
- [j15]Dinh Dung
Sampling and Cubature on Sparse Grids Based on a B-spline Quasi-Interpolation. Found. Comput. Math. 16(5): 1193-1240 (2016) - [j14]Glenn Byrenheid
Sampling on energy-norm based sparse grids for the optimal recovery of Sobolev type functions in Hγ. J. Approx. Theory 207: 207-231 (2016) - [j13]Alexey Chernov, Dinh Dung
New explicit-in-dimension estimates for the cardinality of high-dimensional hyperbolic crosses and approximation of functions having mixed smoothness. J. Complex. 32(1): 92-121 (2016) - [j12]Dinh Dung
Hyperbolic cross approximation in infinite dimensions. J. Complex. 33: 55-88 (2016) - [j11]Dinh Dung
Corrigendum to "Multivariate approximation by translates of the Korobov function on Smolyak grids" [J. Complexity 29 (2013) 424-437]. J. Complex. 35: 124-125 (2016) - 2013
- [j10]Dinh Dung
N-Widths and ε-Dimensions for High-Dimensional Approximations. Found. Comput. Math. 13(6): 965-1003 (2013) - [j9]Dinh Dung:
Continuous algorithms in adaptive sampling recovery. J. Approx. Theory 166: 136-153 (2013) - [j8]Dinh Dung
Multivariate approximation by translates of the Korobov function on Smolyak grids. J. Complex. 29(6): 424-437 (2013) - 2012
- [j7]Dinh Dung
Erratum to: Optimal adaptive sampling recovery. Adv. Comput. Math. 36(4): 605-606 (2012) - 2011
- [j6]Dinh Dung
Optimal adaptive sampling recovery. Adv. Comput. Math. 34(1): 1-41 (2011) - [j5]Dinh Dung
Whitney type inequalities for local anisotropic polynomial approximation. J. Approx. Theory 163(11): 1590-1605 (2011) - [j4]Dinh Dung
B-spline quasi-interpolant representations and sampling recovery of functions with mixed smoothness. J. Complex. 27(6): 541-567 (2011)
2000 – 2009
- 2009
- [j3]Dinh Dung
Non-linear sampling recovery based on quasi-interpolant wavelet representations. Adv. Comput. Math. 30(4): 375-401 (2009) - 2005
- [j2]Dinh Dung
Polynomial projectors preserving homogeneous partial differential equations. J. Approx. Theory 135(2): 221-232 (2005) - 2001
- [j1]Dinh Dung
Non-linear Approximations Using Sets of Finite Cardinality or Finite Pseudo-dimension. J. Complex. 17(2): 467-492 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-10 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: