Featured Researches

Computational Physics

A diffuse interface method for simulation-based screening of heat transfer processes with complex geometries

Frequently, the design of physicochemical processes requires screening of large numbers of alternative designs with complex geometries. These geometries may result in conformal meshes which introduce stability issues, significant computational complexity, and require user-interaction for their creation. In this work, a method for simulation of heat transfer using the diffuse interface method to capture complex geometry is presented as an alternative to a conformal meshing, with analysis and comparisons given. The methods presented include automated non-iterative generation of phase fields from CAD geometries and an extension of the diffuse interface method for mixed boundary conditions. Simple measures of diffuse interface quality are presented and found provide predictions of performance. The method is applied to a realistic heat transfer problem and compared to the traditional conformal mesh approach. It is found to enable reasonable accuracy at an order-of-magnitude reduction in simulation time or comparable accuracy for equivalent simulation times.

Read more
Computational Physics

A general method for computing thermal magnetic noise arising from thin conducting objects

Thermal motion of charge carriers in a conducting object causes magnetic field noise that interferes with sensitive measurements nearby the conductor. In this paper, we describe a method to compute the spectral properties of the thermal magnetic noise from arbitrarily-shaped thin conducting objects. We model divergence-free currents on a conducting surface using a stream function and calculate the magnetically independent noise-current modes in the quasi-static regime. We obtain the power spectral density of the thermal magnetic noise as well as its spatial correlations and frequency dependence. We describe a numerical implementation of the method; we model the conducting surface using a triangle mesh and discretize the stream function. The numerical magnetic noise computation agrees with analytical formulas. We provide the implementation as a part of the free and open-source software package bfieldtools.

Read more
Computational Physics

A genetic algorithm approach to reconstructing spectral content from filtered x-ray diode array spectrometers

Filtered diode array spectrometers are routinely employed to infer the temporal evolution of spectral power from x-ray sources, but uniquely extracting spectral content from a finite set of broad, spectrally overlapping channel spectral sensitivities is decidedly nontrivial in these underdetermined systems. We present the use of genetic algorithms to reconstruct a probabilistic spectral intensity distribution and compare to the traditional approach most commonly found in literature. Unlike many of the previously published models, spectral reconstructions from this approach are neither limited by basis functional forms, nor do they require a priori spectral knowledge. While the original intent of such measurements was to diagnose the temporal evolution of spectral power from quasi-blackbody radiation sources, where the exact details of spectral content was not thought to be crucial, we demonstrate that this new technique can greatly enhance the utility of the diagnostic by providing more physical spectra and improved robustness to hardware configuration for even strongly non-Planckian distributions.

Read more
Computational Physics

A high order kinetic flow solver based on flux reconstruction framework

The goal of this paper is to develop a high order numerical method based on Kinetic Inviscid Flux (KIF) method and Flux Reconstruction (FR) framework. The KIF aims to find a balance between the excellent merits of Gas-Kinetic Scheme (GKS) and the lower computational costs. The idea of KIF can be viewed as an inviscid-viscous splitting version of the gas-kinetic scheme, and Shu and Ohwada have made the fundamental contribution. The combination of Totally Thermalized Transport (TTT) scheme and Kinetic Flux Vector Splitting (KFVS) method are achieved in KIF. Using a coefficient which is related to time step δt and averaged collision time τ , KIF can adjust the weights of TTT and KFVS flux in the simulation adaptively. By doing the inviscid-viscous splitting, KIF is very suitable and easy to integrate into the existing framework. The well understood FR framework is used widely for the advantages of robustness, economical costs and compactness. The combination of KIF and FR is originated by three motivations. The first purpose is to develop a high order method based on the gas kinetic theory. The second reason is to keep the advantages of GKS. The last aim is that the designed method should be more efficient. In present work, we use the KIF method to replace the Riemann flux solver applied in the interfaces of elements. The common solution at the interface is computed according to the gas kinetic theory, which makes the combination of KIF and FR scheme more reasonable and available. The accuracy and performance of present method are validated by several numerical cases. The Taylor-Green vortex problem has been used to verify its potential to simulate turbulent flows.

