相关论文: Mass-conserving diffusion-based dynamics on graphs

A low diffusive flux difference splitting based kinetic scheme is developed based on a discrete velocity Boltzmann equation, with a novel three velocity model. While two discrete velocities are used for upwinding, the third discrete…

We present a numerical implementation of radiative transfer based on an explicitly photon-conserving advection scheme, where radiative fluxes over the cell interfaces of a structured or unstructured mesh are calculated with a second-order…

Accurate high-speed flow simulations of practical interest require numerical methods with high-resolution properties. In this paper, we present an extension and demonstration of the high-accuracy Gradient-based reconstruction and…

We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any graph on n vertices into an O(n\log n)-edge graph on the same…

Sampling is a widely used graph reduction technique to accelerate graph computations and simplify graph visualizations. By comprehensively analyzing the literature on graph sampling, we assume that existing algorithms cannot effectively…

We investigate the area-preserving mean-curvature-type motion of a two-dimensional lattice crystal obtained by coupling constrained minimizing movements scheme introduced by Almgren, Taylor and Wang with a discrete-to-continuous analysis.…

This paper is concerned with the motion of a time dependent hypersurface that evolves by mean curvature flow with a a volume constraint. Phase field approximation of this motion leads to the well known nonlocal Allen--Cahn equation. Here we…

Consensus-based optimization (CBO) is a powerful and versatile zero-order multi-particle method designed to provably solve high-dimensional global optimization problems, including those that are genuinely nonconvex or nonsmooth. The method…

The multi-commodity flow-cut gap is a fundamental parameter that affects the performance of several divide \& conquer algorithms, and has been extensively studied for various classes of undirected graphs. It has been shown by Linial, London…

Sampling configurations at thermodynamic equilibrium is a central challenge in statistical physics. Boltzmann Generators (BGs) tackle it by combining a generative model with a Monte Carlo (MC) correction step to obtain asymptotically…

We introduce a second-order, central-upwind finite volume method for the discretization of nonlinear hyperbolic conservation laws posed on the two-dimensional sphere. The semi-discrete version of the proposed method is based on a technique…

This paper deals with the construction of numerical stable solutions of random mean square Fisher-KPP models with advection. The construction of the numerical scheme is performed in two stages. Firstly, a semidiscretization technique…

This work presents a comprehensive framework for enhanced diffusion modeling in fluid-structure interactions by combining the Immersed Boundary Method (IBM) with stochastic trajectories and high-order spectral boundary conditions. Using…

Advanced algorithms are necessary to obtain faster-than-real-time dynamic simulations in a number of different physical problems that are characterized by widely disparate time scales. Recent advanced dynamic Monte Carlo algorithms that…

In this paper, we introduce a new framework for approximately solving flow problems in capacitated, undirected graphs and apply it to provide asymptotically faster algorithms for the maximum $s$-$t$ flow and maximum concurrent…

We present in this work a new reconstruction scheme, so-called MUSCL-THINC-BVD scheme, to solve the five-equation model for interfacial two phase flows. This scheme employs the traditional shock capturing MUSCL (Monotone Upstream-centered…

We present an efficient nodal discontinuous Galerkin method for approximating nearly incompressible flows using the Boltzmann equations. The equations are discretized with Hermite polynomials in velocity space yielding a first order…

Graph-cuts are widely used in computer vision. In order to speed up the optimization process and improve the scalability for large graphs, Strandmark and Kahl introduced a splitting method to split a graph into multiple subgraphs for…

The paper focuses on the development of numerical methods for the compressible Euler equations. It is well-known that if the Mach number is small, the system becomes stiff and hence explicit schemes suffer from severe time-step…

This article performs a unified convergence analysis of a variety of numerical methods for a model of the miscible displacement of one incompressible fluid by another through a porous medium. The unified analysis is enabled through the…