Name
Title | ||
|---|---|---|
The nearness problems for symmetric centrosymmetric with a special submatrix constraint |
Abstract | ||
|---|---|---|
We say that is symmetric centrosymmetric if x
ij
= x
ji
and x
n − j + 1,n − i + 1, 1 ≤ i,j ≤ n. In this paper we present an efficient algorithm for minimizing ||AXA
T
− B|| where ||·|| is the Frobenius norm, A ∈ ℝ
m×n
, B ∈ ℝ
m×m
and X ∈ ℝ
n×n
is symmetric centrosymmetric with a specified central submatrix [x
ij
]
p ≤ i,j ≤ n − p
. Our algorithm produces a suitable X such that AXA
T
= B 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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/s11075-009-9356-2 | Numerical Algorithms |
Keywords | Field | DocType |
Symmetric centrosymmetric matrix,Submatrices constraint,Iterative method,Model updating,Perturbation analysis,65F30,65H15,15A24 | Discrete mathematics,Combinatorics,Mathematical optimization,Perturbation theory,Iterative method,Matrix norm,Mathematics | Journal |
Volume | Issue | ISSN |
55 | 1 | 15729265 |
Citations | PageRank | References |
2 | 0.40 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiao-fen Li | 1 | 25 | 4.86 |
| Xiyan Hu | 2 | 121 | 25.32 |
| Lei Zhang | 3 | 68 | 8.33 |