Read more
Computational Physics

A high-order semi-Lagrangian method for the consistent Monte-Carlo solution of stochastic Lagrangian drift-diffusion models coupled with Eulerian discontinuous spectral element method

The explicit semi-Lagrangian method method for solution of Lagrangian transport equations as developed in [Natarajan and Jacobs, Computer and Fluids, 2020] is adopted for the solution of stochastic differential equations that is consistent with Discontinuous Spectral Element Method (DSEM) approximations of Eulerian conservation laws. The method extends the favorable properties of DSEM that include its high-order accuracy, its local and boundary fitted properties and its high performance on parallel platforms for the concurrent Monte-Carlo, semi-Lagrangian and Eulerian solution of a class of time-dependent problems that can be described by coupled Eulerian-Lagrangian formulations. The semi-Lagrangian method seeds particles at Gauss quadrature collocation nodes within a spectral element. The particles are integrated explicitly in time according to a drift velocity and a Wiener increment forcing and form the nodal basis for an advected interpolant. This interpolant is mapped back in a semi-Lagrangian fashion to the Gauss quadrature points through a least squares fit using constraints for element boundary values. Stochastic Monte-Carlo samples are averaged element-wise on the quadrature nodes. The stable explicit time step Wiener increment is sufficiently small to prevent particles from leaving the element's bounds. The semi-Lagrangian method is hence local and parallel and does not have the grid complexity, and parallelization challenges of the commonly used Lagrangian particle solvers in particle-mesh methods for solution of Eulerian-Lagrangian formulations. Formal proof is presented that the semi-Lagrangian algorithm evolves the solution according to the Eulerian Fokker-Planck equation. Numerical tests in one and two dimensions for drift-diffusion problems show that the method converges exponentially for constant and non-constant advection and diffusion velocities.

Read more
Computational Physics

A holistic approach to computing first-arrival traveltimes using neural networks

Since the original algorithm by John Vidale in 1988 to numerically solve the isotropic eikonal equation, there has been tremendous progress on the topic addressing an array of challenges including improvement of the solution accuracy, incorporation of surface topography, adding more accurate physics by accounting for anisotropy/attenuation in the medium, and speeding up computations using multiple CPUs and GPUs. Despite these advances, there is no mechanism in these algorithms to carry on information gained by solving one problem to the next. Moreover, these approaches may breakdown for certain complex forms of the eikonal equation, requiring approximation methods to estimate the solution. Therefore, we seek an alternate approach to address the challenge in a holistic manner, i.e., a method that not only makes it simpler to incorporate topography, allow accounting for any level of complexity in physics, benefiting from computational speedup due to the availability of multiple CPUs or GPUs, but also able to transfer knowledge gained from solving one problem to the next. We develop an algorithm based on the emerging paradigm of physics-informed neural network to solve various forms of the eikonal equation. We show how transfer learning and surrogate modeling can be used to speed up computations by utilizing information gained from prior solutions. We also propose a two-stage optimization scheme to expedite the training process in presence of sharper heterogeneity in the velocity model. Furthermore, we demonstrate how the proposed approach makes it simpler to incorporate additional physics and other features in contrast to conventional methods that took years and often decades to make these advances. Such an approach not only makes the implementation of eikonal solvers much simpler but also puts us on a much faster path to progress.

Read more
Computational Physics

A hybrid WENO method with modified ghost fluid method for compressible two-medium flow problems

In this paper, we develop a simplified hybrid weighted essentially non-oscillatory (WENO) method combined with the modified ghost fluid method (MGFM) [28] to simulate the compressible two-medium flow problems. The MGFM can turn the two-medium flow problems into two single-medium cases by defining the ghost fluids status in terms of the predicted the interface status, which makes the material interface "invisible". For the single medium flow case, we adapt between the linear upwind scheme and the WENO scheme automatically by identifying the regions of the extreme points for the reconstruction polynomial as same as the hybrid WENO scheme [50]. Instead of calculating their exact locations, we only need to know the regions of the extreme points based on the zero point existence theorem, which is simpler for implementation and saves computation time. Meanwhile, it still keeps the robustness and has high efficiency. Extensive numerical results for both one and two dimensional two-medium flow problems are performed to demonstrate the good performances of the proposed method.

