Skip to main content
Top

2023 | Book

Applied Linear Algebra and Matrix Methods

insite
SEARCH

About this book

This textbook is designed for a first course in linear algebra for undergraduate students from a wide range of quantitative and data driven fields. By focusing on applications and implementation, students will be prepared to go on to apply the power of linear algebra in their own discipline. With an ever-increasing need to understand and solve real problems, this text aims to provide a growing and diverse group of students with an applied linear algebra toolkit they can use to successfully grapple with the complex world and the challenging problems that lie ahead. Applications such as least squares problems, information retrieval, linear regression, Markov processes, finding connections in networks, and more, are introduced on a small scale as early as possible and then explored in more generality as projects. Additionally, the book draws on the geometry of vectors and matrices as the basis for the mathematics, with the concept of orthogonality taking center stage. Important matrix factorizations as well as the concepts of eigenvalues and eigenvectors emerge organically from the interplay between matrix computations and geometry.

The R files are extra and freely available. They include basic code and templates for many of the in-text examples, most of the projects, and solutions to selected exercises. As much as possible, data sets and matrix entries are included in the files, thus reducing the amount of manual data entry required.

Table of Contents

Frontmatter
Chapter 1. Vectors
Abstract
Abstract
Timothy G. Feeman
Chapter 2. Matrices
Abstract
Abstract
Timothy G. Feeman
Chapter 3. Matrix Contexts
Abstract
Abstract
Timothy G. Feeman
Chapter 4. Linear Systems
Abstract
Abstract
Timothy G. Feeman
Chapter 5. Least Squares and Matrix Geometry
Abstract
Abstract
Timothy G. Feeman
Chapter 6. Orthogonal Systems
Abstract
Abstract
Timothy G. Feeman
Chapter 7. Eigenvalues
Abstract
Abstract
Timothy G. Feeman
Chapter 8. Markov Processes
Abstract
A Markov process is a dynamical system where movement within the system consists of transitions between a finite set of states. These transitions are governed by prescribed probabilistic rules and are memoryless in the sense that the transition to a new state depends only on the current state of the system and not on the entire transition history. We consider only finite-state, discrete-time Markov processes.
Timothy G. Feeman
Chapter 9. Symmetric Matrices
Abstract
Abstract
Timothy G. Feeman
Chapter 10. Singular Value Decomposition
Abstract
Abstract
Timothy G. Feeman
Backmatter
Metadata
Title
Applied Linear Algebra and Matrix Methods
Author
Timothy G. Feeman
Copyright Year
2023
Electronic ISBN
978-3-031-39562-8
Print ISBN
978-3-031-39561-1
DOI
https://doi.org/10.1007/978-3-031-39562-8

Premium Partner