文章目录[隐藏]
Intro
- Sparse matrix vector multiplication.
- Many scientific algorithms require multiplying a matrix by a vector.
- Optimization (e.g. conjugate gradient
low degree mesh
.), iterative methods (solving linear systems), eigenvalue methods (e.g. graph partitioning vx), simulations (e.g. finite elements), data analysis (e.g. Pagerankthe web connectivity matrix
).
- Optimization (e.g. conjugate gradient
- The matrices are often sparse.
- In an nxn matrix, there are \(O(n^2)\) nonzero elements.