Josef Dick, Quoc Thong Le Gia, Christoph Schwab
We review recent results on dimension-robust higher order convergence rates of Quasi-Monte Carlo Petrov-Galerkin approximations for response functionals of infinite-dimensional, parametric operator equations which arise in computational uncertainty quantification.
Andrew Chernih, Quoc Thong Le Gia
The aim of this work is to consider multiscale algorithms for solving PDEs with Galerkin methods on bounded domains. We provide results on convergence and condition numbers. We show how to handle PDEs with Dirichlet boundary conditions. We also investigate convergence in terms of the mesh norms and the angles between subspaces to better understand the differences between the algorithms and the observed results. We also consider the issue of the supports of the RBFs overlapping the boundary in our stability analysis, which has not been considered in the literature, to the best of our knowledge.
Andrew Chernih, Quoc Thong Le Gia
In this paper, we investigate the application of radial basis functions (RBFs) for the approximation with collocation of the Stokes problem. The approximate solution is constructed in a multi-level fashion, each level using compactly supported radial basis functions with decreasing scaling factors. We use symmetric collocation and give sufficient conditions for convergence and stability analysis is also presented. Numerical experiments support the theoretical results.
Quoc Thong Le Gia
Boundary value problems on the unit sphere arise naturally in geophysics and oceanography when scientists model a physical quantity on large scales. Robust numerical methods play an important role in solving these problems. In this article, we construct numerical solutions to a boundary value problem defined on a spherical sub-domain (with a sufficiently smooth boundary) using radial basis functions (RBF). The error analysis between the exact solution and the approximation is provided. Numerical experiments are presented to confirm theoretical estimates.
Josef Dick, Seungchan Ko, Quoc Thong Le Gia et al.
Due to divergence instability, the accuracy of low-order conforming finite element methods for nearly incompressible elasticity equations deteriorates as the Lamé coefficient $λ\to\infty$, or equivalently as the Poisson ratio $ν\to1/2$. This phenomenon, known as locking or non-robustness, remains not fully understood despite extensive investigation. In this work, we illustrate first that an analogous instability arises when applying the popular Physics-Informed Neural Networks (PINNs) to nearly incompressible elasticity problems, leading to significant loss of accuracy and convergence difficulties. Then, to overcome this challenge, we propose a robust decomposition-based PINN framework that reformulates the elasticity equations into balanced subsystems, thereby eliminating the ill-conditioning that causes locking. Our approach simultaneously solves the forward and inverse problems to recover both the decomposed field variables and the associated external conditions. We will also perform a convergence analysis to further enhance the reliability of the proposed approach. Moreover, through various numerical experiments, including constant, variable and parametric Lamé coefficients, we illustrate the efficiency of the proposed methodology.
Josef Dick, Frances Kuo, Quoc Thong Le Gia et al.
We develop a convergence analysis of a multi-level algorithm combining higher order quasi-Monte Carlo (QMC) quadratures with general Petrov-Galerkin discretizations of countably affine parametric operator equations of elliptic and parabolic type, extending both the multi-level first order analysis in [\emph{F.Y.~Kuo, Ch.~Schwab, and I.H.~Sloan, Multi-level quasi-Monte Carlo finite element methods for a class of elliptic partial differential equations with random coefficient} (in review)] and the single level higher order analysis in [\emph{J.~Dick, F.Y.~Kuo, Q.T.~Le~Gia, D.~Nuyens, and Ch.~Schwab, Higher order QMC Galerkin discretization for parametric operator equations} (in review)]. We cover, in particular, both definite as well as indefinite, strongly elliptic systems of partial differential equations (PDEs) in non-smooth domains, and discuss in detail the impact of higher order derivatives of {\KL} eigenfunctions in the parametrization of random PDE inputs on the convergence results. Based on our \emph{a-priori} error bounds, concrete choices of algorithm parameters are proposed in order to achieve a prescribed accuracy under minimal computational work. Problem classes and sufficient conditions on data are identified where multi-level higher order QMC Petrov-Galerkin algorithms outperform the corresponding single level versions of these algorithms. Numerical experiments confirm the theoretical results.