Frobenius范数

最新推荐文章于 2025-01-16 11:50:58 发布

JerryRenhao

最新推荐文章于 2025-01-16 11:50:58 发布

阅读量3.5k

点赞数

分类专栏： Linear Algebra and Math

Linear Algebra and Math 专栏收录该内容

2 篇文章

订阅专栏

Frobenius norm

Main article: Hilbert–Schmidt operator

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 the Frobenius inner product on the space of all matrices.

The Frobenius norm is sub-multiplicative and is very useful for numerical linear algebra. This norm is often easier to compute than induced norms and has the useful property of being invariant under rotations. This property follows easily from the trace definition restricted to real matrices,

$\|A\|_F^{2} = \|P^{\top} \cdot B \cdot P\|_F^{2} = \operatorname{trace}\left( \left( P^{\top} \cdot B \cdot P \right)^{\top} \cdot \left( P^{\top} \cdot B \cdot P \right) \right) = \operatorname{trace}(B^{\top} \cdot B) = \|B\|_F^{2}$ ,

where we have used the orthogonal nature of P, $P^{\top} \cdot P = \mathbf{I}$ and the cyclic nature of the trace, $\operatorname{trace}(XYZ) = \operatorname{trace}(ZXY)$ . More generally the norm is invariant under a unitary transformation for complex matrices.