Abstract
Aasen’s algorithm factorizes a symmetric indefinite matrix A as A=PTLTLTP, where P is a permutation matrix, L is unit lower triangular with its first column being the first column of the identity matrix, and T is tridiagonal. In this note, we provide a growth factor upper bound for Aasen’s algorithm which is much smaller than that given by Higham. We also show that the upper bound we have given is not tight when the matrix dimension is greater than or equal to 6.
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.
