The matrix eigenvalue problem: GR and Krylov subspace methods
David S. Watkins (Society for Industrial and Applied Mathematics, 2007)
|
This book presents the first in-depth, complete, and unified theoretical discussion of the two most important classes of algorithms for solving matrix eigenvalue problems: QR-like algorithms for dense problems and Krylov subspace methods for sparse problems. The author discusses the theory of the generic GR algorithm, including special cases (for example, QR, SR, HR), and the development of Krylov subspace methods. Also addressed are a generic Krylov process and the Arnoldi and various Lanczos algorithms, which are obtained as special cases. The chapter on product eigenvalue problems provides further unification, showing that the generalized eigenvalue problem, the singular value decomposition problem, and other product eigenvalue problems can all be viewed as standard eigenvalue problems. |
The matrix eigenvalue problem GR and Krylov subspace methods.pdf :: Unduh
|
No. Panggil : | e20448973 |
Entri utama-Nama orang : | |
Subjek : | |
Penerbitan : | Philadelphia: Society for Industrial and Applied Mathematics, 2007 |
Sumber Pengatalogan: | LibUI eng rda |
Tipe Konten: | text |
Tipe Media: | computer |
Tipe Pembawa: | online resources |
Deskripsi Fisik: | x, 442 pages : illustration |
Tautan: | http://portal.igpublish.com/iglibrary/search/SIAMB0000351.main.html?5 |
Lembaga Pemilik: | |
Lokasi: |
No. Panggil | No. Barkod | Ketersediaan |
---|---|---|
e20448973 | 02-17-984173271 | TERSEDIA |
Ulasan: |
Tidak ada ulasan pada koleksi ini: 20448973 |