Search arXiv⌕ Search

arXiv subjects

Arijit Hazra

Publications and source records attributed to Arijit Hazra.

5 recordsLinked to original sources

Variational objectives for amortized Bayesian inference in inverse problems: The role of posterior conditioning

Variational autoencoders (VAEs) offer an efficient approach to amortized Bayesian inference for inverse problems, but posterior accuracy can depend strongly on the choice of variational regularization, particularly when the inverse problem contains weakly identified parameter directions. This study investigates three objectives: a reverse Kullback--Leibler formulation (VAE-KL), an asymmetric Jensen--Shannon formulation (VAE-JS), and a Jensen--Shannon--Wasserstein formulation (VAE-JSWA), which replaces the reverse Kullback--Leibler regularizer with the squared 2-Wasserstein distance while retaining forward-Kullback--Leibler posterior supervision. A full-covariance Gaussian encoder and a pre-trained physics-based surrogate are used for amortized posterior inference. A local linear--Gaussian analysis in the generalized Fisher basis is developed to characterize the variance-dependent gradients of the three objectives. The formulations are first evaluated using linear--Gaussian benchmarks with known posterior solutions and subsequently tested on nonlinear physics-based inverse problems, including an inverse problem governed by a linear ODE and two PDE-constrained problems. VAE-KL performs slightly better than the other formulations in the well-conditioned benchmark, where all three approaches yield comparable posterior approximations, whereas VAE-JSWA provides substantially lower posterior errors in the strongly ill-conditioned benchmark. The nonlinear physics-based problems exhibit a similar conditioning-dependent trend, with JS-based formulations providing greater benefit as posterior ill-conditioning increases. These results indicate that posterior conditioning is an important factor in selecting variational objectives and motivate geometry-adaptive variational inference for Bayesian inverse problems.

stat.ML↗

Physics-Informed Neural Networks for Estimating Convective Heat Transfer in Jet Impingement Cooling: A Comparison with Conjugate Heat Transfer Simulations

Efficient cooling is vital for the performance and reliability of modern systems such as electronics, nuclear reactors, and industrial equipment. Jet impingement cooling is widely used for its high local heat transfer rates. Accurate estimation of convective heat transfer coefficient (CHTC) is essential for design, simulation, and control of thermal systems. However, estimating spatially varying CHTCs from limited and noisy temperature data poses a challenging inverse problem. This study presents a physics-informed neural network (PINN) framework to estimate both averaged and spatially varying CHTCs at the fluid-solid interface in a jet impingement setup at Reynolds number 5000. The model uses sparse and noisy temperature data from within the solid and embeds the transient heat conduction equation along with boundary and initial conditions into its loss function. This enables inference of unknown boundary parameters without explicit modeling of the fluid domain. Validation is performed using synthetic temperature data from high-fidelity conjugate heat transfer (CHT) simulations. The framework is tested under various additive Gaussian noise levels (up to 30 percent) and sampling rates 0.25 to 4.0 per second. For noise levels up to 10% and sampling rates of 0.5 per second or higher, estimated CHTCs match CHT-derived benchmarks with relative errors below 8 percent. Even under high-noise scenarios, the framework maintains predictive accuracy when time resolution is sufficient. These results highlight the method's robustness to noise and sparse data, offering a scalable alternative to traditional inverse methods, experimental measurements, or full CHT modeling for estimating boundary thermal parameters in real-world cooling applications.

physics.flu-dyn↗

Multidimensional Generalized Riemann Problem Solver for Maxwell's Equations

Approximate multidimensional Riemann solvers are essential building blocks in designing globally constraint-preserving finite volume time domain (FVTD) and discontinuous Galerkin time domain (DGTD) schemes for computational electrodynamics (CED). In those schemes, we can achieve high-order temporal accuracy with the help of Runge-Kutta or ADER time-stepping. This paper presents the design of a multidimensional approximate Generalized Riemann Problem (GRP) solver for the first time. The multidimensional Riemann solver accepts as its inputs the four states surrounding an edge on a structured mesh, and its output consists of a resolved state and its associated fluxes. In contrast, the multidimensional GRP solver accepts as its inputs the four states and their gradients in all directions; its output consists of the resolved state and its corresponding fluxes and the gradients of the resolved state. The gradients can then be used to extend the solution in time. As a result, we achieve second-order temporal accuracy in a single step. In this work, the formulation is optimized for linear hyperbolic systems with stiff, linear source terms because such a formulation will find maximal use in CED. Our formulation produces an overall constraint-preserving time-stepping strategy based on the GRP that is provably L-stable in the presence of stiff source terms. We present several stringent test problems, showing that the multidimensional GRP solver for CED meets its design accuracy and performs stably with optimal time steps. The test problems include cases with high conductivity, showing that the beneficial L-stability is indeed realized in practical applications.

math.NA↗

Globally constraint-preserving FR/DG scheme for Maxwell's equations at all orders

Computational electrodynamics (CED), the numerical solution of Maxwell's equations, plays an incredibly important role in several problems in science and engineering. High accuracy solutions are desired, and the discontinuous Galerkin (DG) method is one of the better ways of delivering high accuracy in CED. Maxwell's equations have a pair of involution constraints for which mimetic schemes that globally satisfy the constraints at a discrete level are highly desirable. Balsara and Kappeli presented a von Neumann stability analysis of globally constraint-preserving DG schemes for CED up to 4'th order which was focused on developing the theory and documenting the superior dissipation and dispersion of DGTD schemes in media with constant permittivity and permeability. In this paper we present DGTD schemes for CED that go up to 5'th order of accuracy and analyze their performance when permittivity and permeability vary strongly in space. Our DGTD schemes achieve constraint preservation by collocating the electric displacement and magnetic induction as well as their higher order modes in the faces of the mesh. Our first finding is that at 4'th and higher orders, one has to evolve some zone-centered modes in addition to the face-centered modes. It is well-known that the limiting step in DG schemes causes a reduction of the optimal accuracy of the scheme. In this paper we document simulations where permittivity and permeability vary by almost an order of magnitude without requiring any limiting of the DG scheme. This very favorable finding ensures that DGTD schemes retain optimal accuracy even in the presence of large spatial variations in permittivity/permeability. Our third finding shows that the electromagnetic energy is conserved very well even when permittivity and permeability vary strongly in space; as long as the conductivity is zero.

math.NA↗

Numerical Simulation of Bloch Equations for Dynamic Magnetic Resonance Imaging

Magnetic Resonance Imaging (MRI) is a widely applied non-invasive imaging modality based on non-ionizing radiation which gives excellent images and soft tissue contrast of living tissues. We consider the modified Bloch problem as a model of MRI for flowing spins in an incompressible flow field. After establishing the well-posedness of the corresponding evolution problem, we analyze its spatial semidiscretization using discontinuous Galerkin methods. The high frequency time evolution requires a proper explicit and adaptive temporal discretization. The applicability of the approach is shown for basic examples.

math.NA↗