An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation
DOI10.1016/j.amc.2008.02.035zbMath1154.65023OpenAlexW2033966841MaRDI QIDQ942379
Masoud Hajarian, Mehdi Dehghan
Publication date: 5 September 2008
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2008.02.035
numerical examplesFrobenius normSylvester matrix equationreflexive solution pairreflexive matrixKronecker matrix productmatrix iterative method
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (only showing first 100 items - show all)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient algorithm for the least-squares reflexive solution of the matrix equation \(A_{1}XB_{1} = C_{1}, A_{2}XB_{2} = C_{2}\)
- A new projection method for solving large Sylvester equations
- Minimal residual methods augmented with eigenvectors for solving Sylvester equations and generalized Sylvester equations
- Computing a nearest symmetric positive semidefinite matrix
- Symmetric solutions of linear matrix equations by matrix decompositions
- On solutions of matrix equation \(AXB+CYD=F\)
- The reflexive and anti-reflexive solutions of the matrix equation \(AX=B\).
- Hierarchical gradient-based identification of multivariable discrete-time systems
- An iteration method for the symmetric solutions and the optimal approximation solution of the matrix equation \(AXB\)=\(C\)
- A system of matrix equations and a linear matrix equation over arbitrary regular rings with identity
- An iterative method for the skew-symmetric solution and the optimal approximate solution of the matrix equation \(AXB=C\)
- The reflexive solutions of the matrix equation \(AX B = C\)
- Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
- Use of near-breakdowns in the block Arnoldi method for solving large Sylvester equations
- Iterative least-squares solutions of coupled sylvester matrix equations
- A system of four matrix equations over von Neumann regular rings and its applications
- On Iterative Solutions of General Coupled Matrix Equations
- An efficient iterative method for solving the matrix equationAXB +CYD =E
- Distributed and Shared Memory Block Algorithms for the Triangular Sylvester Equation with $\operatorname{sep}^{ - 1} $ Estimators
- Generalized Schur methods with condition estimators for solving the generalized Sylvester equation
- LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs
- Generalized Reflexive Matrices: Special Properties and Applications
- Iterative Solution Methods
- Hierarchical least squares identification methods for multivariable systems
- Gradient based iterative algorithms for solving a class of matrix equations
- Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\)
- A representation of the general common solution to the matrix equations \(A_1XB_1=C_1\) and \(A_2XB_2=C_2\) with applications
- Block Krylov subspace methods for solving large Sylvester equations
This page was built for publication: An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation