| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4636634 | Applied Mathematics and Computation | 2006 | 6 Pages |
Abstract
We present an algorithm that can find all the eigenvalues of an n × n symmetric Pascal matrices in O(n2log n) operations. We take advantage of real symmetry and the Pascal structure. Our scheme consists of an O(n2log n) Lanczos tridiagonalization procedure and an O(n) QR diagonalization method and the Fast Fourier Transform (FFT).
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Xiang Wang, Zhou Jituan,