Please use this identifier to cite or link to this item:
http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/4605
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Paul, J. | - |
dc.contributor.author | Ghosh, D. | - |
dc.contributor.author | Kumar, J. | - |
dc.date.accessioned | 2024-06-20T12:38:55Z | - |
dc.date.available | 2024-06-20T12:38:55Z | - |
dc.date.issued | 2024-06-20 | - |
dc.identifier.uri | http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/4605 | - |
dc.description.abstract | In this work, we introduce a weighted finite volume scheme for multiple fragmentation problems and report a convergence criterion of the scheme. It is observed that the finite volume method mentioned in Kumar and Kumar (Appl Math Comput 219(10):5140– 5151, 2013) has not estimated the physical moments of clusters with satisfactory precision. Therefore, to control this deficiency, a weight function, and a correction factor are introduced in the numerical flux to approximate the conservative formulation of the multiple fragmentation equation. The proposed scheme preserves the first two physical moments with high accuracy in the cell overlapping case for newly born clusters. It is shown that the new formulation converges weakly under certain growth restrictions on the kernels. Finally, simulation results and numerical validations are presented | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Fragmentation · | en_US |
dc.subject | Finite volume | en_US |
dc.subject | · Mass conservation | en_US |
dc.subject | Number preservation | en_US |
dc.subject | Convergence analysis | en_US |
dc.subject | Moments preservation | en_US |
dc.title | Accurate and efficient flux-corrected finite volume approximation for the fragmentation problem | en_US |
dc.type | Article | en_US |
Appears in Collections: | Year-2023 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
full text.pdf | 599.22 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.