Least squares solutions to \(AX = B\) for bisymmetric matrices under a central principal submatrix constraint and the optimal approximation

From MaRDI portal
Publication:2469514

DOI10.1016/j.laa.2007.08.019zbMath1133.15016OpenAlexW2034621062WikidataQ112882154 ScholiaQ112882154MaRDI QIDQ2469514

Li-Jun Zhao, Xi-Yan Hu, Lei Zhang

Publication date: 6 February 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2007.08.019



Related Items

The iterative algorithm for solving a class of generalized coupled Sylvester-transpose equations over centrosymmetric or anti-centrosymmetric matrix, The reflexive least squares solutions of the general coupled matrix equations with a submatrix constraint, Numerical solutions of AXB = C for centrosymmetric matrix X under a specified submatrix constraint, The least squares anti-bisymmetric solution and the optimal approximation solution for Sylvester equation, The modified conjugate gradient methods for solving a class of generalized coupled Sylvester-transpose matrix equations, Iterative method to solve the generalized coupled Sylvester-transpose linear matrix equations over reflexive or anti-reflexive matrix, 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, An efficient algorithm for the submatrix constraint of the matrix equationA1X1B1+A2X2B2+···+AlXlBl=C, On the Hermitian structures of the solution to a pair of matrix equations, The common bisymmetric nonnegative definite solutions with extreme ranks and inertias to a pair of matrix equations, Inertias and ranks of some Hermitian matrix functions with applications, The relaxed gradient based iterative algorithm for solving matrix equations \(A_iXB_i=F_i\), The BCR algorithms for solving the reflexive or anti-reflexive solutions of generalized coupled Sylvester matrix equations, The iteration solution of matrix equation \(A X B = C\) subject to a linear matrix inequality constraint, The scaling conjugate gradient iterative method for two types of linear matrix equations, The Hermitian \(\{P,\mathrm k+1\}\)-(anti-)reflexive solutions of a linear matrix equation, Numerical solutions of \(AXB = C\) for mirrorsymmetric matrix \(X\) under a specified submatrix constraint, On the generalized bi (skew-) symmetric solutions of a linear matrix equation and its procrust problems, Term rank preservers of bisymmetric matrices over semirings, The matrix iterative methods for solving a class of generalized coupled Sylvester-conjugate linear matrix equations, The nearness problems for symmetric centrosymmetric with a special submatrix constraint, On solutions of the matrix equation \(A \circ_l X = B\) with respect to \(MM\)-2 semitensor product, Completion of symmetric orthogonal matrices and corresponding matrix equation problem, Modified conjugate gradient method for obtaining the minimum-norm solution of the generalized coupled Sylvester-conjugate matrix equations, Left and right inverse eigenpairs problem with a submatrix constraint for the generalized centrosymmetric matrix, The submatrix constraint problem of matrix equation \(AXB+CYD=E\), The symmetric solutions of the matrix inequalityAXBin least-squares sense, Iterative methods to solve the generalized coupled Sylvester-conjugate matrix equations for obtaining the centrally symmetric (centrally antisymmetric) matrix solutions



Cites Work