Abstract
In this paper we present a new efficient algorithm for solving linear recurrence systems with constant coefficients on distributed memory machines and clusters of workstations. The algorithm is based on level 3 and level 1 BLAS (Basic Linear Algebra Subprograms) routines _GEMM and _AXPY. We also discuss its platform-independent implementation with BLACS (Basic Linear Algebra Communication Subprograms) and finally present the results of experiments performed on a cluster of Pentium II computers running under Linux with operating system with MPI (Message-Passing Interface) and compare the results with the performance of a simple divide-and-conquer algorithm proposed in our earlier work.
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.
