Matrix algorithms: Eigensystems

Matrix algorithms: Eigensystems

G. W. Stewart
この本はいかがでしたか?
ファイルの質はいかがですか?
質を評価するには、本をダウンロードしてください。
ダウンロードしたファイルの質はいかがでしたか?
This book is the second volume in a projected five-volume survey of numerical linear algebra and matrix algorithms. This volume treats the numerical solution of dense and large-scale eigenvalue problems with an emphasis on algorithms and the theoretical background required to understand them. Stressing depth over breadth, Professor Stewart treats the derivation and implementation of the more important algorithms in detail. The notes and references sections contain pointers to other methods along with historical comments.

The book is divided into two parts: dense eigenproblems and large eigenproblems. The first part gives a full treatment of the widely used QR algorithm, which is then applied to the solution of generalized eigenproblems and the computation of the singular value decomposition. The second part treats Krylov sequence methods such as the Lanczos and Arnoldi algorithms and presents a new treatment of the Jacobi-Davidson method.

The volumes in this survey are not intended to be encyclopedic. By treating carefully selected topics in depth, each volume gives the reader the theoretical and practical background to read the research literature and implement or modify new algorithms. The algorithms treated are illustrated by pseudocode that has been tested in MATLAB implementations.

Audience

The volumes in the series are intermediate-level monographs, suitable for self-study by professionals and graduate students in the sciences and engineering. The first volume, Matrix Algorithms, Volume I: Basic Decompositions , was published by SIAM in 1998 (ISBN 0-89871-414-1).

カテゴリー:
巻:
vol.2
年:
2001
版:
1
出版社:
SIAM: Society for Industrial and Applied Mathematics
言語:
english
ページ:
490
ISBN 10:
0898715032
ISBN 13:
9780898715033
ファイル:
DJVU, 2.53 MB
IPFS:
CID , CID Blake2b
english, 2001
オンラインで読む
への変換進行中。
への変換が失敗しました。

主要なフレーズ