Generalized reflexive and anti-reflexive solutions of the coupled Sylvester matrix equations via CD algorithm
From MaRDI portal
Publication:4639937
DOI10.1177/1077546316640976zbMath1387.65031OpenAlexW2320769906MaRDI QIDQ4639937
Publication date: 15 May 2018
Published in: Journal of Vibration and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1177/1077546316640976
coupled Sylvester matrix equationsgeneralized reflexive matrixgeneralized anti-reflexive matrixconjugate direction (CD) algorithm
Related Items
An efficient algorithm based on Lanczos type of BCR to solve constrained quadratic inverse eigenvalue problems, Noise-tolerant continuous-time Zhang neural networks for time-varying Sylvester tensor equations
Cites Work
- On the Sylvester-like matrix equation \(AX+f(X)B=C\)
- Iterative algorithms for \(X+A^{\mathrm T}X^{-1}A=I\) by using the hierarchical identification principle
- The reflexive least squares solutions of the matrix equation \(A_1X_1B_1+A_2X_2B_2+\cdots +A_lX_lB_l=C\) with a submatrix constraint
- Closed-form solutions to the nonhomogeneous Yakubovich-transpose matrix equation
- Matrix iterative methods for solving the Sylvester-transpose and periodic Sylvester matrix equations
- A property of the eigenvalues of the symmetric positive definite matrix and the iterative algorithm for coupled Sylvester matrix equations
- Finite iterative algorithms for solving generalized coupled Sylvester systems. I: One-sided and generalized coupled Sylvester matrix equations over generalized reflexive solutions
- Finite iterative algorithms for solving generalized coupled Sylvester systems. II: Two-sided and generalized coupled Sylvester matrix equations over reflexive solutions
- Toward solution of matrix equation \(X=Af(X)B+C\)
- Gradient based and least squares based iterative algorithms for matrix equations \(AXB + CX^{T}D = F\)
- Analysis of an iterative algorithm to solve the generalized coupled Sylvester matrix equations
- LSQR iterative method for generalized coupled Sylvester matrix equations
- Generating conjugate directions for arbitrary matrices by matrix equations. I
- Generating conjugate directions for arbitrary matrices by matrix equations. II
- The general coupled matrix equations over generalized bisymmetric matrices
- An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation
- Least squares Hermitian solution of the matrix equation \((AXB,CXD)=(E,F)\) with the least norm over the skew field of quaternions
- A relation between the weighted logarithmic norm of a matrix and the Lyapunov equation
- Improved gradient-based neural networks for online solution of Lyapunov matrix equation
- Developing BiCOR and CORS methods for coupled Sylvester-transpose and periodic Sylvester matrix equations
- Matrix form of the CGS method for solving general coupled matrix equations
- Iterative least-squares solutions of coupled sylvester matrix equations
- Eigenvectors of certain matrices
- Solvability conditions and general solution for mixed Sylvester equations
- On Iterative Solutions of General Coupled Matrix Equations
- Truncated low‐rank methods for solving general linear matrix equations
- Iterative orthogonal direction methods for Hermitian minimum norm solutions of two consistent matrix equations
- Centrosymmetric (Cross-Symmetric) Matrices, Their Basic Properties, Eigenvalues, and Eigenvectors
- 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
- Generalized Reflexive Matrices: Special Properties and Applications
- The (R, S)-symmetric least squares solutions of the general coupled matrix equations
- Developing the CGLS algorithm for the least squares solutions of the general coupled matrix equations
- Gradient based iterative algorithms for solving a class of matrix equations
- Krylov Subspace Methods for Large-Scale Constrained Sylvester Equations
- The nearness problems for symmetric centrosymmetric with a special submatrix constraint
- Unnamed Item
- Unnamed Item
- Unnamed Item