LSQR iterative common symmetric solutions to matrix equations AXB = E and CXD = F
From MaRDI portal
Publication:708164
DOI10.1016/J.AMC.2010.05.053zbMATH Open1206.65142OpenAlexW2070201384MaRDI QIDQ708164FDOQ708164
Authors: Tiejun Zhou, Ya-bo Chen, Zhen-Yun Peng 
Publication date: 11 October 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.05.053
Recommendations
- A matrix LSQR iterative method to solve matrix equation \(AXB=C\)
- An iterative method for the least squares symmetric solution of matrix equation \(AXB = C\)
- An iterative method for the least squares symmetric solution of the linear matrix equation \(AXB = C\)
- scientific article; zbMATH DE number 5951423
- Numerical algorithms for solving the least squares symmetric problem of matrix equation \(AXB + CXD = E\)
- scientific article; zbMATH DE number 5370781
- scientific article; zbMATH DE number 5669538
- An iterative algorithm for \(M\) symmetric solutions of the matrix equation \(AXB+CYD=E\)
- An iterative methods for the least squares bisymmetric solution of the matrix equation \(AXB=C\)
- Least-squares symmetric solution to the matrix equation \(AXB=C\) with the norm inequality constraint
Cites Work
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Hierarchical gradient-based identification of multivariable discrete-time systems
- Hierarchical least squares identification methods for multivariable systems
- Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
- Iterative least-squares solutions of coupled sylvester matrix equations
- Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
- An iterative method for the least squares symmetric solution of the linear matrix equation \(AXB = C\)
- On Iterative Solutions of General Coupled Matrix Equations
- Gradient based iterative algorithms for solving a class of matrix equations
- 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}\)
- Gradient based iterative solutions for general linear matrix equations
- A shift-splitting hierarchical identification method for solving Lyapunov matrix equations
- An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation
- An iteration method for the symmetric solutions and the optimal approximation solution of the matrix equation \(AXB\)=\(C\)
- An iterative method for symmetric solutions and optimal approximation solution of the system of matrix equations \(A_{1}XB_{1} = C_{1}, A_{2}XB_{2} = C_{2}\)
- A finite iterative method for solving a pair of linear matrix equations \((AXB,CXD)=(E,F)\)
- The matrix nearness problem for symmetric matrices associated with the matrix equation \([A^{T}XA, B^{T}XB] = [C, D]\)
- On the existence of a common solution \(X\) to the matrix equations \(A_{i} XB_{j}\)=\(C_{ij}\), \((i,j){\in}\Gamma\).
- A new version of successive approximations method for solving Sylvester matrix equations
- A numerical algorithm for Lyapunov equations
- A minimal residual algorithm for the inconsistent matrix equation \(AXB = C\) over symmetric matrices
- An efficient iterative method for solving the matrix equationAXB +CYD =E
Cited In (8)
- Alternating direction methods for solving a class of Sylvester-like matrix equations
- A new iterative algorithm for solving a class of matrix nearness problem
- A unified treatment for the restricted solutions of the matrix equation \(AXB=C\)
- On ADMM-based methods for solving the nearness symmetric solution of the system of matrix equations \(a_1 Xb_1 = C_1\) and \(a_2 Xb_2 = c_2\)
- Symmetric least squares solution of a class of Sylvester matrix equations via MINIRES algorithm
- Conjugate gradient-like algorithms for constrained operator equation related to quadratic inverse eigenvalue problems
- An efficient method for special least squares solution of the complex matrix equation \((AXB,CXD)=(E,F)\)
- Matrix LSQR algorithm for structured solutions to quaternionic least squares problem
Uses Software
This page was built for publication: LSQR iterative common symmetric solutions to matrix equations \(AXB = E\) and \(CXD = F\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708164)
