Abstract
A new computational algorithm based on a fast way of computing integral operators describing the coagulation process is proposed for a mathematical model of coagulating particles. Using this algorithm, the computational complexity of each timestep of an explicit difference scheme can be substantially reduced. For each step, the complexity of execution is reduced from O(NM2) arithmetic operations to O(NMRlnM), where N is the number of mesh points along the physical coordinates of particles, M is the number of mesh points in a grid corresponding to sizes of coagulating particles, and R is the rank of a matrix corresponding to the values of the function of a coagulation kernel at mesh points. Using this approach, computations can be greatly accelerated, provided that kernel rank R is small.
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 callMore From: Moscow University Computational Mathematics and Cybernetics
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.
