full
search.png

Search

close.png

Cancel

arrow
Volume 21, Issue 4
The Inverse Problem for Part Symmetric Matrices on a Subspace

Zhen-Yun Peng, Xi-Yan Hu & Lei Zhang

J. Comp. Math., 21 (2003), pp. 505-512.

Published online: 2003-08

Preview Full PDF 2463 23950

Cited by

google scholar semantic scholar
Export citation
  • Abstract

In this paper, the following two problems are considered:
Problem Ⅰ. Given $S \in R^{n×p}, X, B \in R^{n×m}$, find $A \in SR_{s,n}$ such that $AX=B$, where $SR_{s,n}={A \in R^{n×n} | x^T(A-A^T)=0, \ {\rm for} \ {\rm all} \ x \in R(S)}$.

Problem Ⅱ. Given $A^* \in R^{n×n}$, find $\hat{A} \in S_E$ such that $\|\hat{A} -A^*\|={\rm min}_{A \in S_E} \|A-A*\|$, where $S_E$ is the solution set of Problem Ⅰ.

Then necessary and sufficient conditions for the solvability of and the general from of the solutions of problem Ⅰ are given. For problem Ⅱ, the expression for the solution, a numerical algorithm and a numerical example are provided.


  • Keywords

Part symmetric matrix, Inverse problem, Optimal approximation.

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-21-505, author = {Peng , Zhen-YunHu , Xi-Yan and Zhang , Lei}, title = {The Inverse Problem for Part Symmetric Matrices on a Subspace}, journal = {Journal of Computational Mathematics}, year = {2003}, volume = {21}, number = {4}, pages = {505--512}, abstract = {

In this paper, the following two problems are considered:
Problem Ⅰ. Given $S \in R^{n×p}, X, B \in R^{n×m}$, find $A \in SR_{s,n}$ such that $AX=B$, where $SR_{s,n}={A \in R^{n×n} | x^T(A-A^T)=0, \ {\rm for} \ {\rm all} \ x \in R(S)}$.

Problem Ⅱ. Given $A^* \in R^{n×n}$, find $\hat{A} \in S_E$ such that $\|\hat{A} -A^*\|={\rm min}_{A \in S_E} \|A-A*\|$, where $S_E$ is the solution set of Problem Ⅰ.

Then necessary and sufficient conditions for the solvability of and the general from of the solutions of problem Ⅰ are given. For problem Ⅱ, the expression for the solution, a numerical algorithm and a numerical example are provided.


}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/10254.html} }
TY - JOUR T1 - The Inverse Problem for Part Symmetric Matrices on a Subspace AU - Peng , Zhen-Yun AU - Hu , Xi-Yan AU - Zhang , Lei JO - Journal of Computational Mathematics VL - 4 SP - 505 EP - 512 PY - 2003 DA - 2003/08 SN - 21 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/10254.html KW - Part symmetric matrix, Inverse problem, Optimal approximation. AB -

In this paper, the following two problems are considered:
Problem Ⅰ. Given $S \in R^{n×p}, X, B \in R^{n×m}$, find $A \in SR_{s,n}$ such that $AX=B$, where $SR_{s,n}={A \in R^{n×n} | x^T(A-A^T)=0, \ {\rm for} \ {\rm all} \ x \in R(S)}$.

Problem Ⅱ. Given $A^* \in R^{n×n}$, find $\hat{A} \in S_E$ such that $\|\hat{A} -A^*\|={\rm min}_{A \in S_E} \|A-A*\|$, where $S_E$ is the solution set of Problem Ⅰ.

Then necessary and sufficient conditions for the solvability of and the general from of the solutions of problem Ⅰ are given. For problem Ⅱ, the expression for the solution, a numerical algorithm and a numerical example are provided.


Peng , Zhen-YunHu , Xi-Yan and Zhang , Lei. (2003). The Inverse Problem for Part Symmetric Matrices on a Subspace. Journal of Computational Mathematics. 21 (4). 505-512. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard