Left and right inverse eigenpairs problem with a submatrix constraint for the generalized centrosymmetric matrix
| Autor: | Fan-Liang Li |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
Left and right
left and right inverse eigenpairs General Mathematics 65f18 Inverse 010103 numerical & computational mathematics submatrix constraint 15a24 01 natural sciences Computer Science::Numerical Analysis Mathematics::Numerical Analysis 010101 applied mathematics Combinatorics Constraint (information theory) leading principal submatrix QA1-939 optimal approximation 0101 mathematics generalized centrosymmetric matrix Centrosymmetric matrix Geometry and topology Mathematics |
| Zdroj: | Open Mathematics, Vol 18, Iss 1, Pp 603-615 (2020) |
| ISSN: | 2391-5455 |
| Popis: | Left and right inverse eigenpairs problem is a special inverse eigenvalue problem. There are many meaningful results about this problem. However, few authors have considered the left and right inverse eigenpairs problem with a submatrix constraint. In this article, we will consider the left and right inverse eigenpairs problem with the leading principal submatrix constraint for the generalized centrosymmetric matrix and its optimal approximation problem. Combining the special properties of left and right eigenpairs and the generalized singular value decomposition, we derive the solvability conditions of the problem and its general solutions. With the invariance of the Frobenius norm under orthogonal transformations, we obtain the unique solution of optimal approximation problem. We present an algorithm and numerical experiment to give the optimal approximation solution. Our results extend and unify many results for left and right inverse eigenpairs problem and the inverse eigenvalue problem of centrosymmetric matrices with a submatrix constraint. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|