Volume 47, Number 5, September-October 2013
|Page(s)||1515 - 1531|
|Published online||14 August 2013|
Convolutive decomposition and fast summation methods for discrete-velocity approximations of the Boltzmann equation
1 DPMMS, Centre for Mathematical
Sciences, University of Cambridge, Wilberforce Road, Cambridge
CB3 0WA, United
2 DMI, Università di Ferrara, Via Machiavelli 35, 44121 Ferrara, Italy.
3 CSCAMM, University of Maryland, CSIC Building, Paint Branch Drive, College Park, MD 20740, USA.
Revised: 11 December 2012
Discrete-velocity approximations represent a popular way for computing the Boltzmann collision operator. The direct numerical evaluation of such methods involve a prohibitive cost, typically O(N2d + 1) where d is the dimension of the velocity space. In this paper, following the ideas introduced in [C. Mouhot and L. Pareschi, C. R. Acad. Sci. Paris Sér. I Math. 339 (2004) 71–76, C. Mouhot and L. Pareschi, Math. Comput. 75 (2006) 1833–1852], we derive fast summation techniques for the evaluation of discrete-velocity schemes which permits to reduce the computational cost from O(N2d + 1) to O(N̅dNd log2N), N̅ ≪ N, with almost no loss of accuracy.
Mathematics Subject Classification: 65T50 / 68Q25 / 74S25 / 76P05
Key words: Boltzmann equation / discrete-velocity approximations / discrete-velocity methods / fast summation methods / farey series / convolutive decomposition
© EDP Sciences, SMAI, 2013
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.