Abstract
In this paper, an iterative algorithm is constructed to solve the minimum Frobenius norm residual problem: min ‖ ( A 1 X B 1 A 2 X B 2 ) − ( C 1 C 2 ) ‖ over bisymmetric matrices. By this algorithm, for any initial bisymmetric matrix X 0 , a solution X ∗ 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 initial matrix. Furthermore, in the solution set of the above problem, the unique optimal approximation solution X ̂ to a given matrix X ¯ in the Frobenius norm can be derived by finding the least norm bisymmetric solution of a new corresponding minimum Frobenius norm problem. Given numerical examples show that the iterative algorithm is quite effective in actual computation.
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.
