## Applications of Band Matrices

A **band matrix** is a sparse matrix whose non-zero entries are confined to a diagonal band comprising the main diagonal and a fixed number of diagonals on each side.

### Definition

An n × n matrix A is a band matrix with **upper bandwidth** q and **lower bandwidth** p if aᵢⱼ = 0 whenever j > i + q or i > j + p. The **total bandwidth** is p + q.

### Special Cases

- **Tridiagonal matrix**: p = q = 1 (only main diagonal and adjacent diagonals)
- **Pentadiagonal matrix**: p = q = 2
- **Diagonal matrix**: p = q = 0

### Applications

**1. Numerical Solution of Differential Equations**

Finite difference discretizations of differential equations produce band matrices. For example, the second derivative approximation gives a tridiagonal system.

**2. Cubic Spline Interpolation**

Determining spline coefficients requires solving a tridiagonal linear system.

**3. Signal Processing**

Convolution operations with finite impulse response filters produce Toeplitz band matrices.

### Computational Advantage

Band matrices allow efficient storage and computation:
- **Storage**: O(n · bandwidth) instead of O(n²)
- **Gaussian elimination**: O(n · bandwidth²) instead of O(n³)
- **Tridiagonal systems**: O(n) using the Thomas algorithm

### Example

A 5 × 5 tridiagonal matrix:
```
[2  -1   0   0   0]
[-1  2  -1   0   0]
[0  -1   2  -1   0]
[0   0  -1   2  -1]
[0   0   0  -1   2]
```

This matrix arises from discretizing the 1D Poisson equation.