اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدParareal in time 3D numerical solver for the LWR Benchmark neutron diffusion transient model
176
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present a parareal in time algorithm for the simulation of neutron diffusion transient model. The method is made efficient by means of a coarse solver defined with large time steps and steady control rods model. Using finite element for the space discretization, our implementation provides a good scalability of the algorithm. Numerical results show the efficiency of the parareal method on large light water reactor transient model corresponding to the Langenbuch-Maurer-Werner (LMW) benchmark [1].
قيم البحث
اقرأ أيضاً
Fluid dynamics simulations of melting and crater formation at the surface of a copper cathode exposed to high plasma heat fluxes and pressure gradients are presented. The predicted deformations of the free surface and the temperature evolution inside
the metal are benchmarked against previously published simulations. Despite the physical model being entirely hydrodynamic and ignoring a variety of plasma-surface interaction processes, the results are also shown to be remarkably consistent with the predictions of more advanced models, as well as experimental data. This provides a sound basis for future applications of similar models to studies of transient surface melting and droplet ejection from metallic plasma-facing components after disruptions.
In the present manuscript, we consider the problem of dispersive wave simulation on a rotating globally spherical geometry. In this Part IV, we focus on numerical aspects while the model derivation was described in Part III. The algorithm we propose
is based on the splitting approach. Namely, equations are decomposed on a uniformly elliptic equation for the dispersive pressure component and a hyperbolic part of shallow water equations (on a sphere) with source terms. This algorithm is implemented as a two-step predictor-corrector scheme. On every step, we solve separately elliptic and hyperbolic problems. Then, the performance of this algorithm is illustrated on model idealised situations with an even bottom, where we estimate the influence of sphericity and rotation effects on dispersive wave propagation. The dispersive effects are quantified depending on the propagation distance over the sphere and on the linear extent of generation region. Finally, the numerical method is applied to a couple of real-world events. Namely, we undertake simulations of the Bulgarian 2007 and Chilean 2010 tsunamis. Whenever the data is available, our computational results are confronted with real measurements.
Physics-informed neural networks (PINNs) encode physical conservation laws and prior physical knowledge into the neural networks, ensuring the correct physics is represented accurately while alleviating the need for supervised learning to a great deg
ree. While effective for relatively short-term time integration, when long time integration of the time-dependent PDEs is sought, the time-space domain may become arbitrarily large and hence training of the neural network may become prohibitively expensive. To this end, we develop a parareal physics-informed neural network (PPINN), hence decomposing a long-time problem into many independent short-time problems supervised by an inexpensive/fast coarse-grained (CG) solver. In particular, the serial CG solver is designed to provide approximate predictions of the solution at discrete times, while initiate many fine PINNs simultaneously to correct the solution iteratively. There is a two-fold benefit from training PINNs with small-data sets rather than working on a large-data set directly, i.e., training of individual PINNs with small-data is much faster, while training the fine PINNs can be readily parallelized. Consequently, compared to the original PINN approach, the proposed PPINN approach may achieve a significant speedup for long-time integration of PDEs, assuming that the CG solver is fast and can provide reasonable predictions of the solution, hence aiding the PPINN solution to converge in just a few iterations. To investigate the PPINN performance on solving time-dependent PDEs, we first apply the PPINN to solve the Burgers equation, and subsequently we apply the PPINN to solve a two-dimensional nonlinear diffusion-reaction equation. Our results demonstrate that PPINNs converge in a couple of iterations with significant speed-ups proportional to the number of time-subdomains employed.
The study of polycrystalline materials requires theoretical and computational techniques enabling multiscale investigations. The amplitude expansion of the phase field crystal model (APFC) allows for describing crystal lattice properties on diffusive
timescales by focusing on continuous fields varying on length scales larger than the atomic spacing. Thus, it allows for the simulation of large systems still retaining details of the crystal lattice. Fostered by the applications of this approach, we present here an efficient numerical framework to solve its equations. In particular, we consider a real space approach exploiting the finite element method. An optimized preconditioner is developed in order to improve the convergence of the linear solver. Moreover, a mesh adaptivity criterion based on the local rotation of the polycrystal is used. This results in an unprecedented capability of simulating large, three-dimensional systems including the dynamical description of the microstructures in polycrystalline materials together with their dislocation networks.
The Hierarchical Schur Complement method (HSC), and the HSC-extension, have significantly accelerated the evaluation of the retarded Greens function, particularly the lesser Greens function, for two-dimensional nanoscale devices. In this work, the HS
C-extension is applied to determine the solution of non-equilibrium Greens functions (NEGF) on three-dimensional nanoscale devices. The operation count for the HSC-extension is analyzed for a cuboid device. When a cubic device is discretized with $N times N times N$ grid points, the state-of-the-art Recursive Green Function (RGF) algorithm takes $mathcal{O}(N^7)$ operations, whereas the HSC-extension only requires $mathcal{O}(N^6)$ operations. %Realistic operation counts also depend on the system dimensions in $xyz$-directions and the form of contact self-energy matrix. Operation counts and runtimes are also studied for three-dimensional nanoscale devices of practical interest: a graphene-boron- nitride-graphene multilayer system, a silicon nanowire, and a DNA molecule. The numerical experiments indicate that the cost for the HSC-extension is proportional to the solution of one linear system (or one LU-factorization) and that the runtime speed-ups over RGF exceed three orders of magnitude when simulating realistic devices, such as a graphene-boron nitride-graphene multilayer system with 40,000 atoms.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
