Least-squares solution with the minimum-norm for the matrix equation \((A\times B,G\times H) = (C,D)\)
From MaRDI portal
Publication:814330
DOI10.1016/j.camwa.2005.02.011zbMath1087.65040OpenAlexW2050500034MaRDI QIDQ814330
Publication date: 6 February 2006
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2005.02.011
numerical experimentsmatrix equationgeneralized singular value decompositionminimum-norm solutioncanonical correlation decompositionLeast-squares solutionToeplitz and Hankel matrices
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Matrix equations and identities (15A24)
Related Items (35)
A preconditioned nested splitting conjugate gradient iterative method for the large sparse generalized Sylvester equation ⋮ The modified conjugate gradient methods for solving a class of generalized coupled Sylvester-transpose matrix equations ⋮ Least-norm and Extremal Ranks of the Least Square Solution to the Quaternion Matrix Equation AXB=C Subject to Two Equations ⋮ Least-squares Hermitian problem of complex matrix equation \((AXB,CXD)=(E,F)\) ⋮ The MGPBiCG method for solving the generalized coupled Sylvester-conjugate matrix equations ⋮ Numerical algorithms for solving the least squares symmetric problem of matrix equation AXB + CXD = E ⋮ On the positive definite solution of a class of pair of nonlinear matrix equations ⋮ Least squares η-bi-Hermitian problems of the quaternion matrix equation (AXB,CXD) = (E,F) ⋮ Numerical strategies for recursive least squares solutions to the matrix equation AX = B ⋮ Submatrix constrained least-squares inverse problem for symmetric matrices from the design of vibrating structures ⋮ An iterative algorithm for the least squares generalized reflexive solutions of the matrix equations \(AXB = E\), \(CXD = F\) ⋮ Iterative algorithms for the minimum-norm solution and the least-squares solution of the linear matrix equations \(A_1XB_1 + C_1X^TD_1 = M_1, A_2XB_2 + C_2 X^TD_2 = M_2\) ⋮ An efficient method for special least squares solution of the complex matrix equation \((AXB,CXD)=(E,F)\) ⋮ The relaxed gradient based iterative algorithm for solving matrix equations \(A_iXB_i=F_i\) ⋮ 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 a common solution to a group of complex matrix equations ⋮ Ranks of least squares solutions of the matrix equation \(AXB=C\) ⋮ Alternating Direction Method for a Class of Sylvester Matrix Equations with Linear Matrix Inequality Constraint ⋮ Least squares Hermitian solution of the matrix equation \((AXB,CXD)=(E,F)\) with the least norm over the skew field of quaternions ⋮ Iterative methods for solving linear matrix equation and linear matrix system ⋮ Finite iterative algorithm for solving a complex of conjugate and transpose matrix equation ⋮ Finite iterative solutions to coupled Sylvester-conjugate matrix equations ⋮ An iterative algorithm for the generalized reflexive solutions of the generalized coupled Sylvester matrix equations ⋮ An iterative algorithm for the generalized reflexive solution of the matrix equations \(AXB = E, CXD = F\) ⋮ The scaling conjugate gradient iterative method for two types of linear matrix equations ⋮ Least squares Hermitian solution of the complex matrix equation \(AXB+CXD=E\) with the least norm ⋮ Iterative solution to a system of matrix equations ⋮ Iterative solutions to matrix equations of the form \(A_{i}XB_{i}=F_{i}\) ⋮ Least-squares solutions to the matrix equations \(AX = B\) and \(XC = D\) ⋮ The matrix iterative methods for solving a class of generalized coupled Sylvester-conjugate linear matrix equations ⋮ Modified conjugate gradient method for obtaining the minimum-norm solution of the generalized coupled Sylvester-conjugate matrix equations ⋮ Least squares solutions to the equations \(AX = B, XC = D\) with some constraints ⋮ On Hermitian solutions of the reduced biquaternion matrix equation (AXB,CXD) = (E,G) ⋮ Unnamed Item ⋮ Least squares pure imaginary solution and real solution of the quaternion matrix equation \(A X B + C X D = E\) with the least norm
Cites Work
- A pair of simultaneous linear matrix equations \(A_ 1XB_ 1=C_ 1,A_ 2XB_ 2=C_ 2\) and a matrix programming problem
- Computing the CS decomposition of a partitioned orthonormal matrix
- Singular value and generalized singular value decompositions and the solution of linear matrix equations
- Perturbation analysis of the canonical correlations of matrix pairs
- On the existence of a common solution \(X\) to the matrix equations \(A_{i} XB_{j}\)=\(C_{ij}\), \((i,j){\in}\Gamma\).
- Some necessary and sufficient conditions for eigenstructure assignment
- Towards a Generalized Singular Value Decomposition
- Least Squares Solution of Matrix Equation $AXB^* + CYD^* = E$
- The Equations AX - YB = C and AX - XB = C in Matrices
- A representation of the general common solution to the matrix equations \(A_1XB_1=C_1\) and \(A_2XB_2=C_2\) with applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Least-squares solution with the minimum-norm for the matrix equation \((A\times B,G\times H) = (C,D)\)