A note on the \(\top\)-Stein matrix equation
From MaRDI portal
Publication:2319152
DOI10.1155/2013/824641zbMath1470.15011arXiv1305.4243OpenAlexW2011373375WikidataQ58917549 ScholiaQ58917549MaRDI QIDQ2319152
Publication date: 16 August 2019
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.4243
Related Items (5)
On the solution of the linear matrix equation \(X = Af(X) B + C\) ⋮ Uniqueness of solution of a generalized \(\star\)-Sylvester matrix equation ⋮ Contour integral solutions of Sylvester-type matrix equations ⋮ Restarted global FOM and GMRES algorithms for the Stein-like matrix equation \(X + \mathcal{M}(X) = C\) ⋮ Projection methods for large-scale T-Sylvester equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\)
- Toward solution of matrix equation \(X=Af(X)B+C\)
- On Smith-type iterative algorithms for the Stein matrix equation
- Iterative algorithms for solving the matrix equation \(AXB + CX^{T}D = E\)
- The matrix equation \(X + AX^TB = C\): Conditions for unique solvability and a numerical algorithm for its solution
- Numerical Solution of Algebraic Riccati Equations
- Iterative methods for solving linear matrix equation and linear matrix system
- The Equations ATX\pm XTA=B
- A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations
- Accuracy and Stability of Numerical Algorithms
- Backward error, sensitivity, and refinement of computed solutions of algebraic Riccati equations
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- Matrix Equation $XA + BX = C$
- Matrix theory. Basic results and techniques
This page was built for publication: A note on the \(\top\)-Stein matrix equation