A. H. Bentbib, M. EL Ghomari, K. Jbilou, EL. M. Sadek
Published 2024-01-06Version 1
In the present paper, we propose a block variant of the extended Hessenberg process for computing approximations of matrix functions and other problems producing large-scale matrices. Applications to the computation of a matrix function such as f(A)V, where A is an nxn large sparse matrix, V is an nxp block with p<<n, and f is a function are presented. Solving shifted linear systems with multiple right hand sides are also given. Computing approximations of these matrix problems appear in many scientific and engineering applications. Different numerical experiments are provided to show the effectiveness of the proposed method for these problems.
Low-rank updates of matrix functions II: Rational Krylov methods
Sensitivity of matrix function based network communicability measures: Computational methods and a priori bounds
Construction and evaluation of PH curves in exponential-polynomial spaces
![QR code for arXiv:2401.03330 [math.NA]](http://oss.arxitics.com/images/favicon.svg)