This article considers the iterative approach for finding the Moore–Penrose inverse of a
matrix. A convergence analysis is presented under certain conditions, demonstrating that the …

The goal of this paper is to investigate distributed temporal difference (TD) learning for a
networked multi-agent Markov decision process. The proposed approach is based on …

We analyze graphs attaining the extreme values of various spectral indices in the class of all
simple connected graphs, as well as in the class of graphs which are not complete …

We derive a double-optimal iterative algorithm (DOIA) in an m-degree matrix pencil Krylov
subspace to solve a rectangular linear matrix equation. Expressing the iterative solution in a …

In this paper, we investigate the Moore-Penrose inversion of a simple connected graph. We
analyze qualitative, statistical, and extreme properties of spectral indices of signable pseudo …

Let (G, w) be a weighted graph with the adjacency matrix A. The group inverse of (G, w),
denoted by (G#, w#) is the weighted graph with the weight w#(vivj) of an edge vivj in G# is …

In this paper, a class of matrices, namely, Drazin-dagger ma-trices, in which the Drazin
inverse and the Moore-Penrose inverse com-mute, is introduced. Also, some properties of …