Name
Abstract | ||
|---|---|---|
This paper introduces a fast algorithm for the energy space boson Boltzmann collision operator. Compared to the direct O(N-3) calculation and the previous O(Nlog(2)N) method [Markowich and Pareschi, 2005], the new algorithm runs in complexity O(N log(2)N), which is optimal up to a logarithmic factor (N is the number of grid points in energy space). The basic idea is to partition the 3-D summation domain recursively into elementary shapes so that the summation within each shape becomes a special double convolution that can be computed efficiently by the fast Fourier transform. Numerical examples are presented to illustrate the efficiency and accuracy of the proposed algorithm. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1090/S0025-5718-2014-02824-X | MATHEMATICS OF COMPUTATION |
Keywords | Field | DocType |
Quantum Boltzmann equation,energy space boson Boltzmann equation,recursive domain decomposition,double convolution,fast Fourier transform | Boltzmann equation,Mathematical optimization,Convolution,Boson,Mathematical analysis,Algorithm,Fast Fourier transform,Operator (computer programming),Time complexity,Bhatnagar–Gross–Krook operator,Mathematics,Direct simulation Monte Carlo | Journal |
Volume | Issue | ISSN |
84 | 291 | 0025-5718 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jingwei Hu | 1 | 0 | 0.68 |
| Lexing Ying | 2 | 1273 | 103.92 |