Abstract
We present a deterministic scheme for the discrete Smoluchowski's coagulation equation based on a binary grid refinement. Starting from the binary grid Ω0={1,2,4,8,16,. . .}, we first introduce an appropriate grid refinement by adding at each level 2l grid points in every binary subsection of the grid Ωl. In a next step we derive an approximate equation for the dynamic behavior on each level Ωl based on a piecewise constant approximation of the right hand side of Smoluchowski's equation. Numerical results show that the computational effort can be drastically decreased compared to the corresponding complete integer grid. When considering unbounded kernels in Smoluchowski's equation we use an adaptive time step method to overcome numerical instabilities which may occur at the tails of the density function.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: Numerical Algorithms
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
