2006 Reports

# Complexity and tractability of the heat equation

In a previous paper, we developed a general framework for establishing tractability and strong tractability for quasilinear multivariate problems in the worst case setting. One important example of such a problem is the solution of the heat equation ut = ∆u − qu in Id × (0,T), where I is the unit inter- val and T is a maximum time value. This problem is to be solved subject to homogeneous Dirichlet boundary conditions, along with the initial conditions u(·,0) = f over Id. The solution u depends linearly on f, but nonlinearly on q. Here, both f and q are d-variate functions from a reproducing kernel Hilbert space with finite-order weights of order ω. This means that, although d can be arbitrary large, f and q can be decomposed as sums of functions of at most ω variables, with ω independent of d. In this paper, we apply our previous general results to the heat equation. We study both the absolute and normalized error criteria. For either error criterion, we show that the problem is . That is, the number of evaluations of f and q needed to obtain an ε-approximation is polynomial in ε and d, with the degree of the polynomial depending linearly on ω. In addition, we want to know when the problem is strongly tractable, meaning that the dependence is polynomial only in ε, independently of d. We show that if the sum of the weights defining the weighted reproducing kernel Hilbert space is uniformly bounded in d and the integral of the univariate kernel is positive, then the heat equation is strongly tractable

## Subjects

## Files

- cucs-031-06.pdf application/pdf 150 KB Download File

## More About This Work

- Academic Units
- Computer Science
- Publisher
- Department of Computer Science, Columbia University
- Series
- Columbia University Computer Science Technical Reports, CUCS-031-06
- Published Here
- April 27, 2011