Related papers: Using sparse matrices and splines-based interpolat…
We present a technique designed for parallelizing large rigid body simulations, capable of exploiting multiple CPU cores within a computer and across a network. Our approach can be applied to simulate both unilateral and bilateral…
We present the results from a two-day study in which we discussed various implementations of Smooth Particle Hydrodynamics (SPH), one of the leading methods used across a variety of areas of large-scale astrophysical simulations. In…
In this paper we propose a fast algorithm for trivariate interpolation, which is based on the partition of unity method for constructing a global interpolant by blending local radial basis function interpolants and using locally supported…
Aerosol injectors applied in single-particle diffractive imaging experiments demonstrated their potential in efficiently delivering nanoparticles with high density. Continuous optimization of injector design is crucial for achieving…
A novel fifth-order compact gas-kinetic scheme is developed for high-resolution simulation of compressible flows on structured meshes. Its accuracy relies on a new multidimensional fifth-order compact reconstruction that uses line-averaged…
Previously, we have proposed a direct simulation scheme for colloidal dispersions in a Newtonian solvent [Phys.Rev.E 71,036707 (2005)]. An improved formulation called the ``Smoothed Profile (SP) method'' is presented here in which…
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a $p$-adic lifting technique combined with the use of block matrices with structured blocks. It achieves a sub-cubic…
A numerical model and parallel software for 3D simulations of granular flows have been developed based on the Lagrangian particle (LP) method [R.Samulyak, X. Wang, H.-C. Chen, Lagrangian particle method for compressible fluid dynamics, J.…
We present a methodology for simulating dilute suspensions of particles settling under gravity, with the main purpose of overcoming limitations of triply periodic configurations, mainly the strong vertical correlation that hinders the study…
The paper deals with the developing of the methodological backgrounds for the modeling and simulation of complex dynamical objects. Such backgrounds allow us to perform coordinate transformation and formulate the algorithm of its usage for…
We describe an approach for modeling fluid concentration profiles in grid-based microfluidic chips for fluid mixing. This approach provides an algorithm that predicts fluid concentrations at the chip outlets. Our algorithm significantly…
Computational fluid dynamics is both a thriving research field and a key tool for advanced industry applications. The central challenge is to simulate turbulent flows in complex geometries, a compute-power intensive task due to the large…
A computer simulation has to be fast to be helpful, if it is employed to study the behavior of a multicomponent dynamic system. This paper discusses modeling concepts and algorithmic techniques useful for creating such fast simulations.…
We introduce Neural Flow Maps, a novel simulation method bridging the emerging paradigm of implicit neural representations with fluid simulation based on the theory of flow maps, to achieve state-of-the-art simulation of inviscid fluid…
To increase performance and efficiency, systems use FPGAs as reconfigurable accelerators. A key challenge in designing these systems is partitioning computation between processors and an FPGA. An appropriate division of labor may be…
We present an algorithm for cluster dynamics to efficiently simulate large systems on MIMD parallel computers with large numbers of processors. The method divides physical space into rectangular cells which are assigned to processors and…
Conventional physically based rendering (PBR) pipelines generate photorealistic images through computationally intensive light transport simulations. Although recent deep learning approaches leverage diffusion model priors with geometry…
Linear-scaling electronic-structure techniques, also called O(N) techniques, rely heavily on the multiplication of sparse matrices, where the sparsity arises from spatial cut-offs. In order to treat very large systems, the calculations must…
Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as…
In this thesis, we develop multiscale models for particle simulations in population dynamics. These models are characterised by prescribing particle motion on two spatial scales: microscopic and macroscopic. At the microscopic level, each…