arXiv subjects

Abhinav Muta

Publications and source records attributed to Abhinav Muta.

6 recordsLinked to original sources

arXiv2024

A Second-Order, Variable-Resolution, Weakly-Compressible Smoothed Particle Hydrodynamics Scheme

The smoothed particle hydrodynamics (SPH) method has been widely used to simulate incompressible and slightly compressible fluid flows. Adaptive refinement strategies to dynamically increase the resolution of the particles to capture sharp gradients in the flow have also been developed. However, most of the SPH schemes in the literature are not second-order convergent (SOC). Both second-order convergence and adaptive resolution are considered grand challenge problems in the SPH community. In this paper, we propose, for the first time, a second-order convergent (SOC) adaptive refinement strategy along with a SOC weakly-compressible SPH scheme. We employ the method of manufactured solutions to systematically develop the scheme and validate the solver. We demonstrate the order of convergence of the entire scheme using the Taylor-Green vortex problem and then go on to demonstrate the applicability of the method to simulate flow past a circular cylinder.

physics.flu-dyn↗

arXiv2022

Efficient and Accurate Adaptive Resolution for Weakly-Compressible SPH

In this paper we propose an accurate, and computationally efficient method for incorporating adaptive spatial resolution into weakly-compressible Smoothed Particle Hydrodynamics (SPH) schemes. Particles are adaptively split and merged in an accurate manner. Critically, the method ensures that the number of neighbors of each particle is optimal, leading to an efficient algorithm. A set of background particles is used to specify either geometry-based spatial resolution, where the resolution is a function of distance to a solid body, or solution-based adaptive resolution, where the resolution is a function of the computed solution. This allows us to simulate problems using particles having length variations of the order of 1:250 with much fewer particles than currently reported with other techniques. The method is designed to automatically adapt when any solid bodies move. The algorithms employed are fully parallel. We consider a suite of benchmark problems to demonstrate the accuracy of the approach. We then consider the classic problem of the flow past a circular cylinder at a range of Reynolds numbers and show that the proposed method produces accurate results with a significantly reduced number of particles. We provide an open source implementation and a fully reproducible manuscript.

physics.flu-dyn↗

arXiv2022

Parallel adaptive weakly-compressible SPH for complex moving geometries

The use of adaptive spatial resolution to simulate flows of practical interest using Smoothed Particle Hydrodynamics (SPH) is of considerable importance. Recently, Muta and Ramachandran [1] have proposed an efficient adaptive SPH method which is capable of handling large changes in particle resolution. This allows the authors to simulate problems with much fewer particles than was possible earlier. The method was not demonstrated or tested with moving bodies or multiple bodies. In addition, the original method employed a large number of background particles to determine the spatial resolution of the fluid particles. In the present work we establish the formulation's effectiveness for simulating flow around stationary and moving geometries. We eliminate the need for the background particles in order to specify the geometry-based or solution-based adaptivity and we discuss the algorithms employed in detail. We consider a variety of benchmark problems, including the flow past two stationary cylinders, flow past different NACA airfoils at a range of Reynolds numbers, a moving square at various Reynolds numbers, and the flow past an oscillating cylinder. We also demonstrate different types of motions using single and multiple bodies. The source code is made available under an open source license, and our results are reproducible.

physics.flu-dyn↗

arXiv2021

Dual-Time Smoothed Particle Hydrodynamics for Incompressible Fluid Simulation

In this paper we propose a dual-time stepping scheme for the Smoothed Particle Hydrodynamics (SPH) method. Dual-time stepping has been used in the context of other numerical methods for the simulation of incompressible fluid flows. Here we provide a scheme that combines the entropically damped artificial compressibility (EDAC) along with dual-time stepping. The method is accurate, robust, and demonstrates up to seven times better performance than the standard weakly-compressible formulation. We demonstrate several benchmarks showing the applicability of the scheme. In addition, we provide a completely open source implementation and a reproducible manuscript.

physics.comp-ph↗

arXiv2020

PySPH: a Python-based framework for smoothed particle hydrodynamics

PySPH is an open-source, Python-based, framework for particle methods in general and Smoothed Particle Hydrodynamics (SPH) in particular. PySPH allows a user to define a complete SPH simulation using pure Python. High-performance code is generated from this high-level Python code and executed on either multiple cores, or on GPUs, seamlessly. It also supports distributed execution using MPI. PySPH supports a wide variety of SPH schemes and formulations. These include, incompressible and compressible fluid flow, elastic dynamics, rigid body dynamics, shallow water equations, and other problems. PySPH supports a variety of boundary conditions including mirror, periodic, solid wall, and inlet/outlet boundary conditions. The package is written to facilitate reuse and reproducibility. This paper discusses the overall design of PySPH and demonstrates many of its features. Several example results are shown to demonstrate the range of features that PySPH provides.

physics.comp-ph↗

arXiv2020

An efficient, open source, iterative ISPH scheme

In this paper a simple, robust, and general purpose approach to implement the Incompressible Smoothed Particle Hydrodynamics (ISPH) method is proposed. This approach is well suited for implementation on CPUs and GPUs. The method is matrix-free and uses an iterative formulation to setup and solve the pressure-Poisson equation. A novel approach is used to ensure homogeneous particle distributions and improved boundary conditions. This formulation enables the use of solid wall boundary conditions from the weakly-compressible SPH schemes. The method is fast and runs on GPUs without the need for complex integration with sparse linear solvers. We show that this approach is sufficiently accurate and yet efficient compared to other approaches. Several benchmark problems that illustrate the robustness, performance, and wide range of applicability of the new scheme are demonstrated. An open source implementation is provided and the manuscript is fully reproducible.

math.NA↗