Atnaujinkite slapukų nuostatas

Linear Algebra: Algorithms, Applications, and Techniques 4th edition [Minkštas viršelis]

4.40/5 (10 ratings by Goodreads)
, (Professor of Mathematics and Computer Science, Senior Executive Assistant to the President, Fairleigh Dickinson University, USA), , (Visiting Professor, Department of Mathematical Sciences, United States Military Academy, West Point, NY,)
  • Formatas: Paperback / softback, 528 pages, aukštis x plotis: 235x191 mm, weight: 1070 g
  • Išleidimo metai: 21-Jun-2023
  • Leidėjas: Academic Press Inc
  • ISBN-10: 0128234709
  • ISBN-13: 9780128234709
Kitos knygos pagal šią temą:
  • Formatas: Paperback / softback, 528 pages, aukštis x plotis: 235x191 mm, weight: 1070 g
  • Išleidimo metai: 21-Jun-2023
  • Leidėjas: Academic Press Inc
  • ISBN-10: 0128234709
  • ISBN-13: 9780128234709
Kitos knygos pagal šią temą:
Linear Algebra: Algorithms, Applications, and Techniques, Fourth Edition offers a modern and algorithmic approach to computation while providing clear and straightforward theoretical background information. The book guides readers through the major applications, with chapters on properties of real numbers, proof techniques, matrices, vector spaces, linear transformations, eigen values, and Euclidean inner products. Appendices on Jordan canonical forms and Markov chains are included for further study. This useful textbook presents broad and balanced views of theory, with key material highlighted and summarized in each chapter. To further support student practice, the book also includes ample exercises with answers and hints.
  • Introduces deductive reasoning and helps the reader develop a facility with mathematical proofs
  • Provides a balanced approach to computation and theory by offering computational algorithms for finding eigenvalues and eigenvectors
  • Offers excellent exercise sets, ranging from drill to theoretical/challenging, along with useful and interesting applications not found in other introductory linear algebra texts
Preface ix
Author Bio xi
Fundamentals 1(8)
0.1 Basic properties of real numbers
1(1)
0.2 Propositions and conditional statements
2(1)
0.3 Direct proof
3(1)
0.4 Proof by contrapositive
4(1)
0.5 Proof by contradiction
5(1)
0.6 Mathematical induction
6(3)
1 Matrices
9(96)
1.1 Basic concepts
9(10)
1.2 Matrix multiplication
19(12)
1.3 Special matrices
31(9)
1.4 Linear systems of equations
40(17)
1.5 Determinants
57(20)
1.6 The inverse
77(16)
1.7 LU decomposition
93(12)
Chapter 1 Review
101(4)
2 Vector spaces
105(80)
2.1 Properties of Rn
105(10)
2.2 Vectors
115(12)
2.3 Subspaces
127(10)
2.4 Linear independence
137(9)
2.5 Basis and dimension
146(15)
2.6 Row space of a matrix
161(10)
2.7 Rank of a matrix
171(14)
Chapter 2 Review
181(4)
3 Linear transformations
185(58)
3.1 Functions
185(6)
3.2 Linear transformations
191(9)
3.3 Matrix representations
200(13)
3.4 Change of basis
213(13)
3.5 Properties of linear transformations
226(17)
Chapter 3 Review
241(2)
4 Eigenvalues and eigenvectors
243(42)
4.1 Eigenvectors and eigenvalues
243(14)
4.2 Properties of eigenvalues and eigenvectors
257(6)
4.3 Diagonalization of matrices
263(9)
4.4 Power methods
272(13)
Chapter 4 review
282(3)
5 Applications of eigenvalues: Differential equations
285(34)
5.1 The exponential matrix
285(13)
5.2 Differential equations in fundamental form
298(7)
5.3 Solving differential equations in fundamental form
305(10)
5.4 Modeling and differential equations
315(4)
Chapter 5 Review
318(1)
6 Applications of eigenvalues: Graph theory
319(20)
6.1 A brief introduction to graphs and networks
319(1)
6.2 The adjacency matrix
320(6)
6.3 The Laplacian matrix
326(5)
6.4 Adjacency matrix eigenvalues
331(8)
Chapter 6 Review
337(2)
7 Euclidean inner product
339(54)
7.1 Orthogonality
339(12)
7.2 Projections and Gram-Schmidt orthonormalization
351(14)
7.3 The QR algorithm
365(9)
7.4 Least squares
374(9)
7.5 Orthogonal complements
383(10)
Chapter 7 Review
391(2)
Appendix A Jordan canonical forms 393(34)
Appendix B Markov chains 427(12)
Answers and hints to selected problems 439(74)
Index 513
Richard Bronson is a Professor of Mathematics and Computer Science at Fairleigh Dickinson University and is Senior Executive Assistant to the President. Ph.D., in Mathematics from Stevens Institute of Technology. He has written several books and numerous articles on Mathematics. He has served as Interim Provost of the Metropolitan Campus, and has been Acting Dean of the College of Science and Engineering at the university in New Jersey Gabriel B. Costa is currently a visiting professor at the United States Military Academy at West Point and is on the faculty at Seton Hall. And is an engineer. He holds many titles and fills them with distinction. He has a B.S., M.S. and Ph.D. in Mathematics from Stevens Institute of Technology. He has also co-authored another Academic Press book with Richard Bronson, Matrix Methods. John T. Saccoman is Professor and Chair, Department of Mathematics and Computer Science, Seton Hall University, New Jersey received Ph.D., Stevens Institute of Technology, Hoboken, NJ, 1995 Research work on synthesis results in network reliability theory. He has published in several journals, authored supplementary materials, and is highly involved in the use of technology in applied mathematics. He has worked collaboratively on writings for Transforming the Curriculum Across the Disciplines Through Technology-Based Faculty Development and Writing-Intensive Course Redesign. Daniel Gross is a professor in the Department of Mathematics and Computer Science at Seton Hall University in South Orange, New Jersey. Dan received his PhD in Mathematics from the University of Notre Dame in 1982. His research interests are network reliability and network vulnerability.