Abstract
For the traditional diagonal dominance algorithms unconstrained the non-diagonal elements, a strict constraint of diagonal dominance is proposed in the paper. Contrary to the normal definition, the novel definition of strict diagonal dominance restricts the max non-diagonal elements, and the definition of strict Gershgorin discs is also discussed. To achieve diagonal dominance the compensating matrix search algorithm based on trial and error is introduced in the paper. Example of compensating search algorithm is applied to support the proposed method, and the results obtained are comparable with normal method. It gives a novel way to define the diagonal dominance.
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.
