Abstract
We give a practical parallel algorithm for solving band symmetric positive definite systems of linear equations in O ( m * log n ) time using nm /log n processors. Here n denotes the system size and m its bandwidth. Hence, the algorithm is efficient. For tridiagonal systems, the algorithm runs in O (log n ) time using n /log n processors. Furthermore, an improved version runs in O (log m log n ) time using nm 2 /(log m log n ) processors.
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.
