Boris N. Khoromskij

Boris N. Khoromskij

Auto-generated profile, based on publicly available information

Boris N. Khoromskij

Max Planck Institute for Mathematics in the Sciences Inselstr. 22-26 D-04103 Leipzig Germany

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 April 2011 in Constructive Approximation
Verified
Journal Article
Closed access
PDF file
BKBoris N. Khoromskij
Boris N. Khoromskij

1 February 2000 in Computing
Verified
Journal Article
Closed access
PDF file
WHW. Hackbusch
W. Hackbusch
BKB. N. Khoromskij
B. N. Khoromskij


26 July 2004 in Computing
Verified
Journal Article
Closed access
PDF file
WHW. Hackbusch
W. Hackbusch
BKB. N. Khoromskij
B. N. Khoromskij
RKR. Kriemann
R. Kriemann


27 February 2008 in Numerische Mathematik
Verified
Journal Article
Open access
PDF file
WHWolfgang Hackbusch
Wolfgang Hackbusch
BKBoris N. Khoromskij
Boris N. Khoromskij
ETEugene E. Tyrtyshnikov
Eugene E. Tyrtyshnikov
Important matrix-valued functions f (A) are, e.g., the inverse A −1, the square root \({\sqrt{A}}\) and the sign function. Their evaluation for large matrices arising from pdes is not an easy task and needs techniques exploiting appropriate structures of the matrices A and f (A) (often f (A) possesses this structure only approximately). However, intermediate matrices arising during the evaluation may lose the structure of the initial matrix. This would make the computations inefficient and even infeasible. However, the main result of this paper is that an iterative fixed-point like process for the evaluation of f (A) can be transformed, under certain general assumptions, into another process which preserves the convergence rate and benefits from the underlying structure. It is shown how this result applies to matrices in a tensor format with a bounded tensor rank and to the structure of the hierarchical matrix technique. We demonstrate our results by verifying all requirements in the case of the iterative computation of A −1 and \({\sqrt{A}}\).