Searcharxiv⌕ Search

arXiv subjects

Duong Thanh Pham

Publications and source records attributed to Duong Thanh Pham.

4 recordsLinked to original sources

Approximation of PDE solution manifolds: Sparse-grid interpolation and quadrature

We study fully-discrete approximations and quadratures of infinite-variate functions in abstract Bochner spaces associated with a Hilbert space $X$ and an infinite-tensor-product Jacobi measure. For target infinite-variate functions taking values in $X$ which admit absolutely convergent Jacobi generalized polynomial chaos expansions, with suitable weighted summability conditions for the coefficient sequences, we generalize and improve prior results on construction of sequences of finite sparse-grid tensor-product polynomial interpolation approximations and quadratures, based on the univariate Chebyshev points. For a generic stable discretization of $X$ in terms of a dense sequence $(V_m)_{m \in \mathbb{N}_0}$ of finite-dimensional subspaces, we obtain fully-discrete, linear approximations in terms of so-called sparse-grid tensor-product projectors, with convergence rates of approximations as well as of sparse-grid tensor-product quadratures of the target functions. We verify the abstract assumptions in two fundamental application settings: first, a linear elliptic diffusion equation with affine-parametric coefficients and second, abstract holomorphic maps between separable Hilbert spaces with affine-parametric input data encoding. For these settings, as in [37,20], cancellation of anti-symmetric terms in ultra-spherical Jacobi generalized polynomial chaos expansion coefficients implies crucially improved convergence rates of sparse-grid tensor-product quadrature with respect to the infinite-tensor-product Jacobi weight, free from the ``curse-of-dimension". Largely self-contained proofs of all results are developed. Approximation convergence rate results in the present setting which are based on construction of neural network surrogates, for unbounded parameter ranges with Gaussian measures, will be developed in extensions of the present work.

math.NA↗

Deep ReLU neural network approximation in Bochner spaces and applications to parametric PDEs

We investigate non-adaptive methods of deep ReLU neural network approximation in Bochner spaces $L_2({\mathbb U}^\infty, X, μ)$ of functions on ${\mathbb U}^\infty$ taking values in a separable Hilbert space $X$, where ${\mathbb U}^\infty$ is either ${\mathbb R}^\infty$ equipped with the standard Gaussian probability measure, or ${\mathbb I}^\infty:= [-1,1]^\infty$ equipped with the Jacobi probability measure. Functions to be approximated are assumed to satisfy a certain weighted $\ell_2$-summability of the generalized chaos polynomial expansion coefficients with respect to the measure $μ$. We prove the convergence rate of this approximation in terms of the size of approximating deep ReLU neural networks. These results then are applied to approximation of the solution to parametric elliptic PDEs with random inputs for the lognormal and affine cases.

math.NA↗

A parabolic equation on domains with random boundaries

A heat equation with uncertain domains is thoroughly investigated. Statistical moments of the solution is approximated by the counterparts of the shape derivative. A rigorous proof for the existence of the shape derivative is presented. Boundary integral equation methods are used to compute statistical moments of the shape derivative.

math.AP↗

A posteriori error estimates for hypersingular integral equation on spheres with spherical splines

A posteriori residual and hierarchical upper bounds for the error estimates were proved when solving the hypersingular integral equation on the unit sphere by using the Galerkin method with spherical splines. Based on these a posteriori error estimates, adaptive mesh refining procedures are used to reduce complexity and computational cost of the discrete problems. Numerical experiments illustrate our theoretical results.

math.NA↗