09_tridiagonal

09_tridiagonal - Band Systems Tridiagonal Systems Cyclic...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Band Systems Tridiagonal Systems Cyclic Reduction Parallel Numerical Algorithms Chapter 9 Band and Tridiagonal Systems Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign CSE 512 / CS 554 Michael T. Heath Parallel Numerical Algorithms 1 / 24 Band Systems Tridiagonal Systems Cyclic Reduction Outline 1 Band Systems 2 Tridiagonal Systems 3 Cyclic Reduction Michael T. Heath Parallel Numerical Algorithms 2 / 24 Band Systems Tridiagonal Systems Cyclic Reduction Banded Linear Systems Bandwidth (or semibandwidth ) of n n matrix A is smallest value such that a ij = 0 for all | i- j | > Matrix is banded if n If p , then minor modifications of parallel algorithms for dense LU or Cholesky factorization are reasonably efficient for solving banded linear system Ax = b If / p , then standard parallel algorithms for LU or Cholesky factorization utilize few processors and are very inefficient Michael T. Heath Parallel Numerical Algorithms 3 / 24 Band Systems Tridiagonal Systems Cyclic Reduction Narrow Banded Linear Systems More efficient parallel algorithms for narrow banded linear systems are based on divide-and-conquer approach in which band is partitioned into multiple pieces that are processed simultaneously Reordering matrix by nested dissection is one example of this approach Because of fill, such methods generally require more total work than best serial algorithm for system with dense band We will illustrate for tridiagonal linear systems, for which = 1 , and will assume pivoting is not needed for stability (e.g., matrix is diagonally dominant or symmetric positive definite) Michael T. Heath Parallel Numerical Algorithms 4 / 24 Band Systems Tridiagonal Systems Cyclic Reduction Tridiagonal Linear System Tridiagonal linear system has form b 1 c 1 a 2 b 2 c 2 . . . . . . . . . a n- 1 b n- 1 c n- 1 a n b n x 1 x 2 . . . x n- 1 x n = y 1 y 2 . . . y n- 1 y n For tridiagonal system of order n , LU or Cholesky factorization incurs no fill, but yields serial thread of length ( n ) through task graph, and hence no parallelism Neither cdivs nor cmods can be done simultaneously Michael T. Heath Parallel Numerical Algorithms 5 / 24 Band Systems Tridiagonal Systems Cyclic Reduction Tridiagonal System, Natural Order G ( A ) 10 9 8 7 6 5 4 3 2 1 11 12 13 14 15 A L T ( A ) 10 9 8 7 6 5 4 3 2 1 11 12 13 14 15 Michael T. Heath Parallel Numerical Algorithms 6 / 24 Band Systems Tridiagonal Systems Cyclic Reduction Two-Way Elimination Other orderings may enable some degree of parallelism,...
View Full Document

This note was uploaded on 11/06/2011 for the course CSE 494 taught by Professor Staff during the Summer '09 term at CUNY Brooklyn.

Page1 / 24

09_tridiagonal - Band Systems Tridiagonal Systems Cyclic...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online