Abstract
A new parallel algorithm for solving positive definite symmetric tridiagonal systems of linear equations is presented. It generalizes to the band and block tridiagonal cases. It is called the middle p-way BABE (burn at both ends) algorithm. It has a redundancy of two: The best serial algorithm requires 3N multiply-adds, 2N multiplies and N divides. This algorithm requires 6N/p multiple-adds, 5N/p multiplies and N/p divides. There is only one global communication step which is an all-to-all concatenation of six double words from each process.KeywordsParallel AlgorithmTridiagonal MatrixPositive Definite Symmetric MatrixOperation CountTridiagonal SystemThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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 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.
