## Parallel Block Tridiagonalization of Real Symmetric Matrices (2006)

### Cached

### Download Links

- [www.cs.utk.edu]
- [web.eecs.utk.edu]
- [web.eecs.utk.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 2 - 0 self |

### BibTeX

@MISC{Bai06parallelblock,

author = {Yihua Bai and Robert C. Ward},

title = {Parallel Block Tridiagonalization of Real Symmetric Matrices},

year = {2006}

}

### OpenURL

### Abstract

Two parallel block tridiagonalization algorithms and implementations for dense real symmetric matrices are presented. Block tridiagonalization is a critical pre-processing step for the block-tridiagonal divide-and-conquer algorithm for computing eigensystems and is useful for many algorithms desiring the efficiencies of block structure in matrices. For an "effectively" sparse matrix, which frequently results from applications with strong locality properties, a heuristic parallel algorithm is used to transform it into a block tridiagonal matrix such that the eigenvalue errors remain bounded by some prescribed accuracy tolerance. For a dense matrix without any usable structure, orthogonal transformations are used to reduce it to block tridiagonal form using mostly level 3 BLAS operations. Numerical experiments show that block-tridiagonal structure obtained from this algorithm directly affects the computational complexity of the parallel block-tridiagonal divide-and-conquer eigensolver.