Name
Abstract | ||
|---|---|---|
We give a fast numerical algorithm to evaluate a class of multivariable integrals. A direct numerical evaluation of these integrals costs $N^m$, where $m$ is the number of variables and $N$ is the number of the quadrature points for each variable. For $m=2$ and $m=3$ and for only one-dimensional variables, we present an algorithm which is able to reduce this cost from $N^m$ to a cost of the order of $O((-\log \epsilon )^{\mu_m} N)$, where $\epsilon$ is the desired accuracy and $\mu_m$ is a constant that depends only on $m$. Then, we make some comments about possible extensions of such algorithms to number of variables $m\geq 4$ and to higher dimensions. This recursive algorithm can be viewed as an extension of ``fast multipole methods" to situations where the interactions between particles are more complex than the standard case of binary interactions. Numerical tests illustrating the efficiency and the limitation of this method are presented. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1137/S0036142902409690 | SIAM J. Numerical Analysis |
Keywords | DocType | Volume |
multivariable integrals,direct numerical evaluation,numerical test,recursive algorithm,integrals cost,multipole method,binary interaction,fast numerical algorithm,fast multipole method,multivariable integral,one-dimensional variable,higher dimension | Journal | 42 |
Issue | ISSN | Citations |
5 | 0036-1429 | 0 |
PageRank | References | Authors |
0.34 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Olivier Bokanowski | 1 | 98 | 12.07 |
| Mohammed Lemou | 2 | 128 | 15.85 |