Abstract
Several strategies for pivot selection in Givens reduction to upper triangular form and for row ordering within major steps of the reduction are compared on the grounds of how well they preserve sparsity. Recommendations are made based principally on the results of runs on test problems. The use of Givens similarity transformations in reducing a sparse matrix to Hessenberg form is similarly examined and finally some conclusions are drawn as to the advisability of using Givens reduction methods on sparse systems.
Published Version
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.
