The matrix nearness problem for symmetric matrices associated with the matrix equation [A^TXA, B^TXB] = [C, D]

DOI10.1016/J.LAA.2006.03.032MaRDI QIDQ855588zbMATH OpenOpenAlexFDO

Authors Anping Liao, Yuan Lei, Shifang Yuan

Publication date 7 December 2006

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

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

zbMATH Keywords

canonical correlation decompositionconvergenceeigenvalueseigenvectorsgeneralized singular value decompositioninner-outer iterationLanczos methodleast-squares solutionmatrix equationnumerical resultsoptimal approximate solutionsymmetric matrix

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Review text

Using the projection theorem in inner product spaces, as well as the generalized singuar value decomposition (GSVD) and the canonical correction decomposition of matrix pairs, an analytic expression of the solution is obtained. In detail, it can be divided into three phases: first, a least-square symmetric solution \(X_0 \) of the matrix equation \[ [A^T XA, B^T XB]=[C,D] \] by using the GSVD is obtained; then utilizing the solution \(X_0\) and the projection theorem, the problem \(\{\exp(-\tau A)\nu\}\), for a symmetric and positive semidefinite \(A\) is considered. The exponential function is a quickly decaying function. Hence the vector \(\exp(-\tau A)\nu\) is mostly determined by the smallest eigenvalues and their corresponding invariant subspaces. The Lanczos method is applied to the inverse of \((I + \gamma A)\) with \(\gamma>0 \), to emphasizes the first eigenvalues and their eigenvectors using an inner-outer iteration. The convergence speed is independent of the norm of the matrix. In addition, a strategy for choosing the tolerances for the errors in the solution of the shifted system is proposed. The numerical results indicate the effectiveness of the method.

Recommendations

• On the matrix nearness problem for (skew-)symmetric matrices associated with the matrix equations (A₁ X B₁, , A_k X B_k)=(C₁, , C_k)
• An optimal approximation problem for a matrix equation
• The general solutions on the minimum residual problem and the matrix nearness problem for symmetric matrices or anti-symmetric matrices
• ADMM-based methods for nearness skew-symmetric and symmetric solutions of matrix equation \(AXB = C\)
• The optimal symmetric solution and the best approximation of matrix equation AXA^T+ BYB^T= C

Cites work

• A pair of simultaneous linear matrix equations \(A_ 1XB_ 1=C_ 1,A_ 2XB_ 2=C_ 2\) and a matrix programming problem
• A representation of the general common solution to the matrix equations \(A_1XB_1=C_1\) and \(A_2XB_2=C_2\) with applications
• An Improved Algorithm for Computing the Singular Value Decomposition
• Computing a nearest symmetric positive semidefinite matrix
• Computing the CS decomposition of a partitioned orthonormal matrix
• Finite element model updating in structural dynamics
• scientific article; zbMATH DE number 3116987 (Why is no real title available?)
• scientific article; zbMATH DE number 3951889 (Why is no real title available?)
• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• scientific article; zbMATH DE number 4115838 (Why is no real title available?)
• scientific article; zbMATH DE number 1911049 (Why is no real title available?)
• scientific article; zbMATH DE number 778078 (Why is no real title available?)
• scientific article; zbMATH DE number 3412786 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• scientific article; zbMATH DE number 7590289 (Why is no real title available?)
• scientific article; zbMATH DE number 7590307 (Why is no real title available?)
• L-structured matrices and linear matrix equations^∗
• Least Squares Solution of Matrix Equation AXB^* + CYD^* = E
• Linear matrix equations from an inverse problem of vibration theory
• On the existence of a common solution \(X\) to the matrix equations \(A_{i} XB_{j}\)=\(C_{ij}\), \((i,j){\in}\Gamma\).
• Optimization Procedure to Correct Stiffness and Flexibility Matrices Using Vibration Tests
• Perturbation analysis of the canonical correlations of matrix pairs
• Singular value and generalized singular value decompositions and the solution of linear matrix equations
• The symmetric solution of the matrix equations \(AX+YA=C, AXA^ t+BYB^ t=C\), and \((A^ tXA, B^ tXB)=(C,D)\)
• Towards a Generalized Singular Value Decomposition

Cited in

(10)

• The *congruence class of the solutions of some matrix equations
• The matrix nearness problem associated with the quaternion matrix equation AXA^H+BYB^H=C
• Submatrix constrained least-squares inverse problem for symmetric matrices from the design of vibrating structures
• Least-squares solutions and least-rank solutions of the matrix equation \(AXA^{*}=B\) and their relations.
• Least squares {\(\eta\)}-bi-Hermitian problems of the quaternion matrix equation \((AXB,CXD) = (E,F)\)
• A new iterative algorithm for solving a class of matrix nearness problem
• Algebraic techniques for the least squares problems in elliptic complex matrix theory and their applications
• Finite iterative algorithms for a common solution to a group of complex matrix equations
• The Common Hermitian Solutions of the matrix equations B2XB2*=A2 and B3XB3*=A3 subject to inequality restrictions
• LSQR iterative common symmetric solutions to matrix equations AXB = E and CXD = F

This page was built for publication: The matrix nearness problem for symmetric matrices associated with the matrix equation \([A^{T}XA, B^{T}XB] = [C, D]\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855588)