arXiv subjects

Mrinal K Sen

Publications and source records attributed to Mrinal K Sen.

5 recordsLinked to original sources

arXiv2025

Bayesian full waveform inversion with learned prior using deep convolutional autoencoder

Full waveform inversion (FWI) can be expressed in a Bayesian framework, where the associated uncertainties are captured by the posterior probability distribution (PPD). In practice, solving Bayesian FWI with sampling-based methods such as Markov chain Monte Carlo (MCMC) is computationally demanding because of the extremely high dimensionality of the model space. To alleviate this difficulty, we develop a deep convolutional autoencoder (CAE) that serves as a learned prior for the inversion. The CAE compresses detailed subsurface velocity models into a low-dimensional latent representation, achieving more effective and geologically consistent model reduction than conventional dimension reduction approaches. The inversion procedure employs an adaptive gradient-based MCMC algorithm enhanced by automatic differentiation-based FWI to compute gradients efficiently in the latent space. In addition, we implement a transfer learning strategy through online fine-tuning during inversion, enabling the framework to adapt to velocity structures not represented in the original training set. Numerical experiments with synthetic data show that the method can reconstruct velocity models and assess uncertainty with improved efficiency compared to traditional MCMC methods.

physics.geo-ph↗

arXiv2024

Enhancing RBF-FD Efficiency for Highly Non-Uniform Node Distributions via Adaptivity

Radial basis function generated finite-difference (RBF-FD) methods have recently gained popularity due to their flexibility with irregular node distributions. However, the convergence theories in the literature, when applied to nonuniform node distributions, require shrinking fill distance and do not take advantage of areas with high data density. Non-adaptive approach using same stencil size and degree of appended polynomial will have higher local accuracy at high density region, but has no effect on the overall order of convergence and could be a waste of computational power. This work proposes an adaptive RBF-FD method that utilizes the local data density to achieve a desirable order accuracy. By performing polynomial refinement and using adaptive stencil size based on data density, the adaptive RBF-FD method yields differentiation matrices with higher sparsity while achieving the same user-specified convergence order for nonuniform point distributions. This allows the method to better leverage regions with higher node density, maintaining both accuracy and efficiency compared to standard non-adaptive RBF-FD methods.

math.NA↗

arXiv2018

A stabilized radial basis-finite difference (RBF-FD) method with hybrid kernels

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.

math.NA↗

arXiv2016

An improved radial basis-pseudospectral method with hybrid Gaussian-cubic kernels

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.

math.NA↗

arXiv2015

Hybrid Gaussian-cubic radial basis functions for scattered data interpolation

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.

math.NA↗