Related papers: Coarse-graining Algorithms for the Eulerian-Lagran…
Inertial particles in turbulent flows are characterised by preferential concentration and segregation and, at sufficient mass loading, dense particle clusters may spontaneously arise due to momentum coupling between the phases. These…
Semi-analytical methods, based on Eulerian perturbation theory, are a promising tool to follow the time evolution of cosmological perturbations at small redshifts and at mildly nonlinear scales. All these schemes are based on two…
Coarse-grained (CG) models are simplified representations of soft matter systems that are commonly employed to overcome size and time limitations in computational studies. Many approaches have been developed to construct and parametrise…
We propose a new Eulerian-Lagrangian (EL) discontinuous Galerkin (DG) method. The method is designed as a generalization of the semi-Lagrangian (SL) DG method for linear advection problems proposed in [J. Sci. Comput. 73: 514-542, 2017],…
Complex fluids exhibit structure on a wide range of length and time scales, and hierarchical approaches are necessary to investigate all facets of their often unusual properties. The study of idealized coarse-grained models at different…
In this work, we present a high-fidelity and efficient point-particle direct numerical simulation framework based on a multi-block overset curvilinear grid system, enabling large-scale Lagrangian particle tracking in complex geometries with…
In this study, we investigate the performance of two novel first-order optimization algorithms, namely the rescaled-gradient flow (RGF) and the signed-gradient flow (SGF). These algorithms are derived from the forward Euler discretization…
In this work, we review previously developed coarse-grained (CG) particle models for biological membrane and red blood cells (RBCs) and discuss the advantages of the CG particle method over the continuum and atomic simulations on modeling…
Efficient sampling of the Boltzmann distribution of molecular systems is a long-standing challenge. Recently, instead of generating long molecular dynamics simulations, generative machine learning methods such as normalizing flows have been…
Coarse-grained (CG) models are often parametrized to reproduce one-dimensional structural correlation functions of an atomically-detailed model along the degrees of freedom governing each interaction potential. While cross correlations…
A upscaled lattice Boltzmann method (LBM) for flow simulations in heterogeneous porous media, at both pore and Darcy scales, is proposed in this paper. In the micro-scale simulations, we model flows using LBM with the modified Guo et al.…
Condense phase molecular systems organize in wide range of distinct molecular configurations, including amorphous melt and glass as well as crystals often exhibiting polymorphism, that originate from their intricate intra- and…
This text describes a method to simultaneously reconstruct flow states and determine particle properties from Lagrangian particle tracking (LPT) data. LPT is a popular measurement strategy for fluids in which particles in a flow are…
This paper introduces algorithms to select/design kernels in Gaussian process regression/kriging surrogate modeling techniques. We adopt the setting of kernel method solutions in ad hoc functional spaces, namely Reproducing Kernel Hilbert…
We explore the application of the reference map technique, originally developed for the Eulerian simulation of solid mechanics, in Lagrangian kinematics of fluid flows. Unlike traditional methods based on explicit particle tracking, the…
(Neal and Hinton, 1998) recast maximum likelihood estimation of any given latent variable model as the minimization of a free energy functional $F$, and the EM algorithm as coordinate descent applied to $F$. Here, we explore alternative…
The selection of coarse-grained (CG) mapping operators is a critical step for CG molecular dynamics (MD) simulation. It is still an open question about what is optimal for this choice and there is a need for theory. The current state-of-the…
Bayesian inference for exponential family random graph models (ERGMs) is a doubly-intractable problem because of the intractability of both the likelihood and posterior normalizing factor. Auxiliary variable based Markov Chain Monte Carlo…
Brute-force simulations for dynamics on very large networks are quite expensive. While phenomenological treatments may capture some macroscopic properties, they often ignore important microscopic details. Fortunately, one may be only…
We discuss a Bayesian formulation to coarse-graining (CG) of PDEs where the coefficients (e.g. material parameters) exhibit random, fine scale variability. The direct solution to such problems requires grids that are small enough to resolve…