The matrix decomposition introduced in this chapter is very important in many practical applications, since it yields the best possible approximation (in a certain sense) of a given matrix by a matrix of low rank. A low rank approximation can be considered a “compression” of the data represented by the given matrix. We illustrate this with an example from image processing.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

The Singular Value Decomposition

  • Jörg Liesen,
  • Volker Mehrmann

摘要

The matrix decomposition introduced in this chapter is very important in many practical applications, since it yields the best possible approximation (in a certain sense) of a given matrix by a matrix of low rank. A low rank approximation can be considered a “compression” of the data represented by the given matrix. We illustrate this with an example from image processing.