اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدStable and contact-free time stepping for dense rigid particle suspensions
296
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider suspensions of rigid bodies in a two-dimensional viscous fluid. Even with high-fidelity numerical methods, unphysical contact between particles occurs because of spatial and temporal discretization errors. We apply the method of Lu et al. [Journal of Computational Physics, 347:160-182, 2017] where overlap is avoided by imposing a minimum separation distance. In its original form, the method discretizes interactions between different particles explicitly. Therefore, to avoid stiffness, a large minimum separation distance is used. In this paper, we extend the method of Lu et al. by treating all interactions implicitly. This new time stepping method is able to simulate dense suspensions with large time step sizes and a small minimum separation distance. The method is tested on various unbounded and bounded flows, and rheological properties of the resulting suspensions are computed.
قيم البحث
اقرأ أيضاً
We construct a high-order adaptive time stepping scheme for vesicle suspensions with viscosity contrast. The high-order accuracy is achieved using a spectral deferred correction (SDC) method, and adaptivity is achieved by estimating the local truncat
ion error with the numerical error of physically constant values. Numerical examples demonstrate that our method can handle suspensions with vesicles that are tumbling, tank-treading, or both. Moreover, we demonstrate that a user-prescribed tolerance can be automatically achieved for simulations with long time horizons.
We introduce a new class of Runge-Kutta type methods suitable for time stepping to propagate hyperbolic solutions within tent-shaped spacetime regions. Unlike standard Runge-Kutta methods, the new methods yield expected convergence properties when st
andard high order spatial (discontinuous Galerkin) discretizations are used. After presenting a derivation of nonstandard order conditions for these methods, we show numerical examples of nonlinear hyperbolic systems to demonstrate the optimal convergence rates. We also report on the discrete stability properties of these methods applied to linear hyperbolic equations.
This article is concerned with the discretisation of the Stokes equations on time-dependent domains in an Eulerian coordinate framework. Our work can be seen as an extension of a recent paper by Lehrenfeld & Olshanskii [ESAIM: M2AN, 53(2):585-614, 20
19], where BDF-type time-stepping schemes are studied for a parabolic equation on moving domains. For space discretisation, a geometrically unfitted finite element discretisation is applied in combination with Nitsches method to impose boundary conditions. Physically undefined values of the solution at previous time-steps are extended implicitly by means of so-called ghost penalty stabilisations. We derive a complete a priori error analysis of the discretisation error in space and time, including optimal $L^2(L^2)$-norm error bounds for the velocities. Finally, the theoretical results are substantiated with numerical examples.
In this note we develop a fully explicit cut finite element method for the wave equation. The method is based on using a standard leap frog scheme combined with an extension operator that defines the nodal values outside of the domain in terms of the
nodal values inside the domain. We show that the mass matrix associated with the extended finite element space can be lumped leading to a fully explicit scheme. We derive stability estimates for the method and provide optimal order a priori error estimates. Finally, we present some illustrating numerical examples.
The Lorentz equations describe the motion of electrically charged particles in electric and magnetic fields and are used widely in plasma physics. The most popular numerical algorithm for solving them is the Boris method, a variant of the Stormer-Ver
let algorithm. Boris method is phase space volume conserving and simulated particles typically remain near the correct trajectory. However, it is only second order accurate. Therefore, in scenarios where it is not enough to know that a particle stays on the right trajectory but one needs to know where on the trajectory the particle is at a given time, Boris method requires very small time steps to deliver accurate phase information, making it computationally expensive. We derive an improved version of the high-order Boris spectral deferred correction algorithm (Boris-SDC) by adopting a convergence acceleration strategy for second order problems based on the Generalised Minimum Residual (GMRES) method. Our new algorithm is easy to implement as it still relies on the standard Boris method. Like Boris-SDC it can deliver arbitrary order of accuracy through simple changes of runtime parameter but possesses better long-term energy stability. We demonstrate for two examples, a magnetic mirror trap and the Solevev equilibrium, that the new method can deliver better accuracy at lower computational cost compared to the standard Boris method. While our examples are motivated by tracking ions in the magnetic field of a nuclear fusion reactor, the introduced algorithm can potentially deliver similar improvements in efficiency for other applications.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
