Frobenius norm

最新推荐文章于 2024-03-05 23:19:32 发布

CH-Yuan

最新推荐文章于 2024-03-05 23:19:32 发布

阅读量1k

点赞数 1

分类专栏：距离

距离专栏收录该内容

2 篇文章 0 订阅

订阅专栏

These vector norms treat an $m \times n$ matrix as a vector of size mn, and use one of the familiar vector norms.

For example, using the p-norm for vectors, we get:

$\Vert A \Vert_{p} = \left( \sum_{i=1}^m \sum_{j=1}^n |a_{ij}|^p \right)^{1/p}. \,$

This is a different norm from the induced p-norm (see above) and the Schatten p-norm (see below), but the notation is the same.

The special case p = 2 is the Frobenius norm, and p = ∞ yields the maximum norm.

[edit]Frobenius norm

For p = 2, this is called the Frobenius norm or the Hilbert–Schmidt norm, though the latter term is often reserved for operators on Hilbert space. This norm can be defined in various ways:

$\|A\|_F=\sqrt{\sum_{i=1}^m\sum_{j=1}^n |a_{ij}|^2}=\sqrt{\operatorname{trace}(A^{{}^*} A)}=\sqrt{\sum_{i=1}^{\min\{m,\,n\}} \sigma_{i}^2}$

where A^* denotes the conjugate transpose of A, σ_i are the singular values of A, and the trace function is used. The Frobenius norm is very similar to the Euclidean norm on Kⁿ and comes from an inner product on the space of all matrices.

The Frobenius norm is submultiplicative and is very useful for numerical linear algebra. This norm is often easier to compute than induced norms.

CH-Yuan

关注

1
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
Frobenius norm

These vector norms treat an norm" style="margin:0px; padding:0px; border:none; list-style:none; vertical-align:middle"> matrix as a vector of size mn, and use one of the familiar vector norms.Fo
复制链接

扫一扫