Abstract
In this paper, we first establish the necessary and sufficient conditions for the existence and the explicit expressions of the Hermitian {P,k+1}-(anti-)reflexive solutions of the matrix equation AX=B, and meanwhile the best approximation solution is considered. Then, if the solvability conditions are not satisfied, the least squares Hermitian {P,k+1}-(anti-)reflexive solutions and the least squares Hermitian {P,k+1}-(anti-)reflexive solutions with the minimum norm of the above matrix equation are respectively derived. In addition, two algorithms are shown to compute the least squares Hermitian {P,k+1}-(anti-)reflexive solutions, and the corresponding numerical examples are also given to illustrate the feasibility of the algorithms.
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.
