Abstract
This paper provides an experimental comparison of three versions of the block cyclic reduction (BCR) algorithm based on (a) polynomial factorization, (b) partial fraction expansion, and (c) rational approximations. Each of these versions is implemented using (a) the vector-oriented LU decomposition method, and (b) the scalar cyclic reduction method. It is found that BCR using the scalar cyclic reduction performs better than that using the vector-oriented LU decomposition. All our timings are based on the Alliant FX/8 at Argonne National Laboratory.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.