Abstract
We show that the growth-factor bound in the Bunch–Kaufman factorization method is essentially tight. The method factors a symmetric matrix into , where is a permutation matrix, is lower triangular, and is block diagonal with 1-by-1 and 2-by-2 diagonal blocks. The method uses one of several partial pivoting rules that ensure bounded in the elements of the reduced matrix and the factor (growth in is not bounded). We show that the exponential bound is essentially tight, thereby solving a question that has been open since 1977.
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.
