Abstract
The n×n real matrix P is called centrosymmetric matrix if P=RPR, where R is permutation matrix with ones on cross diagonal (bottom left to top right) and zeroes elsewhere. In this article, the solvability conditions for left and right inverse eigenvalue problem (which is special case of inverse eigenvalue problem) under the submatrix constraint for generalized centrosymmetric matrices are derived, and the general solution is also given. In addition, we provide a feasible algorithm for computing the general solution, which is proved by a numerical example.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
