Pankaj K Mishra

Pankaj K Mishra, Gregory E Fasshauer, Mrinal K Sen et al.

Recent developments have made it possible to overcome grid-based limitations of finite difference (FD) methods by adopting the kernel-based meshless framework using radial basis functions (RBFs). Such an approach provides a meshless implementation and is referred to as the radial basis-generated finite difference (RBF-FD) method. In this paper, we propose a stabilized RBF-FD approach with a hybrid kernel, generated through a hybridization of the Gaussian and cubic RBF. This hybrid kernel was found to improve the condition of the system matrix, consequently, the linear system can be solved with direct solvers which leads to a significant reduction in the computational cost as compared to standard RBF-FD methods coupled with present stable algorithms. Unlike other RBF-FD approaches, the eigenvalue spectra of differentiation matrices were found to be stable irrespective of irregularity, and the size of the stencils. As an application, we solve the frequency-domain acoustic wave equation in a 2D half-space. In order to suppress spurious reflections from truncated computational boundaries, absorbing boundary conditions have been effectively implemented.

Pankaj K Mishra, Sankar K Nath, Mrinal K Sen et al.

Scattered data interpolation schemes using kriging and radial basis functions (RBFs) have the advantage of being meshless and dimensional independent, however, for the data sets having insufficient observations, RBFs have the advantage over geostatistical methods as the latter requires variogram study and statistical expertise. Moreover, RBFs can be used for scattered data interpolation with very good convergence, which makes them desirable for shape function interpolation in meshless methods for numerical solution of partial differential equations. For interpolation of large data sets, however, RBFs in their usual form, lead to solving an ill-conditioned system of equations, for which, a small error in the data can cause a significantly large error in the interpolated solution. In order to reduce this limitation, we propose a hybrid kernel by using the conventional Gaussian and a shape parameter independent cubic kernel. Global particle swarm optimization method has been used to analyze the optimal values of the shape parameter as well as the weight coefficients controlling the Gaussian and the cubic part in the hybridization. Through a series of numerical tests, we demonstrate that such hybridization stabilizes the interpolation scheme by yielding a far superior implementation compared to those obtained by using only the Gaussian or cubic kernels. The proposed kernel maintains the accuracy and stability at small shape parameter as well as relatively large degrees of freedom, which exhibit its potential for scattered data interpolation and intrigues its application in global as well as local meshless methods for numerical solution of PDEs.

Pankaj K Mishra, Sankar K Nath, Gregor Kosec et al.

While pseudospectral (PS) methods can feature very high accuracy, they tend to be severely limited in terms of geometric flexibility. Application of global radial basis functions overcomes this, however at the expense of problematic conditioning (1) in their most accurate flat basis function regime, and (2) when problem sizes are scaled up to become of practical interest. The present study considers a strategy to improve on these two issues by means of using hybrid radial basis functions that combine cubic splines with Gaussian kernels. The parameters, controlling Gaussian and cubic kernels in the hybrid RBF, are selected using global particle swarm optimization. The proposed approach has been tested with radial basis-pseudospectral method for numerical approximation of Poisson, Helmholtz, and Transport equation. It was observed that the proposed approach significantly reduces the ill-conditioning problem in the RBF-PS method, at the same time, it preserves the stability and accuracy for very small shape parameters. The eigenvalue spectra of the coefficient matrices in the improved algorithm were found to be stable even at large degrees of freedom, which mimic those obtained in pseudospectral approach. Also, numerical experiments suggest that the hybrid kernel performs significantly better than both pure Gaussian and pure cubic kernels.

Pankaj K Mishra, Sankar K Nath

Chebyshev pseudospectral (PS) methods are reported to provide highly accurate solution using polynomial approximation. Use of polynomial basis functions in PS algorithms limits the formulation to univariate systems constraining it to tensor product grids for multi-dimensions. Recent studies have shown that replacing the polynomial by radial basis functions in pseudospectral method (RBF-PS) has the advantage of using irregular grids for multivariate systems. A RBF-PS algorithm has been presented here for the numerical solution of inhomogeneous Helmholtz's equation using Gaussian RBF for derivative approximation. Efficacy of RBF approximated derivatives has been checked through error analysis comparison with PS method. Comparative study of PS, RBF-PS and finite difference approach for the solution of a linear boundary value problem has been performed. Finally, a typical frequency domain acoustic wave propagation problem has been solved using Dirichlet boundary condition and a point source. The algorithm presented here can be extended further for seismic modeling with complexities associated with absorbing boundary conditions.

Pankaj K Mishra, Sanni Laaksonen, Jochen Kamm et al.

Inversion of gravity data is an important method for investigating subsurface density variations relevant to diverse applications including mineral exploration, geothermal assessment, carbon storage, natural hydrogen, groundwater resources, and tectonic evolution. Here we present a scientific machine-learning approach for three-dimensional gravity inversion that represents subsurface density as a continuous field using an implicit neural representation (INR). The method trains a deep neural network directly through a physics-based forward-model loss, mapping spatial coordinates to a continuous density field without predefined meshes or discretisation. Positional encoding enhances the network's capacity to capture sharp contrasts and short-wavelength features that conventional coordinate-based networks tend to oversmooth due to spectral bias. We demonstrate the approach on synthetic examples including Gaussian random fields, representing realistic geological complexity, and a dipping block model to assess recovery of blocky structures. The INR framework reconstructs detailed structure and geologically plausible boundaries without explicit regularisation or depth weighting, while significantly reducing the number of inversion parameters. These results highlight the potential of implicit representations to enable scalable, flexible, and interpretable large-scale geophysical inversion. This framework could generalise to other geophysical methods and for joint/multiphysics inversion.