اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAdaptive multiresolution schemes with local time stepping for two-dimensional degenerate reaction-diffusion systems
325
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present a fully adaptive multiresolution scheme for spatially two-dimensional, possibly degenerate reaction-diffusion systems, focusing on combustion models and models of pattern formation and chemotaxis in mathematical biology. Solutions of these equations in these applications exhibit steep gradients, and in the degenerate case, sharp fronts and discontinuities. The multiresolution scheme is based on finite volume discretizations with explicit time stepping. The multiresolution representation of the solution is stored in a graded tree. By a thresholding procedure, namely the elimination of leaves that are smaller than a threshold value, substantial data compression and CPU time reduction is attained. The threshold value is chosen optimally, in the sense that the total error of the adaptive scheme is of the same slope as that of the reference finite volume scheme. Since chemical reactions involve a large range of temporal scales, but are spatially well localized (especially in the combustion model), a locally varying adaptive time stepping strategy is applied. It turns out that local time stepping accelerates the adaptive multiresolution method by a factor of two, while the error remains controlled.
قيم البحث
اقرأ أيضاً
A fully adaptive finite volume multiresolution scheme for one-dimensional strongly degenerate parabolic equations with discontinuous flux is presented. The numerical scheme is based on a finite volume discretization using the Engquist--Osher approxim
ation for the flux and explicit time--stepping. An adaptivemultiresolution scheme with cell averages is then used to speed up CPU time and meet memory requirements. A particular feature of our scheme is the storage of the multiresolution representation of the solution in a dynamic graded tree, for the sake of data compression and to facilitate navigation. Applications to traffic flow with driver reaction and a clarifier--thickener model illustrate the efficiency of this method.
We present a fully adaptive multiresolution scheme for spatially one-dimensional quasilinear strongly degenerate parabolic equations with zero-flux and periodic boundary conditions. The numerical scheme is based on a finite volume discretization usin
g the Engquist-Osher numerical flux and explicit time stepping. An adaptive multiresolution scheme based on cell averages is then used to speed up the CPU time and the memory requirements of the underlying finite volume scheme, whose first-order version is known to converge to an entropy solution of the problem. A particular feature of the method is the storage of the multiresolution representation of the solution in a graded tree, whose leaves are the non-uniform finite volumes on which the numerical divergence is eventually evaluated. Moreover using the $L^1$ contraction of the discrete time evolution operator we derive the optimal choice of the threshold in the adaptive multiresolution method. Numerical examples illustrate the computational efficiency together with the convergence properties.
The Poisson-Nernst-Planck equations with generalized Frumkin-Butler-Volmer boundary conditions (PNP-FBV) describe ion transport with Faradaic reactions, and have applications in a number of fields. In this article, we develop an adaptive time-steppin
g scheme for the solution of the PNP-FBV equations based on two time-stepping methods: a fully implicit (BDF2) method, and an implicit-explicit (SBDF2) method. We present simulations under both current and voltage boundary conditions and demonstrate the ability to simulate a large range of parameters, including any value of the singular perturbation parameter $epsilon$. When the underlying dynamics is one that would have the solutions converge to a steady-state solution, we observe that the adaptive time-stepper based on the SBDF2 method produces solutions that ``nearly converge to the steady state and that, simultaneously, the time-step sizes stabilize to a limiting size $dt_infty$. In the companion to this article cite{YPD_Part2}, we linearize the SBDF2 scheme about the steady-state solution and demonstrate that the linearized scheme is conditionally stable. This conditional stability is the cause of the adaptive time-steppers behaviour. While the adaptive time-stepper based on the fully-implicit (BDF2) method is not subject to such time-step constraints, the required nonlinear solve yields run times that are significantly longer.
In this paper, we present an inverse problem of identifying the reaction coefficient for time fractional diffusion equations in two dimensional spaces by using boundary Neumann data. It is proved that the forward operator is continuous with respect t
o the unknown parameter. Because the inverse problem is often ill-posed, regularization strategies are imposed on the least fit-to-data functional to overcome the stability issue. There may exist various kinds of functions to reconstruct. It is crucial to choose a suitable regularization method. We present a multi-parameter regularization $L^{2}+BV$ method for the inverse problem. This can extend the applicability for reconstructing the unknown functions. Rigorous analysis is carried out for the inverse problem. In particular, we analyze the existence and stability of regularized variational problem and the convergence. To reduce the dimension in the inversion for numerical simulation, the unknown coefficient is represented by a suitable set of basis functions based on a priori information. A few numerical examples are presented for the inverse problem in time fractional diffusion equations to confirm the theoretic analysis and the efficacy of the different regularization methods.
Fully adaptive computations of the resistive magnetohydrodynamic (MHD) equations are presented in two and three space dimensions using a finite volume discretization on locally refined dyadic grids. Divergence cleaning is used to control the incompre
ssibility constraint of the magnetic field. For automatic grid adaptation a cell-averaged multiresolution analysis is applied which guarantees the precision of the adaptive computations, while reducing CPU time and memory requirements. Implementation issues of the open source code CARMEN-MHD are discussed. To illustrate its precision and efficiency different benchmark computations including shock-cloud interaction and magnetic reconnection are presented.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
