Accessible Requires Authentication Published by De Gruyter June 30, 2020

A note on the efficient evaluation of a modified Hilbert transformation

Olaf Steinbach and Marco Zank

Abstract

In this note we consider an efficient data–sparse approximation of a modified Hilbert type transformation as it is used for the space–time finite element discretization of parabolic evolution equations in the anisotropic Sobolev space H1,1/2(Q). The resulting bilinear form of the first-order time derivative is symmetric and positive definite, and similar as the integration by parts formula for the Laplace hypersingular boundary integral operator in 2D. Hence we can apply hierarchical matrices for data–sparse representations and for acceleration of the computations. Numerical results show the efficiency in the approximation of the first-order time derivative. An efficient realisation of the modified Hilbert transformation is a basic ingredient when considering general space–time finite element methods for parabolic evolution equations, and for the stable coupling of finite and boundary element methods in anisotropic Sobolev trace spaces.

JEL Classification: 65L60; 65M60

References

[1] M. Bebendorf, Hierarchical Matrices: A Means to Efficiently Solve Elliptic Boundary Value Problems. Lecture Notes in Computational Science and Engineering, Vol. 63, Springer, Berlin–Heidelberg, 2008. Search in Google Scholar

[2] S. Börm, Efficient numerical methods for non-local operators: H2 matrix compression, algorithms and analysis. EMS Tracts Math., (2010), Band 14. Search in Google Scholar

[3] D. Devaud, Petrov–Galerkin space–time hp-approximation of parabolic equations in H1/2. IMA J. Numer. Anal., 40 (2020), 2717–2745. Search in Google Scholar

[4] M. Fontes, Parabolic equations with low regularity. PhD thesis, Lund Institute of Technology, 1996. Search in Google Scholar

[5] I. S. Gradshteyn and I. M. Ryzhik, Table of Integrals, Series, and Products. Academic Press, New York, 1980. Search in Google Scholar

[6] W. Hackbusch, Hierarchical Matrices: Algorithms and Analysis. Springer Series in Computational Mathematics, Vol. 49, Springer, Berlin–Heidelberg, 2015. Search in Google Scholar

[7] S. Larsson and C. Schwab, Compressive space–time Galerkin discretizations of parabolic partial differential equations.arXiv:1501.04514, 2015. Search in Google Scholar

[8] J. Nečas, Les Méthodes Directes en Théorie des Équations Elliptiques. Masson, Paris, Academia, Prague, 1967. Search in Google Scholar

[9] S. Rjasanow and O. Steinbach, The Fast Solution of Boundary Integral Equations. Springer, New York, 2007. Search in Google Scholar

[10] S. A. Sauter and C. Schwab, Boundary Element Methods. Springer Series in Computational Mathematics, Vol. 39. Springer, Berlin, 2011. Search in Google Scholar

[11] C. Schwab and R. Stevenson, Fractional space-time variational formulations of (Navier–) Stokes equations. SIAM J. Math. Anal., 49 (2017), 2442–2467. Search in Google Scholar

[12] O. Steinbach, Numerical Approximation Methods for Elliptic Boundary Value Problems. Springer, New York, 2008. Search in Google Scholar

[13] O. Steinbach and W. L. Wendland, The construction of some efficient preconditioners in the boundary element method. Adv. Comput. Math. 9 (1998), 191–216. Search in Google Scholar

[14] O. Steinbach and M. Zank, Coercive space–time finite element methods for initial boundary value problems. Electron. Trans. Numer. Anal., 52 (2020), 154–194. Search in Google Scholar

[15] The GYPSILAB Toolbox for MATLAB. https://github.com/matthieuaussal/gypsilab Search in Google Scholar

Received: 2019-11-11
Revised: 2020-04-24
Accepted: 2020-05-07
Published Online: 2020-06-30
Published in Print: 2021-03-26

© 2021 Walter de Gruyter GmbH, Berlin/Boston