This paper is concerned with studying the performance of some global iterative schemes
based on Hessenberg process to solve the Sylvester tensor equation (STE). Furthermore …

This study proposes an efficient parallel computation method based on Seed-
preconditioned Conjugate Gradient (Seed-PCG) algorithm, to address the issue of …

PageRank is a widespread model for analysing the relative relevance of nodes within large
graphs arising in several applications. In the current paper, we present a cost-effective …

This paper mainly deals with applying a general class of preconditioners to accelerate the
convergence speed of some iterative schemes for solving multi-linear systems whose …

Block Krylov subspace methods are the most popular algorithms for solving large
nonsymmetric linear systems with multiple right-hand sides. One of them is the block CMRH …

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 …

In this paper, the block generalized product-type bi-conjugate gradient (GPBi-CG) method
for solving large, sparse nonsymmetric linear systems of equations with multiple right-hand …

In this paper, we present two new projection methods based on the Hessenberg process to
compute the approximate solutions of Sylvester tensor equation with low-rank right-hand …

Some Krylov subspace methods for approximating the action of matrix functions are
presented in this paper. The main idea of these techniques is to project the approximation …

Sažetak We revisit the implementation of the Krylov subspace method based on the
Hessenberg process for general linear operator equations. It is established that at each step …