Abstract
In this paper the usefulness of the partition method [S. C. Chen, D. J. Kuck, and A. H. Sameh, ACM Trans. Math. Software, 4 (1978), pp. 270–277], [H. H. Wang, ACM Trans. Math. Software, 7 (1981), pp. 170–183] for solving linear bidiagonal systems on vector computers is studied. It is shown that the method is numerically stable for an interesting class of problems. For different vector computers suitable variants of the method are computed and upper bounds for their performance are presented. Also reported are some actually observed performances in a FORTRAN environment.
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 callMore 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.
