Pages that link to "Item:Q642661"
From MaRDI portal
The following pages link to An efficient algorithm for solving extended Sylvester-conjugate transpose matrix equations (Q642661):
Displaying 14 items.
- Finite iterative algorithms for extended Sylvester-conjugate matrix equations (Q409912) (← links)
- Iterative solutions to coupled Sylvester-transpose matrix equations (Q651661) (← links)
- Iterative solutions to the extended Sylvester-conjugate matrix equations (Q708149) (← links)
- Uniqueness of solution of a generalized \(\star\)-Sylvester matrix equation (Q905721) (← links)
- The MGPBiCG method for solving the generalized coupled Sylvester-conjugate matrix equations (Q1664179) (← links)
- A finite iterative algorithm for solving the complex generalized coupled Sylvester matrix equations by using the linear operators (Q1691184) (← links)
- Iterative solutions of a set of matrix equations by using the hierarchical identification principle (Q1724671) (← links)
- Conjugate gradient least squares algorithm for solving the generalized coupled Sylvester-conjugate matrix equations (Q2335526) (← links)
- New proof of the gradient-based iterative algorithm for a complex conjugate and transpose matrix equation (Q2412293) (← links)
- The solution of the equation<i>AX</i> + <i>BX</i><sup>⋆</sup> = 0 (Q2872527) (← links)
- A cubic time algorithm for finding the principal solution to Sylvester matrix equations over (<i>max</i>, +) (Q2938337) (← links)
- A modified gradient‐based algorithm for solving extended Sylvester‐conjugate matrix equations (Q4576620) (← links)
- On a transformation of the ∗-congruence Sylvester equation for the least squares optimization (Q5858989) (← links)
- The solutions of the quaternion matrix equation \(AX^\varepsilon + BX^\delta = 0\) (Q6083993) (← links)