東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Preconditioned techniques for large ...

Wu, Kesheng.

FindBook

Google Book

Amazon

博客來

Preconditioned techniques for large eigenvalue problems.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Preconditioned techniques for large eigenvalue problems./
作者:	Wu, Kesheng.
面頁冊數:	207 p.
附註:	Source: Dissertation Abstracts International, Volume: 58-03, Section: B, page: 1379.
Contained By:	Dissertation Abstracts International58-03B.
標題:	Computer Science. -
電子資源:	http://wwwlib.umi.com/dissertations/fullcit/9724193
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=9724193
ISBN:	0591330199

Preconditioned techniques for large eigenvalue problems.
Wu, Kesheng.

Preconditioned techniques for large eigenvalue problems. - 207 p.

Source: Dissertation Abstracts International, Volume: 58-03, Section: B, page: 1379.

Thesis (Ph.D.)--University of Minnesota, 1997.

This research focuses on finding a large number of eigenvalues and eigen-vectors of a sparse symmetric or Hermitian matrix, for example, finding 1000 eigenpairs of a 100,000

ISBN: 0591330199Subjects--Topical Terms:

626642
Computer Science.

Preconditioned techniques for large eigenvalue problems.
LDR:03227nmm 2200313 4500 001 1866368
005 20050105135814.5
008 130614s1997 eng d
020 $a 0591330199
035 $a (UnM)AAI9724193
035 $a AAI9724193
040 $a UnM $c UnM
100 1 $a Wu, Kesheng. $3 1953757
245 1 0 $a Preconditioned techniques for large eigenvalue problems.
300 $a 207 p.
500 $a Source: Dissertation Abstracts International, Volume: 58-03, Section: B, page: 1379.
500 $a Adviser: Yousef Saad.
502 $a Thesis (Ph.D.)--University of Minnesota, 1997.
520 $a This research focuses on finding a large number of eigenvalues and eigen-vectors of a sparse symmetric or Hermitian matrix, for example, finding 1000 eigenpairs of a 100,000 $\ times $ 100,000 matrix. These eigenvalue problems are challenging because the matrix size is too large for traditional QR based algorithms and the number of desired eigenpairs is too large for most common sparse eigenvalue algorithms. In this thesis, we approach this problem in two steps. First, we identify a sound preconditioned eigenvalue procedure for computing multiple eigenpairs. Second, we improve the basic algorithm through new preconditioning schemes and spectrum transformations.
520 $a Through careful analysis, we see that both the Arnoldi and Davidson methods have an appropriate structure for computing a large number of eigenpairs with preconditioning. We also study three variations of these two basic algorithms. Without preconditioning, these methods are mathematically equivalent but they differ in numerical stability and complexity. However, the Davidson method is much more successful when preconditioned. Despite its success, the preconditioning scheme in the Davidson method is seen as flawed because the preconditioner becomes ill-conditioned near convergence. After comparison with other methods, we find that the effectiveness of the Davidson method is due to its preconditioning step being an inexact Newton method. We proceed to explore other Newton methods for eigenvalue problems to develop preconditioning schemes without the same flaws. We found that the simplest and most effective preconditioner is to use the Conjugate Gradient method to approximately solve equations generated by the Newton methods. Also, a different strategy of enhancing the performance of the Davidson method is to alternate between the regular Davidson iteration and a polynomial method for eigenvalue problems. To use these polynomials, the user must decide which intervals of the spectrum the polynomial should suppress. We studied different schemes of selecting these intervals, and found that these hybrid methods with polynomials can be effective as well. Overall, the Davidson method with the CG preconditioner was the most successful method of the eigenvalue problems we tested.
590 $a School code: 0130.
650 4 $a Computer Science. $3 626642
650 4 $a Physics, Condensed Matter. $3 1018743
650 4 $a Mathematics. $3 515831
690 $a 0984
690 $a 0611
690 $a 0405
710 2 0 $a University of Minnesota. $3 676231
773 0 $t Dissertation Abstracts International $g 58-03B.
790 1 0 $a Saad, Yousef, $e advisor
790 $a 0130
791 $a Ph.D.
792 $a 1997
856 $u http://wwwlib.umi.com/dissertations/fullcit/9724193
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=9724193