Sentence examples for reflexive solutions from inspiring English sources

We show that the proposed iterative technique converges to the generalized reflexive solutions within a finite number of iterations in the absence of round-off errors.

Yin et al. [15] presented a finite iterative algorithm for the two-sided and generalized coupled Sylvester matrix equations over reflexive solutions.

In addition, we give the least-norm generalized reflexive solutions of Problem I when an appropriate initial iterative matrix group is chosen.

Very recently, Huang et al. [14] presented a finite iterative algorithm for the one-sided and generalized coupled Sylvester matrix equations over generalized reflexive solutions.

For any chosen positive number ε, however small it is, e.g., ε = 1.0000 e- 010, whenever ∥ R ( k ) ∥ < ε, stop the iteration, X 1 ( k ) and X 2 ( k ) are regarded to be generalized reflexive solutions of Eq. (9).

Thus we obtain the reflexive solution of Eq. (9).

In this paper, we consider the generalized reflexive solution of Eq. (1) and the optimal approximation generalized reflexive solution.

However, to our knowledge, the generalized reflexive solution to the more general coupled matrix equation (1) and the optimal approximation reflexive solution have not been derived.

We will find the generalized reflexive solution of Eq. (9) by using Algorithm 2.1.

Furthermore, the optimal approximate generalized reflexive solution of the general coupled matrix equations to a given generalized reflexive matrix group can be derived by finding the least-norm generalized reflexive solution of new corresponding general coupled matrix equations.

Thus ( X 1 ∗, X 2 ∗, …, X q ∗ ) is the unique least Frobenius norm generalized reflexive solution group of Problem I. □.