Searcharxiv⌕ Search

arXiv subjects

Ieng Tak Leong

Publications and source records attributed to Ieng Tak Leong.

3 recordsLinked to original sources

A Priori Error Estimation of Physics-Informed Neural Networks Solving Allen--Cahn and Cahn--Hilliard Equations

Physics-Informed Neural Networks (PINNs) encounter accuracy limitations when solving the Allen--Cahn (AC) and Cahn--Hilliard (CH) partial differential equations (PDEs). To overcome this, we employ a novel loss function, Residuals-weighted Region Activation Evaluation (Residuals-RAE), featuring a { pre-training weight update scheme}. { Unlike conventional self-adaptive PINNs where weights evolve simultaneously with network parameters, Residuals-RAE-PINNs computes weights from current residuals before each training step and holds them constant during gradient updates. We establish weight convergence under standard neural network optimization assumptions, which justifies analyzing the converged network with constant weights.} Based on this theoretical framework, we derive the error estimation for PINNs with Residuals-RAE when solving AC and CH equations. {The analysis is aligned with Monte-Carlo sampling for the discretization of integrals, consistent with the numerical experiments.} Numerical experiments on one- and two-dimensional AC and CH systems confirm our theoretical results. Additionally, our analysis reveals that feedforward neural networks with two hidden layers and the tanh activation function bound the approximation errors of the solution, its temporal derivative, and the nonlinear term, constrained by the training loss and the number of collocation points.

math.NA↗

The sparse representation related with fractional heat equations

This study introduces pre-orthogonal adaptive Fourier decomposition (POAFD) to obtain approximations and numerical solutions to the fractional Laplacian initial value problem and the extension problem of Caffarelli and Silvestre (generalized Poisson equation). The method, as the first step, expands the initial data function into a sparse series of the fundamental solutions with fast convergence, and, as the second step, makes use the semigroup or the reproducing kernel property of each of the expanding entries. Experiments show effectiveness and efficiency of the proposed series solutions.

math.NA↗

Adaptive Fourier decomposition of slice regular functions

In the slice Hardy space over the unit ball of quaternions, we introduce the slice hyperbolic backward shift operator $\mathcal S_a$ with the decomposition process $$f=e_a\langle f, e_a\rangle+B_{a}*\mathcal S_a f,$$ where $e_a$ denotes the slice normalized Szegö kernel and $ B_a $ the slice Blaschke factor. Iterating the above decomposition process, a corresponding maximal selection principle gives rise to the slice adaptive Fourier decomposition. This leads to a adaptive slice Takenaka-Malmquist orthonormal system.

math.CV↗