°æ¹®»ç
¿À´Ã ³»°¡ º» »óÇ°
(1)
´Ý±â
È¸»ç¼Ò°³
È¸»ç¼Ò°³
ÀÎ»ç¸»
¿¬Çõ
¾ð·Ð¼ÓÀÇ °æ¹®»ç
Á¶Á÷µµ ¹× ¿¬¶ôÃ³
Ã£¾Æ¿À½Ã´Â±æ
¿Ã´ñ¸Å½º
¼öÇÐÀÚ
¼öÇÐ»ç
¼öÇÐ»ç¶û
´ëÇÐ¼öÇÐÈ¸
´ëÇÑ¼öÇÐ±³À°ÇÐÈ¸
ÀÚ·á½Ç
ÀÚ·á¸ðÀ½
Á¤¿ÀÇ¥
¸ñ·Ï
µ¿¿µ»ó
°ßº»½ÅÃ»
ÀÌº¥Æ®
¼îÇÎ¸ô
¼îÇÎ¸ô >
¼öÀÔµµ¼
±¹³»µµ¼
¼öÀÔµµ¼
Linear Algebra : A Modern Introduction, 4rd CTE
¹«·á¹è¼Û
ÁöÀºÀÌ
:
Poole
ÃâÆÇ»ç
:
Cengage
ÆÇ¼ö
:
4th(2015)
ÆäÀÌÁö¼ö
:
478
ISBN
:
9789814617314
¿¹»óÃâ°íÀÏ
:
ÀÔ±ÝÈ®ÀÎÈÄ 2ÀÏ ÀÌ³»
ÁÖ¹®¼ö·®
:
°³
µµ¼°¡°Ý
:
42,000¿ø
( ¹«·á¹è¼Û )
Àû¸³±Ý
:
1,260 Point
*Access code 책 안에 포함되어 있습니다.
David Poole의 Linear Algebra : A Modern Introduction, 4th CTE
ebook 설명서, 공지사항(20번)에 올려 두었습니다. 참고 부탁 드립니다.
David Poole is Professor of Mathematics at Trent University, where he has been a faculty member since 1984. Dr. Poole has won numerous teaching awards: Trent University's Symons Award for Excellence in Teaching (the university's top teaching award), three merit awards for teaching excellence, a 2002 Ontario Confederation of University Faculty Associations Teaching Award (the top university teaching award in the province), a 2003 3M Teaching Fellowship (the top university teaching award in Canada, sponsored by 3M Canada Ltd.), a 2007 Leadership in Faculty Teaching Award from the province of Ontario, and the Canadian Mathematical Society's 2009 Excellence in Teaching Award. From 2002-2007, Dr. Poole was Trent University's Associate Dean (Teaching & Learning). His research interests include discrete mathematics, ring theory, and mathematics education. He received his B.Sc. from Acadia University in 1976 before earning his M.Sc. (1977) and Ph.D. (1984) from McMaster University. When he is not doing mathematics, David Poole enjoys hiking and cooking, and he is an avid film buff.
Chapter 1: Vectors 1.0: Introduction: The Racetrack Game
1.1: The Geometry and Algebra of Vectors (35)
1.2: Length and Angle: The Dot Product (58)
1.3: Lines and Planes (35)
1.4: Applications (9)
1: Chapter Review
Chapter 2: Systems of Linear Equations 2.0: Introduction: Triviality
2.1: Introduction to Systems of Linear Equations (26)
2.2: Direct Methods for Solving Linear Systems (40)
2.3: Spanning Sets and Linear Independence (40)
2.4: Applications (31)
2.5: Iterative Methods for Solving Linear Systems (15)
2: Chapter Review
Chapter 3: Matrices 3.0: Introduction: Matrices in Action
3.1: Matrix Operations (31)
3.2: Matrix Algebra (35)
3.3: The Inverse of a Matrix (44)
3.4: The LU Factorization (25)
3.5: Subspaces, Basis, Dimension, and Rank (47)
3.6: Introduction to Linear Transformations (36)
3.7: Applications (44)
3: Chapter Review
Chapter 4: Eigenvalues and Eigenvectors 4.0: Introduction: A Dynamical System on Graphs
4.1: Introduction to Eigenvalues and Eigenvectors (22)
4.2: Determinants (49)
4.3: Eigenvalues and Eigenvectors of n � n Matrices (29)
4.4: Similarity and Diagonalization (39)
4.5: Iterative Methods for Computing Eigenvalues (32)
4.6: Applications and the Perron-Frobenius Theorem (51)
4: Chapter Review
Chapter 5: Orthogonality 5.0: Introduction: Shadows on a Wall
5.1: Orthogonality in ℜn (30)
5.2: Orthogonal Complements and Orthogonal Projections (21)
5.3: The Gram-Schmidt Process and the QR Factorization (15)
5.4: Orthogonal Diagonalization of Symmetric Matrices (24)
5.5: Applications (41)
5: Chapter Review
Chapter 6: Vector Spaces 6.0: Introduction: Fibonacci in (Vector) Space
6.1: Vector Spaces and Subspaces (47)
6.2: Linear Independence, Basis, and Dimension (42)
6.3: Change of Basis (17)
6.4: Linear Transformations (24)
6.5: The Kernel and Range of a Linear Transformation (25)
6.6: The Matrix of a Linear Transformation (28)
6.7: Applications (14)
6: Chapter Review
Chapter 7: Distance and Approximation 7.0: Introduction: Taxicab Geometry
7.1: Inner Product Spaces (29)
7.2: Norms and Distance Functions (33)
7.3: Least Squares Approximation (36)
7.4: The Singular Value Decomposition (42)
7.5: Applications (16)
7: Chapter Review
Chapter 8: Codes (Online only) 8.1: Code Vectors (12)
8.2: Error-Correcting (8)
8.3: Dual Codes (11)
8.4: Linear Codes (9)
8.5: The Minimum Distance of a Code (8)
Chapter A: Appendices A.A: Mathematical Notation and Methods of Proof
A.B: Mathematical Induction
A.C: Complex Numbers
A.D: Polynomials
A.E: Technology Bytes (Online only)
Introduction to Partial Di...
-Zachmanoglou-
(Dover)
Real Analysis Modern Techn...
-Folland-
(Wiley)
An Introductory English Gr...
-Stageberg & Oaks-
(Harcourt Brace)
ÁÖ¹® Ãë¼Ò ¿äÃ»ÇÕ´Ï´Ù.
¿äÃ»µå¸³´Ï´Ù.
¼öÇÐ±³À°°úÁ¤°ú ±³Àç¿¬...
Elementary Number ...
Semantics, 3rd
A First Course in ...
Calculus I (2005)
Topology: Internat...
Elementary Differe...
Functional Analysi...
Second Language Re...
Elementary Number ...
SOS PreCalculus, 4...