Characteristic polynomials of distance matrices of one dimensional sets
โ Scribed by Kenneth W. Holladay
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 215 KB
- Volume
- 428
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
Let e P p nรn , f P p nรt , where F is an arbitrary ยฎeld. We describe the possible characteristic polynomials of e f, when some of its rows are prescribed and the other rows vary. The characteristic polynomial of e f is deยฎned as the largest determinantal divisor (or the product of the invariant fac