Read more
Computational Physics

A hybrid eikonal solver for accurate first-arrival traveltime computation in anisotropic media with strong contrasts

First-arrival traveltime computation is crucial for many applications such as traveltime tomography, Kirchhoff migration, etc. There exist two major issues in conventional eikonal solvers: the source singularity issue and insufficient numerical accuracy in complex media. Some existing eikonal solvers also exhibit the stability issue in media with strong contrasts in medium properties. We develop a stable and accurate hybrid eikonal solver for 2D and 3D transversely isotropic media with a tilted symmetry axis (TTI, or tilted transversely isotropic media). Our new eikonal solver combines the traveltime field factorization technique, the third-order Lax-Friedrichs update scheme, and a new method for computing the base traveltime field. The solver has the following three advantages. First, there is no need to assign exact traveltime values in the near-source region, and the computed traveltime field near the source location is accurate even for TTI media with strong anisotropy. Second, the computed traveltime field is high-order accurate in space. Third, the solver is numerically stable for 2D and 3D TTI media with strong anisotropy, complex structures, and strong contrasts in medium properties. We verify the stability and accuracy of our hybrid eikonal solver using several 2D and 3D TTI medium examples. The results show that our solver is stable and accurate in 2D and 3D complex TTI media, producing first-arrival traveltime fields that are consistent with full-wavefield solutions.

Read more
Computational Physics

A linear stability analysis of compressible hybrid lattice Boltzmann methods

An original spectral study of the compressible hybrid lattice Boltzmann method (HLBM) on standard lattice is proposed. In this framework, the mass and momentum equations are addressed using the lattice Boltzmann method (LBM), while finite difference (FD) schemes solve an energy equation. Both systems are coupled with each other thanks to an ideal gas equation of state. This work aims at answering some questions regarding the numerical stability of such models, which strongly depends on the choice of numerical parameters. To this extent, several one- and two-dimensional HLBM classes based on different energy variables, formulation (primitive or conservative), collision terms and numerical schemes are scrutinized. Once appropriate corrective terms introduced, it is shown that all continuous HLBM classes recover the Navier-Stokes Fourier behavior in the linear approximation. However, striking differences arise between HLBM classes when their discrete counterparts are analysed. Multiple instability mechanisms arising at relatively high Mach number are pointed out and two exhaustive stabilization strategies are introduced: (1) decreasing the time step by changing the reference temperature T ref and (2) introducing a controllable numerical dissipation σ via the collision operator. A complete parametric study reveals that only HLBM classes based on the primitive and conservative entropy equations are found usable for compressible applications. Finally, an innovative study of the macroscopic modal composition of the entropy classes is conducted. Through this study, two original phenomena, referred to as shear-to-entropy and entropy-to-shear transfers, are highlighted and confirmed on standard two-dimensional test cases.

Read more
Computational Physics

A machine learning approach for efficient multi-dimensional integration

We propose a novel multi-dimensional integration algorithm using a machine learning (ML) technique. After training a ML regression model to mimic a target integrand, the regression model is used to evaluate an approximation of the integral. Then, the difference between the approximation and the true answer is calculated to correct the bias in the approximation of the integral induced by a ML prediction error. Because of the bias correction, the final estimate of the integral is unbiased and has a statistically correct error estimation. The performance of the proposed algorithm is demonstrated on six different types of integrands at various dimensions and integrand difficulties. The results show that, for the same total number of integrand evaluations, the new algorithm provides integral estimates with more than an order of magnitude smaller uncertainties than those of the VEGAS algorithm in most of the test cases.

Read more

Ready to get started?

Join us today