First Page | Document Content | |
---|---|---|
Date: 2008-06-26 22:39:54Numerical linear algebra Jacobi method GaussSeidel method Iterative method Diagonally dominant matrix Numerical analysis System of linear equations Gaussian elimination PROPT Relaxation | 578 CHAPTER 10 NUMERICAL METHODSAdd to Reading ListSource URL: college.cengage.comDownload Document from Source WebsiteFile Size: 123,72 KBShare Document on Facebook |
Optional homework #1 (1) Study and summarize Davidson’s algorithm of determining the few lowest eigenvalues of a large matrix. Why is it essential for the matrix to be diagonally dominant for this algorithm to work welDocID: 1pAcl - View Document | |
578 CHAPTER 10 NUMERICAL METHODSDocID: 1pmki - View Document | |
c Applied Mathematics E-Notes, [removed]), 11-18 Available free at mirror sites of http://www.math.nthu.edu.tw/∼amen/ ISSN[removed]DocID: R81X - View Document | |
On the Stability of P -Matrices A. Kevin Tang California Institute of Technology Alp Simsek Asuman OzdaglarDocID: F61w - View Document | |
SIAM J. SCI. COMPUT. Vol. 29, No. 5, pp. 2115–2143 c 2007 Society for Industrial and Applied MathematicsDocID: bRvC - View Document |