اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe GeoClaw software for depth-averaged flows with adaptive refinement
236
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Many geophysical flow or wave propagation problems can be modeled with two-dimensional depth-averaged equations, of which the shallow water equations are the simplest example. We describe the GeoClaw software that has been designed to solve problems of this nature, consisting of open source Fortran programs together with Python tools for the user interface and flow visualization. This software uses high-resolution shock-capturing finite volume methods on logically rectangular grids, including latitude--longitude grids on the sphere. Dry states are handled automatically to model inundation. The code incorporates adaptive mesh refinement to allow the efficient solution of large-scale geophysical problems. Examples are given illustrating its use for modeling tsunamis, dam break problems, and storm surge. Documentation and download information is available at www.clawpack.org/geoclaw
قيم البحث
اقرأ أيضاً
Numerical simulations of flows are required for numerous applications, and are usually carried out using shallow water equations. We describe the FullSWOF software which is based on up-to-date finite volume methods and well-balanced schemes to solve
this kind of equations. It consists of a set of open source C++ codes, freely available to the community, easy to use, and open for further development. Several features make FullSWOF particularly suitable for applications in hydrology: small water heights and wet-dry transitions are robustly handled, rainfall and infiltration are incorporated, and data from grid-based digital topographies can be used directly. A detailed mathematical description is given here, and the capabilities of FullSWOF are illustrated based on analytic solutions and datasets of real cases. The codes, available in 1D and
We present a new numerical tool for solving the special relativistic ideal MHD equations that is based on the combination of the following three key features: (i) a one-step ADER discontinuous Galerkin (DG) scheme that allows for an arbitrary order o
f accuracy in both space and time, (ii) an a posteriori subcell finite volume limiter that is activated to avoid spurious oscillations at discontinuities without destroying the natural subcell resolution capabilities of the DG finite element framework and finally (iii) a space-time adaptive mesh refinement (AMR) framework with time-accurate local time-stepping. The divergence-free character of the magnetic field is instead taken into account through the so-called divergence-cleaning approach. The convergence of the new scheme is verified up to 5th order in space and time and the results for a set of significant numerical tests including shock tube problems, the RMHD rotor and blast wave problems, as well as the Orszag-Tang vortex system are shown. We also consider a simple case of the relativistic Kelvin-Helmholtz instability with a magnetic field, emphasizing the potential of the new method for studying turbulent RMHD flows. We discuss the advantages of our new approach when the equations of relativistic MHD need to be solved with high accuracy within various astrophysical systems.
A qualitative comparison of total variation like penalties (total variation, Huber variant of total variation, total generalized variation, ...) is made in the context of global seismic tomography. Both penalized and constrained formulations of seism
ic recovery problems are treated. A number of simple iterative recovery algorithms applicable to these problems are described. The convergence speed of these algorithms is compared numerically in this setting. For the constrained formulation a new algorithm is proposed and its convergence is proven.
Axions are hypothetical particles that may explain the observed dark matter (DM) density and the non-observation of a neutron electric dipole moment. An increasing number of axion laboratory searches are underway worldwide, but these efforts are made
difficult by the fact that the axion mass is largely unconstrained. If the axion is generated after inflation there is a unique mass that gives rise to the observed DM abundance; due to nonlinearities and topological defects known as strings, computing this mass accurately has been a challenge for four decades. Recent works, making use of large static lattice simulations, have led to largely disparate predictions for the axion mass, spanning the range from 25 microelectronvolts to over 500 microelectronvolts. In this work we show that adaptive mesh refinement (AMR) simulations are better suited for axion cosmology than the previously-used static lattice simulations because only the string cores require high spatial resolution. Using dedicated AMR simulations we obtain an over three order of magnitude leap in dynamic range and provide evidence that axion strings radiate their energy with a scale-invariant spectrum, to within $sim$5% precision, leading to a mass prediction in the range (40,180) microelectronvolts.
Large-scale finite element simulations of complex physical systems governed by partial differential equations crucially depend on adaptive mesh refinement (AMR) to allocate computational budget to regions where higher resolution is required. Existing
scalable AMR methods make heuristic refinement decisions based on instantaneous error estimation and thus do not aim for long-term optimality over an entire simulation. We propose a novel formulation of AMR as a Markov decision process and apply deep reinforcement learning (RL) to train refinement policies directly from simulation. AMR poses a new problem for RL in that both the state dimension and available action set changes at every step, which we solve by proposing new policy architectures with differing generality and inductive bias. The model sizes of these policy architectures are independent of the mesh size and hence scale to arbitrarily large and complex simulations. We demonstrate in comprehensive experiments on static function estimation and the advection of different fields that RL policies can be competitive with a widely-used error estimator and generalize to larger, more complex, and unseen test problems.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
