Data-Sparse Approximation to Operator-Valued Functions of Elliptic Operator

Ivan P. Gavrilyuk, Wolfgang Hackbusch, and Boris N. Khoromskij

Contact the author: Please use for correspondence this email.
Submission date: 10. Jul. 2002
Pages: 25
published in: Mathematics of computation, 73 (2004) 247, p. 1297-1324 
Bibtex
with the following different title: Data-sparse approximation to the operator-valued functions of elliptic operator
MSC-Numbers: 47A56, 65F30, 15A24, 15A99
Download full preprint: PDF (375 kB), PS ziped (305 kB)

Abstract:
In previous papers the arithmetic of hierarchical matrices has been described, which allows to compute the inverse, for instance, of finite element stiffness matrices discretising an elliptic operator L. The required computing time is up to logarithmic factors linear in the dimension of the matrix. In particular, this technique can be used for the computation of the discrete analogue of a resolvent (zI-L)^-1 for complex z.

In the present paper, we consider various operator functions, the operator exponential e^-tL, negative fractional powers L^-a, the cosine operator function cos(t L^1/2) L^-k and, finally, the solution operator of the Lyapunov equation. Using the Dunford-Cauchy representation, we get integrals which can be discretised by a quadrature formula which involves the resolvents (z_k I - L)^-1 mentioned above. We give error estimates which are partly exponentially, partly polynomially decreasing.