Special matrices and their applications in numerical mathematics
著者
書誌事項
Special matrices and their applications in numerical mathematics
Martinus Nijhoff Publishers , Kluwer Boston [distributor], 1986
- タイトル別名
-
Speciální matice a jejich použití v numerické matematice
大学図書館所蔵 全30件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Translation of: Speciální matice a jejich použití v numerické matematice
Includes index
内容説明・目次
内容説明
This is an updated translation of a book published in Czech by the SNTL - Publishers of Technical Literature in 1981. In developing this book, it was found reasonable to consider special matrices in general sense and also to include some more or less auxiliary topics that made it possible to present some facts or processes more demonstratively. An example is the graph theory. Chapter 1 contains the definitions of basic concepts of the theory of matrices, and fundamental theorems. The Schur complement is defined here in full generality and using its properties we prove the theorem on the factorization of a partitioned matrix into the product of a lower block triangular matrix with identity diagonal blocks, a block diagonal matrix, and an upper block triangular matrix with identity diagonal blocks. The theorem on the Jordan normal form of a matrix is gi[yen]en without proof. Chapter 2 is concerned with symmetric and Hermitian matrices. We prove Schur's theorem and, using it, we establish the fundamental theorem describing the factorization of symmetric or Hermitian matrices. Further, the properties of positive definite and positive semidefinite matrices are studied.
In the conclusion, Sylvester's law of inertia of quadratic forms and theorems on the singular value decomposition and polar decomposition are proved. Chapter 3 treats the mutual connections between graphs and matrices.
目次
1. Basic Concepts of the Theory of Matrices.- Matrices.- Determinants.- Nonsingular matrices. Inverse matrices.- Schur complement. Factorization.- Vector spaces. Rank.- Eigenvectors, eigenvalues. Characteristic polynomial.- Similarity. Jordan normal form.- Exercises.- 2. Symmetric Matrices. Positive Definite and Semidefinite Matrices.- Euclidean and unitary spaces.- Symmetric and Hermitian matrices.- Orthogonal and unitary matrices.- Gram-Schmidt orthonormalization. Schur's theorem.- Positive definite and positive semidefinite matrices.- Sylvester's law of inertia.- Singular value decomposition.- Exercises.- 3. Graphs and Matrices.- Digraphs.- Digraph of a matrix.- Undirected graphs. Trees.- Bigraphs.- Exercises.- 4. Nonnegative Matrices. Stochastic and Doubly Stochastic Matrices.- Nonnegative matrices.- The Perron-Frobenius theorem.- Cyclic matrices.- Stochastic matrices.- Doubly stochastic matrices.- Exercises.- 5. M-Matrices (Matrices of Classes K and K0).- Class K.- Class K0.- Diagonally dominant matrices.- Monotone matrices.- Class P.- Exercises.- 6. Tensor Product of Matrices. Compound Matrices.- Tensor product.- Compound matrices.- Exercises.- 7. Matrices and Polynomials. Stable matrices.- Characteristic polynomial.- Matrices associated with polynomials.- Bezout matrices.- Hankel matrices.- Toeplitz and Lowner matrices.- Stable matrices.- Exercises.- 8. Band Matrices.- Band matrices and graphs.- Eigenvalues and eigenvectors of tridiagonal matrices.- Exercises.- 9. Norms and Their Use for Estimation of Eigenvalues.- Norms.- Measure of nonsingularity. Dual norms.- Bounds for eigenvalues.- Exercises.- 10. Direct Methods for Solving Linear Systems.- Nonsingular case.- General case.- Exercises.- 11. Iterative Methods for Solving Linear Systems.- The Jacobi method.- The Gauss-Seidel method.- The SOR method.- Exercises.- 12. Matrix Inversion.- Inversion of special matrices.- The pseudoinverse.- Exercises.- 13. Numerical Methods for Computing Eigenvalues of Matrices.- Computation of selected eigenvalues.- Computation of all the eigenvalues.- Exercises.- 14. Sparse matrices.- Storing. Elimination ordering.- Envelopes. Profile.- Exercises.
「Nielsen BookData」 より