An iterative algorithm for solving matrix equations with submatrix constraints
From MaRDI portal
Publication:3170057
zbMATH Open1240.65143MaRDI QIDQ3170057FDOQ3170057
Authors: Liwei Nong, Puyin Chen 
Publication date: 29 September 2011
Recommendations
- scientific article
- An iterative method for the least-squares problems of a general matrix equation subjects to submatrix constraints
- The solution and optimal approximation of matrix equation \({A^T}XB + {B^T}{X^T}A = D\) under subspace constraint
- Matrix iterative solutions to the least squares problem of \(BXA^{T} = F\) with some linear constraints
- Iterative solutions of \(AXB=C\) with sub-matrix restrains in bi-symmetric matrix set
convergencenumerical examplesbest approximationiterative algorithmsmatrix equationsskew-symmetric least-squares solutions
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Matrix equations and identities (15A24)
Cited In (9)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A numerical method on the mixed solution of matrix equation \(\sum_{i = 1}^t A_i X_i B_i = E\) with sub-matrix constraints and its application
- Orthogonal projection iterative method to matrix equation \(AX = B\) with a submatrix constraint
- An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem \(AX=B\) with a submatrix constraint
- An iterative method for the least-squares problems of a general matrix equation subjects to submatrix constraints
- Title not available (Why is that?)
- The solution and optimal approximation of matrix equation \({A^T}XB + {B^T}{X^T}A = D\) under subspace constraint
- Iterative solutions of \(AXB=C\) with sub-matrix restrains in bi-symmetric matrix set
This page was built for publication: An iterative algorithm for solving matrix equations with submatrix constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170057)
