Least-squares solutions of inverse problem for hermitian generalized Hamiltonian matrices
نویسندگان
چکیده
منابع مشابه
An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملan iterative method for the hermitian-generalized hamiltonian solutions to the inverse problem ax=b with a submatrix constraint
in this paper, an iterative method is proposed for solving the matrix inverse problem $ax=b$ for hermitian-generalized hamiltonian matrices with a submatrix constraint. by this iterative method, for any initial matrix $a_0$, a solution $a^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملThe Solvability Conditions for the Inverse Eigenvalue Problem of Hermitian and Generalized Skew-Hamiltonian Matrices and Its Approximation
In this paper, we first consider the inverse eigenvalue problem as follows: Find a matrix A with specified eigen-pairs, where A is a Hermitian and generalized skewHamiltonian matrix. The sufficient and necessary conditions are obtained, and a general representation of such a matrix is presented. We denote the set of such matrices by LS . Then the best approximation problem for the inverse eigen...
متن کاملAn Iterative Method for the Hermitian-generalized Hamiltonian Solutions to the Inverse Problem Ax=b with a Submatrix Constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem AX = B for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix A0, a solution A ∗ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of init...
متن کاملLeft and Right Inverse Eigenpairs Problem for -Hermitian Matrices
Left and right inverse eigenpairs problem for κ-hermitian matrices and its optimal approximate problem are considered. Based on the special properties of κ-hermitian matrices, the equivalent problem is obtained. Combining a new inner product of matrices, the necessary and sufficient conditions for the solvability of the problem and its general solutions are derived. Furthermore, the optimal app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2004
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(04)90067-5