On the -Sylvester equation AX X^ B^ = C
From MaRDI portal
Publication:440722
Recommendations
- scientific article; zbMATH DE number 6098827
- On a transformation of the \(\ast\)-congruence Sylvester equation for the least squares optimization
- Backward errors and small-sample condition estimation for ⋆-Sylveter equations
- A note on Sylvester-type equations
- On the condition mumbers for \(*\)-Sylvester matrix equation
Cites work
- scientific article; zbMATH DE number 6098827 (Why is no real title available?)
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 2161246 (Why is no real title available?)
- A note on the matrix equation H=AP+PA**
- Accuracy and Stability of Numerical Algorithms
- Backward error, sensitivity, and refinement of computed solutions of algebraic Riccati equations
- Gradient based and least squares based iterative algorithms for matrix equations \(AXB + CX^{T}D = F\)
- Iterative algorithms for solving the matrix equation \(AXB + CX^{T}D = E\)
- Iterative algorithms for the minimum-norm solution and the least-squares solution of the linear matrix equations A₁XB₁ + C₁X^TD₁ = M₁, A₂XB₂ + C₂ X^TD₂ = M₂
- Iterative methods for solving linear matrix equation and linear matrix system
- On the matrix function \(AX + X'A'\)
- Structured Condition Numbers for Invariant Subspaces
- The Equations ATX\pm XTA=B
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
- The solution of the matrix equations \(AXB-CXD=E\) and \((YA-DZ,YC- BZ)=(E,F)\)
- Vibration of fast trains, palindromic eigenvalue problems and structure-preserving doubling algorithms
Cited in
(22)- Backward errors and small-sample condition estimation for ⋆-Sylveter equations
- An extended Hamiltonian algorithm for the general linear matrix equation
- Solvability and uniqueness criteria for generalized Sylvester-type equations
- On the solution of the linear matrix equation X = Af(X) B + C
- On the Sylvester-like matrix equation AX+f(X)B=C
- On T-Sylvester equations over commutative rings
- Global FOM and GMRES algorithms for a class of complex matrix equations
- The solutions of the quaternion matrix equation \(AX^\varepsilon + BX^\delta = 0\)
- On a transformation of the \(\ast\)-congruence Sylvester equation for the least squares optimization
- Projection methods for large-scale T-Sylvester equations
- A flexible global GCRO-DR method for shifted linear systems and general coupled matrix equations
- On the solvability of generalized Sylvester operator equations
- The solutions of a class of Sylvester-like linear matrix equations and the estimation of the associated measurements of their solutions
- Some iterative algorithms for positive definite solution to nonlinear matrix equations
- A note on Sylvester-type equations
- Q-less QR decomposition in inner product spaces
- Uniqueness of solution of a generalized \(\star\)-Sylvester matrix equation
- On estimating the separation between \((A, B)\) and \((C, D)\) associated with the generalized Sylvester equation \(A X D - B X C = E\)
- Positive definite solutions of the nonlinear matrix equation \(X + A^H\bar{X}^{-1}A = I\)
- A note on the -Stein matrix equation
- Relation between the T-congruence Sylvester equation and the generalized Sylvester equation
- The solution of the equation \(AX+BX^{\star}=0\)
This page was built for publication: On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q440722)
