Searcharxiv⌕ Search

arXiv subjects

Quoc Thong Le Gia

Publications and source records attributed to Quoc Thong Le Gia.

14 recordsLinked to original sources

A decomposition-based robust training of physics-informed neural networks for nearly incompressible linear elasticity

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.

math.NA↗

Removing the mask -- reconstructing a scalar field on the sphere from a masked field

The paper analyses a spectral approach to reconstructing a scalar field on the sphere, given only information about a masked version of the field together with precise information about the (smooth) mask. The theory is developed for a general mask, and later specialised to the case of an axially symmetric mask. Numerical experiments are given for the case of an axial mask motivated by the cosmic microwave background, assuming that the underlying field is a realisation of a Gaussian random field with an artificial angular power spectrum of moderate degree ($\ell \le 100$). The recovery is highly satisfactory in the absence of noise and even in the presence of moderate noise.

math.NA↗

Stochastic Navier--Stokes equations on a 3D thin domain

Stochastic Navier--Stokes equations in a thin three-dimensional domain are considered, driven by additive noise. The convergence of martingale solution of the stochastic Navier--Stokes equations in a thin three-dimensional domain to the unique martingale solution of the 2D stochastic Navier--Stokes equations, as the thickness of the film vanishes, is established. Hence, we justify the approximation of 3D Navier--Stokes equations driven by random forcing by its corresponding two-dimensional setting in applications.

math.PR↗

Stochastic Navier-Stokes equations on a thin spherical domain

Incompressible Navier-Stokes equations on a thin spherical domain $Q_\varepsilon$ along with free boundary conditions under a random forcing are considered. The convergence of the martingale solution of these equations to the martingale solution of the stochastic Navier-Stokes equations on a sphere $\mathbb{S}^2$ as the thickness converges to zero is established.

math.PR↗

Approximation of noisy data using multivariate splines and finite element methods

We compare a recently proposed multivariate spline based on mixed partial derivatives with two other standard splines for the scattered data smoothing problem. The splines are defined as the minimiser of a penalised least squares functional. The penalties are based on partial differentiation operators, and are integrated using the finite element method. We compare three methods to two problems: to remove the mixture of Gaussian and impulsive noise from an image, and to recover a continuous function from a set of noisy observations.

math.NA↗

Numerical solutions of a boundary value problem on the sphere using radial basis functions

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.

math.NA↗

Multi-level higher order QMC Galerkin discretization for affine parametric operator equations

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.

math.NA↗

Multiscale methods with compactly supported radial basis functions for the Stokes problem on bounded domains

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.

math.NA↗

Zooming from Global to Local: A Multiscale RBF Approach

Because physical phenomena on Earth's surface occur on many different length scales, it makes sense when seeking an efficient approximation to start with a crude global approximation, and then make a sequence of corrections on finer and finer scales. It also makes sense eventually to seek fine scale features locally, rather than globally. In the present work, we start with a global multiscale radial basis function (RBF) approximation, based on a sequence of point sets with decreasing mesh norm, and a sequence of (spherical) radial basis functions with proportionally decreasing scale centered at the points. We then prove that we can "zoom in" on a region of particular interest, by carrying out further stages of multiscale refinement on a local region. The proof combines multiscale techniques for the sphere from Le Gia, Sloan and Wendland, SIAM J. Numer. Anal. 48 (2010) and Applied Comp. Harm. Anal. 32 (2012), with those for a bounded region in $\mathbb{R}^d$ from Wendland, Numer. Math. 116 (2012). The zooming in process can be continued indefinitely, since the condition numbers of matrices at the different scales remain bounded. A numerical example illustrates the process.

math.NA↗

Multiscale methods with compactly supported radial basis functions for Galerkin approximation of elliptic PDEs

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.

math.NA↗