A semi‐implicit multi‐fluid SPH algorithm suitable for GPU | Zendy

Fürstenau JanPhilipp | Zendy; Avci Bircan | Zendy; Wriggers Peter | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

A semi‐implicit multi‐fluid SPH algorithm suitable for GPU

Author(s) -

Fürstenau JanPhilipp,

Avci Bircan,

Wriggers Peter

Publication year - 2016

Publication title -

pamm

Language(s) - English

Resource type - Journals

ISSN - 1617-7061

DOI - 10.1002/pamm.201610285

Subject(s) - smoothed particle hydrodynamics , rayleigh–taylor instability , compressibility , compressible flow , bubble , instability , computer science , grid , algorithm , mechanics , computational science , physics , mathematics , geometry

Multi‐fluid flows are a common problem in process and naval engineering. In this paper an incompressible Smoothed Particle Hydrodynamics (SPH) algorithm is presented, to solve multi‐fluid flows with high density ratios (≤ 1000). The results of the Rayleigh‐Taylor instability and the rising bubble test case are compared with the results obtained by a weakly compressible SPH algorithm with respect to the results obtained by grid‐based solvers. (© 2016 Wiley‐VCH Verlag GmbH & Co. KGaA, Weinheim)

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research