ترغب بنشر مسار تعليمي؟ اضغط هنا

Multiresolution Schemes and its Application to Sedimentation Models

132   0   0.0 ( 0 )
 نشر من قبل Ricardo Ruiz Baier
 تاريخ النشر 2008
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

A numerical method is presented to obtain approximate solutions to problems arising from sedimentation models. These processes are widely utilized in minery for recovering water from suspensions coming out of flotation processes. The main idea is to apply a multiresolution method to the existing schemes developed by Burger et al. [2, 3, 4] and to observe the good performance of the multiresolution strategy when applied to these kind of problems. We obtain high rates of memory compression without affecting the quality of the solution.



قيم البحث

اقرأ أيضاً

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.
This work deals with the numerical solution of the monodomain and bidomain models of electrical activity of myocardial tissue. The bidomain model is a system consisting of a possibly degenerate parabolic PDE coupled with an elliptic PDE for the trans membrane and extracellular potentials, respectively. This system of two scalar PDEs is supplemented by a time-dependent ODE modeling the evolution of the so-called gating variable. In the simpler sub-case of the monodomain model, the elliptic PDE reduces to an algebraic equation. Two simple models for the membrane and ionic currents are considered, the Mitchell-Schaeffer model and the simpler FitzHugh-Nagumo model. Since typical solutions of the bidomain and monodomain models exhibit wavefronts with steep gradients, we propose a finite volume scheme enriched by a fully adaptive multiresolution method, whose basic purpose is to concentrate computational effort on zones of strong variation of the solution. Time adaptivity is achieved by two alternative devices, namely locally varying time stepping and a Runge-Kutta-Fehlberg-type adaptive time integration. A series of numerical examples demonstrates thatthese methods are efficient and sufficiently accurate to simulate the electrical activity in myocardial tissue with affordable effort. In addition, an optimalthreshold for discarding non-significant information in the multiresolution representation of the solution is derived, and the numerical efficiency and accuracy of the method is measured in terms of CPU time speed-up, memory compression, and errors in different norms.
Solutions to conservation laws satisfy the monotonicity property: the number of local extrema is a non-increasing function of time, and local maximum/minimum values decrease/increase monotonically in time. This paper investigates this property from a numerical standpoint. We introduce a class of fully discrete in space and time, high order accurate, difference schemes, called generalized monotone schemes. Convergence toward the entropy solution is proven via a new technique of proof, assuming that the initial data has a finite number of extremum values only, and the flux-function is strictly convex. We define discrete paths of extrema by tracking local extremum values in the approximate solution. In the course of the analysis we establish the pointwise convergence of the trace of the solution along a path of extremum. As a corollary, we obtain a proof of convergence for a MUSCL-type scheme being second order accurate away from sonic points and extrema.
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.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا