TY - JOUR
T1 - Spectral Approximation of the Free-Space Heat Kernel
AU - Greengard, Leslie
AU - Lin, Patrick
N1 - Funding Information:
1Courant Institute of Mathematical Sciences, New York University, New York, New York 10012. 2 The work of this author was supported by the Applied Mathematical Science Program of the U.S. Department of Energy under Contract DEFGO288ER25053, by a NSF Presidential Young Investigator Award, and by a Packard Foundation Fellowship. 3The work of this author was supported by a NSF Presidential Young Investigator Award to Leslie Greengard and by the Office of Naval Research Grant N00014-91-J-1312. Present address: Municipal Derivatives, Citibank, 399 Park Ave., 7th Floor, New York, NY 10043.
PY - 2000/7
Y1 - 2000/7
N2 - Many problems in applied mathematics, physics, and engineering require the solution of the heat equation in unbounded domains. Integral equation methods are particularly appropriate in this setting for several reasons: they are unconditionally stable, they are insensitive to the complexity of the geometry, and they do not require the artificial truncation of the computational domain as do finite difference and finite element techniques. Methods of this type, however, have not become widespread due to the high cost of evaluating heat potentials. When mpoints are used in the discretization of the initial data, Mpoints are used in the discretization of the boundary, and Ntime steps are computed, an amount of work of the order O(N2M2+NMm) has traditionally been required. In this paper, we present an algorithm which requires an amount of work of the order O(NMlog M+mlog m) and which is based on the evolution of the continuousspectrum of the solution. The method generalizes an earlier technique developed by Greengard and Strain (1990, Comm. Pure Appl. Math.43, 949) for evaluating layer potentials in bounded domains.
AB - Many problems in applied mathematics, physics, and engineering require the solution of the heat equation in unbounded domains. Integral equation methods are particularly appropriate in this setting for several reasons: they are unconditionally stable, they are insensitive to the complexity of the geometry, and they do not require the artificial truncation of the computational domain as do finite difference and finite element techniques. Methods of this type, however, have not become widespread due to the high cost of evaluating heat potentials. When mpoints are used in the discretization of the initial data, Mpoints are used in the discretization of the boundary, and Ntime steps are computed, an amount of work of the order O(N2M2+NMm) has traditionally been required. In this paper, we present an algorithm which requires an amount of work of the order O(NMlog M+mlog m) and which is based on the evolution of the continuousspectrum of the solution. The method generalizes an earlier technique developed by Greengard and Strain (1990, Comm. Pure Appl. Math.43, 949) for evaluating layer potentials in bounded domains.
UR - http://www.scopus.com/inward/record.url?scp=0347899527&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0347899527&partnerID=8YFLogxK
U2 - 10.1006/acha.2000.0310
DO - 10.1006/acha.2000.0310
M3 - Article
AN - SCOPUS:0347899527
SN - 1063-5203
VL - 9
SP - 83
EP - 97
JO - Applied and Computational Harmonic Analysis
JF - Applied and Computational Harmonic Analysis
IS - 1
ER -