The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation A X + X B = C
From MaRDI portal
Publication:1992375
Summary: In this paper, we present two different relaxed gradient based iterative (RGI) algorithms for solving the symmetric and skew symmetric solution of the Sylvester matrix equation \(A X + X B = C\). By using these two iterative methods, it is proved that the iterative solution converges to its true symmetric (skew symmetric) solution under some appropriate assumptions when any initial symmetric (skew symmetric) matrix \(X_0\) is taken. Finally, two numerical examples are given to illustrate that the introduced iterative algorithms are more efficient.
Recommendations
- Iterative solutions to Sylvester matrix equations
- Gradient based iterative solutions for Sylvester-conjugate matrix equations
- The relaxed gradient based iterative algorithm for solving matrix equations \(A_iXB_i=F_i\)
- A symmetric preserving iterative method for generalized Sylvester equation
- The least squares symmetric-skew symmetric solution of the generalized coupled Sylvester matrix equations
Cites work
- A gradient flow approach to the robust pole‐placement problem
- A Hessenberg-Schur method for the problem AX + XB= C
- A modified gradient based algorithm for solving Sylvester equations
- A new solution to the generalized Sylvester matrix equation \(AV-EVF=BW\)
- A new version of successive approximations method for solving Sylvester matrix equations
- A note on the iterative solutions of general coupled matrix equation
- A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications
- A novel numerical method for exact model matching problem with stability
- A relaxed gradient based algorithm for solving Sylvester equations
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- An implicit preconditioning strategy for large-scale generalized Sylvester equations
- Disturbance Decoupling for Descriptor Systems by State Feedback
- Gradient based iterative algorithms for solving a class of matrix equations
- Hierarchical gradient-based identification of multivariable discrete-time systems
- Hierarchical identification of lifted state-space models for general dual-rate systems
- Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations
- Iterative method to solve the generalized coupled Sylvester-transpose linear matrix equations over reflexive or anti-reflexive matrix
- Iterative methods to solve the generalized coupled Sylvester-conjugate matrix equations for obtaining the centrally symmetric (centrally antisymmetric) matrix solutions
- Iterative orthogonal direction methods for Hermitian minimum norm solutions of two consistent matrix equations
- Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
- Iterative solutions to the extended Sylvester-conjugate matrix equations
- Minimal residual methods augmented with eigenvectors for solving Sylvester equations and generalized Sylvester equations
- Minimum norm regularization of descriptor systems by mixed output feedback
- New approaches for solving large Sylvester equations
- Numerically Reliable Computing for the Row by Row Decoupling Problem with Stability
- On a Hermitian and skew-Hermitian splitting iteration method for continuous Sylvester equations
- On Iterative Solutions of General Coupled Matrix Equations
- On the solution to the Sylvester matrix equation AV+BW=EVF
- Pole assignment via Sylvester's equation
- Pole assignment with eigenvalue and stability robustness
- Pole assignment with optimal spectral conditioning
- Preconditioned Galerkin and minimal residual methods for solving Sylvester equations
- Regularization of Singular Systems by Derivative and Proportional Output Feedback
- Robust Partial Pole Assignment for Vibrating Systems With Aerodynamic Effects
- Solutions of the equation AV+BW=VF and their application to eigenstructure assignment in linear systems
- The accelerated gradient based iterative algorithm for solving a class of generalized Sylvester-transpose matrix equation
- Unified gradient approach to performance optimization under a pole assignment constraint.
Cited in
(8)- The steepest descent of gradient-based iterative method for solving rectangular linear systems with an application to Poisson's equation
- Developing Kaczmarz method for solving Sylvester matrix equations
- Gradient-descent iterative algorithm for solving a class of linear matrix equations with applications to heat and Poisson equations
- Approximated least-squares solutions of a generalized Sylvester-transpose matrix equation via gradient-descent iterative algorithm
- Convergence analysis of gradient-based iterative algorithms for a class of rectangular Sylvester matrix equations based on Banach contraction principle
- A symmetric preserving iterative method for generalized Sylvester equation
- QRGI algorithm for solving quaternion equation and its application
- Sketch-and-project method to semi-supervised graph-based learning via Sylvester-class matrix equation
This page was built for publication: The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1992375)
