Search arXivSearch

arXiv subjects

Mehdi Tatari

Publications and source records attributed to Mehdi Tatari.

3 recordsLinked to original sources

Characteristic Based Physics Informed Neural Networks for Advection Equations with a Focus on Discontinuous Solutions

This paper presents a characteristic-based loss function for physics-informed neural networks (PINNs) that circumvents automatic differentiation and significantly reduces training cost for advection equations. However, standard PINNs often fail to accurately resolve discontinuous solutions, as their global smoothness prior and spectral bias lead to smeared shocks or spurious oscillations near sharp gradients. To accurately capture these discontinuities, the density of sampling points in their vicinity must be sufficiently high, and an appropriate sampling strategy must be employed. For problems involving discontinuous initial and boundary conditions, several complementary techniques are introduced: an adaptive sampling strategy that concentrates collocation points along characteristic paths, a Fourier feature mapping with two-stage training and adaptive weighting to mitigate spectral bias, and an adaptive median filter applied to the spatial data at each time instant, which suppresses spurious oscillations while preserving sharp features such as corners and peaks. The effectiveness of the proposed framework is demonstrated through numerical experiments, showing improved accuracy and reduced computational effort in approximating discontinuous solutions.

math.NA

Computing exponential of tridiagonal Toeplitz matrices with applications to numerical solution of the heat equation

The computation of the exponential of a tridiagonal matrix and its applications have always been of interest. One application considered here is when the method of lines is used to solve the heat equation, where the equation is transformed into a system of ordinary differential equations (ODEs), and this system has a solution that depends on the exponential of a tridiagonal Toeplitz matrix. Strang and MacNamara presented an approximate method for computing the exponential of a symmetric tridiagonal Toeplitz matrix that appears in the solution of ODEs. Their method is based on approximating the entries of the exponential matrix with modified Bessel functions of the first kind at certain values, and accordingly, the exponential matrix is decomposed as the difference of a Toeplitz matrix and a Hankel matrix. Here, we aim to extend this idea to the general case of tridiagonal Toeplitz matrices and stabilize the method by approximating the matrix exponential with a banded matrix, which makes the complexity of computing the exponential matrix independent of the matrix size. Additionally, we provide an error analysis for these methods and a bound for the entries of the exponential of the tridiagonal Toeplitz matrices. As a main contribution of this work, the idea is implemented to solve the heat equation, and the uniform stability of the method is proved. By using a splitting approach, the method is generalized for two-dimensional problems. Numerical illustrations demonstrate the efficiency of the new methods and bounds.

math.NA

Error and Stability Estimates of a Least-Squares Variational Kernel-Based Method for Second Order Elliptic PDEs

We consider a least-squares variational kernel-based method for numerical solution of second order elliptic partial differential equations on a multi-dimensional domain. In this setting it is not assumed that the differential operator is self-adjoint or positive definite as it should be in the Rayleigh-Ritz setting. However, the new scheme leads to a symmetric and positive definite algebraic system of equations. Moreover, the resulting method does not rely on certain subspaces satisfying the boundary conditions. The trial space for discretization is provided via standard kernels that reproduce the Sobolev spaces as their native spaces. The error analysis of the method is given, but it is partly subjected to an inverse inequality on the boundary which is still an open problem. The condition number of the final linear system is approximated in terms of the smoothness of the kernel and the discretization quality. Finally, the results of some computational experiments support the theoretical error bounds.

math.NA