Abstract
Gaussian elimination with partial pivoting achieved by adding the pivot row to the kth row at step k, was introduced by Onaga and Takechi in 1986 as a means for reducing communications in parallel implementations. In this paper it is shown that the growth factor of this partial pivoting algorithm is bounded above by µn < 3 n−1 ,a s compared to 2 n−1 for the standard partial pivoting. This bound µn ,c lose to 3 n−2 , is attainable for a class of near-singular matrices. Moreover, for the same matrices the growth factor is small under partial pivoting. AMS subject classification: 65F05, 65G05.
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.
