Abstract
The advent of supercomputers with hierarchical memory systems has imposed the use of block algorithms for the linear algebra algorithms. Although block algorithms may result in impressive improvements in performance, their numerical properties are quite different from their scalar counterpart and deserve an in-depth study. In this paper, the numerical stability of block Gram–Schmidt orthogonalization is studied and a variant is proposed which has numerical properties similar to the modified Gram–Schmidt procedure while retaining most of the performance advantages of the block formulation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: SIAM Journal on Scientific and Statistical Computing
Disclaimer: 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.