Abstract
Mirrorsymmetric matrices, which are the iteraction matrices of mirrorsymmetric structures, have important application in studying odd/even-mode decomposition of symmetric multiconductor transmission lines (MTL). In this paper we present an efficient algorithm for minimizing \({\|AXB-C\|}\) where \({\|\cdot\|}\) is the Frobenius norm, \({A\in \mathbb{R}^{m\times n}}\), \({B\in \mathbb{R}^{n\times s}}\), \({C\in \mathbb{R}^{m\times s}}\) and \({X\in \mathbb{R}^{n\times n}}\) is mirrorsymmetric with a specified central submatrix [x ij ]r≤i, j≤n-r. Our algorithm produces a suitable X such that AXB = C in finitely many steps, if such an X exists. We show that the algorithm is stable any case, and we give results of numerical experiments that support this claim.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Datta L, Morgera S (1989) On the reducibility of centrosymmetric matrices-applications in engineering problems. Circuits Syst Signal Process 8: 71–96
Li GL, Feng ZH (2002) Mirrorsymetric matrices, their basic properties, and an application on odd/even-mode decomposition of symmetric multiconductor transmission lines. SIAM J Matrix Anal Appl 24: 78–90
Li GL, Feng ZH (2003) Mirror-transformations of matrices and their application on odd/even modal decomposition of mirror-symmetric multiconductor transmission line equations. IEEE Trans Adv Pack 26: 172–181
Li GL, Feng ZH (2002) Mirror-symmetric matrices and their application. Tsinghua Sci Technol 7: 602–607
Weaver J (1985) Centrosymmetric (cross-symmetric) matrices, their basic properties, eigenvalues, and eigenvectors. Am Math Mon 92: 711–717
Cantoni A, Butler P (1976) Eigenvalues and eigenvectors of symmetric centrosymmetric matrices. Linear Algebra Appl 13: 275–288
Peng ZY, Hu XY, Zhang L (2004) The inverse problem of symmetric centrosymmetric matrices with a submatrix constraint. Linear Algebra Appl 11: 59–73
Bai ZJ (2005) The inverse eigenproblem of centrosymmetric matrices with a submatrix constraint and its approximation. SIAM J Matrix Anal Appl 26: 1100–1114
Liao AP, Lei Y (2007) Least-squares solutions of matrix inverse problem for bi-symmetric matrices with a submatrix constraint. Linear Algebra Appl 14: 425–444
Deift P, Nanda T (1984) On the determination of a tridiagonal matrix from its spectrum and a submatrix. Linear Algebra Appl 60: 43–55
Peng ZY, Hu XY (2005) Constructing Jacobi matrix with prescribed ordered defective eigenpairs and a principal submatrix. J Comput Appl Math 175: 321–333
Yuan YX, Dai H (2007) Inverse problems for symmetric matrices with a submatrix constraint. Appl Numer Math 57: 646–656
Yuan YX, Dai H (2008) The nearness problems for symmetric matrix with a submatrix constraint. J Comput Appl Math 213: 224–231
Gong LS, Hu XY, Zhang L (2006) The expansion problem of anti-symmetric matrix under a linear constraint and the optimal approximation. J Comput Appl Math 197: 44–52
Yin QX (2004) Construction of real antisymmetric and bi-antisymmetric matrices with prescribed spectrum data. Linear Algebra Appl 389: 95–106
Lancaster P (1970) Explicit solutions of linear matrix equation. SIAM Rev 72: 544–566
Dai H, Lancaster P (1996) Linear matrix equations from an inverse problem of vibration theory. Linear Algebra Appl 246: 31–47
Beattie CA, Smith SW (1992) Optimal matrix approximants in structural identification. J Optim Theor Appl 74(1): 23–56
Zhao LJ, Hu XY, Zhang L (2008) Least squares solutions to AX = B for symmetric centrosymmetric matrices under a central principal submatrix constraint and the optimal approximation. Linear Algebra Appl 428: 871–880
Golub GH, Zha HY (1994) Perturbation analysis of the canonical correlation of matrix pairs. Linear Algebra Appl 210: 3–28
Paige CC (1986) Computing the generalized singular value decomposition. SIAM J Sci Stat Comput 7: 1126–1146
Lei Y, Liao AP (2007) A minimal residual algorithm for the inconsistent matrix equation AXB = C over symmetric matrices. Appl Math Comput 188: 499–513
Peng YX, Hu XY, Zhang L (2005) An iteration method for the symmetric solutions and the optimal approximation solution of the matrix equation AXB = C. Appl Math Comput 160: 763–777
Wang RS (2003) Functional analysis and optimization theory. Beljing Unlv of Aeronautics Astronautics Press, Beijing
Kelley CT (1995) Iterative methods for linear and nonlinear equations. SIAM, Philadelphia
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by C.C. Douglas.
Rights and permissions
About this article
Cite this article
Li, JF., Hu, XY., Duan, XF. et al. Numerical solutions of AXB = C for mirrorsymmetric matrix X under a specified submatrix constraint. Computing 90, 39–56 (2010). https://doi.org/10.1007/s00607-010-0109-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-010-0109-9
Keywords
- Mirrorsymmetric matrix
- Principal submatrices constraint
- Iterative method
- Least square problem
- Perturbation analysis