This thesis proposes an inner product free Krylov method called Implicitly Restarted DEIM_Arnoldi (IRD) to solve large scale eigenvalue problems. This algorithm is based on the Implicitly Restarted Arnoldi (IRA) scheme, which is very efficient for solving eigenproblems. IRA uses the Arnoldi factorization, which requires inner products. In contrast, IRD employs the Discrete Empirical Interpolation (DEIM) technique and the DEIM_Arnoldi algorithm to avoid inner products, thereby resulting in faster running times for large eigenproblems. Furthermore, IRD may be able to greatly reduce the latency caused by inner products in parallel computation. This work conducts many numerical experiments to compare the performance of IRD and IRA in serial computation, and discusses the possible ways to avoid the need for communication in parallel computation.
| Identifer | oai:union.ndltd.org:RICE/oai:scholarship.rice.edu:1911/61986 |
| Date | January 2010 |
| Contributors | Sorensen, Danny C. |
| Source Sets | Rice University |
| Language | English |
| Detected Language | English |
| Type | Thesis, Text |
| Format | application/pdf |
Page generated in 0.0017 seconds