| Autor: |
Nguyen, Binh T., Anh-Duc Luong-Thanh, Nguyen Dinh Thuc, Bui Van Thach |
| Zdroj: |
2012 Proceedings of IEEE Southeastcon; 1/ 1/2012, p1-6, 6p |
| Abstrakt: |
We propose a stable and efficient divide-and-conquer algorithm for computing the eigendecomposition of a symmetric tri-block-diagonal matrix. The matrix can be derived from discretizing Laplace operator eigenvalue in some two-dimensional graphs. All numerical results show that our algorithm is competitive with other methods, such as e.g QR algorithm, Cuppen's divide-and-conquer algorithm. We also show how to improve our algorithm by Fast Multipole Method. [ABSTRACT FROM PUBLISHER] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
