Lyapunov’s direct method. Two matrix equations have been derived: matrix polynomial equation and continuous (discrete) Lyapunov matrix equation. Also, modifications of the existing sufficient conditions of convergence of Traub and Bernoilli algorithms for computing the dominant solvent of the matrix polynomial equation are derived. These results have been extended to large scale systems as well...

In this paper, we state some results on product of operators with closed ranges and we solve the operator equation $TXS^*-SX^*T^*= A$ in the general setting of the adjointable operators between Hilbert $C^*$-modules, when $TS = 1$. Furthermore, by using some block operator matrix techniques, we nd explicit solution of the operator equation $TXS^*-SX^*T^*= A$.

in this paper, a numerical efficient method based on two-dimensional block-pulse functions (bpfs) is proposed to approximate a solution of the two-dimensional linear stochastic volterra-fredholm integral equation. finally the accuracy of this method will be shown by an example.

Abstract. The matrix valued analog of the Euler’s hypergeometric differential equation was introduced by Tirao in [1]. This equation arises in the study of matrix valued spherical functions and in the theory of matrix valued orthogonal polynomials. The goal of this paper is to extend naturally the number of parameters of Tirao’s equation in order to get a generalized matrix valued hypergeometri...

AX B In the paper, a class of fuzzy matrix equations    B where A is an m × n crisp matrix and is an m × p arbitrary LR fuzzy numbers matrix, is investigated. We convert the fuzzy matrix equation into two crisp matrix equations. Then the fuzzy approximate solution of the fuzzy matrix equation is obtained by solving two crisp matrix equations. The existence condition of the strong LR fuzzy s...

An iterative algorithm is constructed to solve the linear matrix equation pair AXB E, CXD F over generalized reflexive matrix X. When the matrix equation pair AXB E, CXD F is consistent over generalized reflexive matrix X, for any generalized reflexive initial iterative matrix X1, the generalized reflexive solution can be obtained by the iterative algorithm within finite iterative steps in the ...