《算法导论(第4版)》阅读笔记：p83-p85-CSDN博客

本文链接：https://blog.csdn.net/codists/article/details/148052509

《算法导论(第4版)》学习第 18 天，p83-p85 总结，总计 3 页。

一、技术总结

1. Strassen algorithm(施特拉森算法)

2.矩阵

(1)矩阵表示法

If we wish to refer to matrices without specifically writing out all their entries, we will use uppercase A, B, C, and so on. In general, aᵢⱼ will denote the entry of the matrix A that is in the ith row and the jth column. We will refer to this entry as the (i, j) entry of A. We will sometimes shorten this to A = (aᵢⱼ). Similarly, a matrix B may be referred to as (bᵢⱼ), a matrix C as (cᵢⱼ), and so on.

(2)dense matrix(密集矩阵) & sparse matrix(稀疏矩阵)、

Generally, we’ll assume that the matrices are dense, meaning that most of the n² entries are not 0, as opposed to sparse, where most of the n² entries are 0 and the nonzero entries can be stored more compactly than in an n × n array.