Systolic computation of characteristic polynomials of hessenberg matrices
✍ Scribed by H. Schröder; E.V. Krishnamurthy
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 196 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
✦ Synopsis
Schr~der H. and E.V. Krishnamurthy, Systolic computation of characteristic polynomials of Hessenberg matrices, Parallel Computing 17 (1991) 273-277 This paper describes the use of Instruction Systolic Arrays to compute a scalar multiple of the characteristic polynomial of a Hessenberg matrix in time O(n), where n is the order of the matrix.
📜 SIMILAR VOLUMES
A parallel algorithm is developed for the f i t time based on Frame's method to compute the characteristic polynomials of chemical graphs. This algorithm can handle all types of graphs: ordinary, weighted, directed, and signed. Our algorithm takes only linear time in the CRCW PRAM model with O(n9) p