Request for consultation
Thanks for your request. You’ll soon be chatting with a consultant to get the answers you need.
Your form is submitting...
{{formPostErrorMessage.message}} [{{formPostErrorMessage.code}}]
Quick Navigation
Overview
WebAssign for Poole’s "Linear Algebra: A Modern Introduction," 5th Edition, is a flexible and fully customizable online instructional solution that puts powerful tools in the hands of instructors, enabling you to deploy assignments, instantly assess individual student and class performance and help your students master the course concepts. With its powerful digital platform, you can tailor your course with a wide range of assignment settings, add your own questions and content and access student and course analytics and communication tools.
- By the Book: WebAssign elevates the superior content and pedagogy of the text by offering algorithmically-generated assignments based on end-of-section questions directly from the book.
- Diverse Answers: This flexible and powerful answer evaluator accepts diverse interpretations so your students are not penalized for entering a mathematically equivalent or differently formatted answer.
- Secure Testing: Concerned about cheating? WebAssign enables you to password-protect assignments, set a time limit for completion, restrict access to certain IP addresses and even prevent students from accessing other applications on their computer while taking the test.
- Analytics: With powerful analytics tools in WebAssign, you can assess course performance, determine concept mastery and identify at-risk students.
- Timely Help: Promote independent learning with a wide range of help tools at the question or assignment level -- such as Watch It videos, Master It tutorials and Read It links to the eBook -- and feedback when students need it to complete assignments and help them learn the concepts.
- Grading: WebAssign saves you time spent grading, while providing students with an intuitive experience and instant feedback.
- LMS Integrations: WebAssign integrates with popular LMS systems for ease of use. WebAssign can eliminate manual entry of routine data by linking your institution’s information systems to our software.
- Support & Services: WebAssign has a top-notch team of experts who are available to help whenever you need them.
Chapter 1: Vectors
Introduction: The Racetrack Game. The Geometry and Algebra of Vectors. Length and Angle: The Dot Product. Lines and Planes. Applications. Chapter Review.
Chapter 2: Systems of Linear Equations
Introduction: Triviality. Introduction to Systems of Linear Equations. Direct Methods for Solving Linear Systems. Spanning Sets and Linear Independence. Applications. Iterative Methods for Solving Linear Systems. Chapter Review.
Chapter 3: Matrices
Introduction: Matrices in Action. Matrix Operations. Matrix Algebra. The Inverse of a Matrix. The LU Factorization. Subspaces, Basis, Dimension, and Rank. Introduction to Linear Transformations. Applications. Chapter Review.
Chapter 4: Eigenvalues and Eigenvectors
Introduction: A Dynamical System on Graphs. Introduction to Eigenvalues and Eigenvectors. Determinants. Eigenvalues and Eigenvectors of n × n Matrices. Similarity and Diagonalization. Iterative Methods for Computing Eigenvalues. Applications and the Perron-Frobenius Theorem. Chapter Review
Chapter 5: Orthogonality
Introduction: Shadows on a Wall. Orthogonality in ℝn. Orthogonal Complements and Orthogonal Projections. The Gram-Schmidt Process and the QR Factorization. Orthogonal Diagonalization of Symmetric Matrices. Applications. Chapter Review.
Chapter 6: Vector Spaces
Introduction: Fibonacci in (Vector) Space. Vector Spaces and Subspaces. Linear Independence, Basis, and Dimension. Change of Basis. Linear Transformations. The Kernel and Range of a Linear Transformation. The Matrix of a Linear Transformation. Applications. Chapter Review.
Chapter 7: Distance and Approximation
Introduction: Taxicab Geometry. Inner Product Spaces. Norms and Distance Functions. Least Squares Approximation. The Singular Value Decomposition. Applications. Chapter Review.
Chapter 8: Codes
Introduction: ASCII. Code Vectors. Error-Correcting Codes. Dual Codes. Linear Codes. The Minimum Distance of a Code. Chapter Review.
Chapter A: Appendices
Mathematical Notation and Methods of Proof. Mathematical Induction. Complex Numbers. Polynomials. Technology Bytes.
Introduction: The Racetrack Game. The Geometry and Algebra of Vectors. Length and Angle: The Dot Product. Lines and Planes. Applications. Chapter Review.
Chapter 2: Systems of Linear Equations
Introduction: Triviality. Introduction to Systems of Linear Equations. Direct Methods for Solving Linear Systems. Spanning Sets and Linear Independence. Applications. Iterative Methods for Solving Linear Systems. Chapter Review.
Chapter 3: Matrices
Introduction: Matrices in Action. Matrix Operations. Matrix Algebra. The Inverse of a Matrix. The LU Factorization. Subspaces, Basis, Dimension, and Rank. Introduction to Linear Transformations. Applications. Chapter Review.
Chapter 4: Eigenvalues and Eigenvectors
Introduction: A Dynamical System on Graphs. Introduction to Eigenvalues and Eigenvectors. Determinants. Eigenvalues and Eigenvectors of n × n Matrices. Similarity and Diagonalization. Iterative Methods for Computing Eigenvalues. Applications and the Perron-Frobenius Theorem. Chapter Review
Chapter 5: Orthogonality
Introduction: Shadows on a Wall. Orthogonality in ℝn. Orthogonal Complements and Orthogonal Projections. The Gram-Schmidt Process and the QR Factorization. Orthogonal Diagonalization of Symmetric Matrices. Applications. Chapter Review.
Chapter 6: Vector Spaces
Introduction: Fibonacci in (Vector) Space. Vector Spaces and Subspaces. Linear Independence, Basis, and Dimension. Change of Basis. Linear Transformations. The Kernel and Range of a Linear Transformation. The Matrix of a Linear Transformation. Applications. Chapter Review.
Chapter 7: Distance and Approximation
Introduction: Taxicab Geometry. Inner Product Spaces. Norms and Distance Functions. Least Squares Approximation. The Singular Value Decomposition. Applications. Chapter Review.
Chapter 8: Codes
Introduction: ASCII. Code Vectors. Error-Correcting Codes. Dual Codes. Linear Codes. The Minimum Distance of a Code. Chapter Review.
Chapter A: Appendices
Mathematical Notation and Methods of Proof. Mathematical Induction. Complex Numbers. Polynomials. Technology Bytes.