Class NormOps_FDRM
Norms are a measure of the size of a vector or a matrix. One typical application is in error analysis.
Vector norms have the following properties:- ||x|| > 0 if x ≠ 0 and ||0|| = 0
- ||αx|| = |α| ||x||
- ||x+y|| ≤ ||x|| + ||y||
- ||A|| > 0 if A ≠ 0 where A ∈ ℜ m × n
- || α A || = |α| ||A|| where A ∈ ℜ m × n
- ||A+B|| ≤ ||A|| + ||B|| where A and B are ∈ ℜ m × n
- ||AB|| ≤ ||A|| ||B|| where A and B are ∈ ℜ m × m
Matrix norms can be induced from vector norms as is shown below:
||A||M = maxx≠0||Ax||v/||x||v
where ||.||M is the induced matrix norm for the vector norm ||.||v.
By default implementations that try to mitigate overflow/underflow are used. If the word fast is found before a function's name that means it does not mitigate those issues, but runs a bit faster.
-
Method Summary
Modifier and TypeMethodDescriptionstatic float
conditionP
(FMatrixRMaj A, float p) The condition number of a matrix is used to measure the sensitivity of the linear system Ax=b.static float
The condition p = 2 number of a matrix is used to measure the sensitivity of the linear system Ax=b.static float
elementP
(FMatrix1Row A, float p) Element wise p-norm:
norm = {∑i=1:m ∑j=1:n { |aij|p}}1/pstatic float
fastElementP
(FMatrixD1 A, float p) Same aselementP(org.ejml.data.FMatrix1Row, float)
but runs faster by not mitigating overflow/underflow related problems.static float
This implementation of the Frobenius norm is a straight forward implementation and can be susceptible for overflow/underflow issues.static float
fastNormP
(FMatrixRMaj A, float p) An unsafe but faster version ofnormP(org.ejml.data.FMatrixRMaj, float)
that calls routines which are faster but more prone to overflow/underflow problems.static float
Computes the p=2 norm.static float
Computes the induced p = 1 matrix norm.
||A||1= max(j=1 to n; sum(i=1 to m; |aij|))static float
Computes the induced p = 2 matrix norm, which is the largest singular value.static float
Induced matrix p = infinity norm.
||A||∞ = max(i=1 to m; sum(j=1 to n; |aij|))static void
Normalizes the matrix such that the Frobenius norm is equal to one.static float
Computes the Frobenius matrix norm:
normF = Sqrt{ ∑i=1:m ∑j=1:n { aij2} }static float
normP
(FMatrixRMaj A, float p) Computes either the vector p-norm or the induced matrix p-norm depending on A being a vector or a matrix respectively.static float
Computes the p=1 norm.static float
Computes the p=2 norm.static float
Computes the p=∞ norm.
-
Method Details
-
normalizeF
Normalizes the matrix such that the Frobenius norm is equal to one.- Parameters:
A
- The matrix that is to be normalized.
-
conditionP
The condition number of a matrix is used to measure the sensitivity of the linear system Ax=b. A value near one indicates that it is a well conditioned matrix.
κp = ||A||p||A-1||pIf the matrix is not square then the condition of either ATA or AAT is computed.
- Parameters:
A
- The matrix.p
- p-norm- Returns:
- The condition number.
-
conditionP2
The condition p = 2 number of a matrix is used to measure the sensitivity of the linear system Ax=b. A value near one indicates that it is a well conditioned matrix.
κ2 = ||A||2||A-1||2This is also known as the spectral condition number.
- Parameters:
A
- The matrix.- Returns:
- The condition number.
-
fastNormF
This implementation of the Frobenius norm is a straight forward implementation and can be susceptible for overflow/underflow issues. A more resilient implementation is
normF(org.ejml.data.FMatrixD1)
.- Parameters:
a
- The matrix whose norm is computed. Not modified.
-
normF
Computes the Frobenius matrix norm:
normF = Sqrt{ ∑i=1:m ∑j=1:n { aij2} }This is equivalent to the element wise p=2 norm. See
fastNormF(org.ejml.data.FMatrixD1)
for another implementation that is faster, but more prone to underflow/overflow errors.- Parameters:
a
- The matrix whose norm is computed. Not modified.- Returns:
- The norm's value.
-
elementP
Element wise p-norm:
norm = {∑i=1:m ∑j=1:n { |aij|p}}1/pThis is not the same as the induced p-norm used on matrices, but is the same as the vector p-norm.
- Parameters:
A
- Matrix. Not modified.p
- p value.- Returns:
- The norm's value.
-
fastElementP
Same aselementP(org.ejml.data.FMatrix1Row, float)
but runs faster by not mitigating overflow/underflow related problems.- Parameters:
A
- Matrix. Not modified.p
- p value.- Returns:
- The norm's value.
-
normP
Computes either the vector p-norm or the induced matrix p-norm depending on A being a vector or a matrix respectively.- Parameters:
A
- Vector or matrix whose norm is to be computed.p
- The p value of the p-norm.- Returns:
- The computed norm.
-
fastNormP
An unsafe but faster version ofnormP(org.ejml.data.FMatrixRMaj, float)
that calls routines which are faster but more prone to overflow/underflow problems.- Parameters:
A
- Vector or matrix whose norm is to be computed.p
- The p value of the p-norm.- Returns:
- The computed norm.
-
normP1
Computes the p=1 norm. If A is a matrix then the induced norm is computed.- Parameters:
A
- Matrix or vector.- Returns:
- The norm.
-
normP2
Computes the p=2 norm. If A is a matrix then the induced norm is computed.- Parameters:
A
- Matrix or vector.- Returns:
- The norm.
-
fastNormP2
Computes the p=2 norm. If A is a matrix then the induced norm is computed. This implementation is faster, but more prone to buffer overflow or underflow problems.- Parameters:
A
- Matrix or vector.- Returns:
- The norm.
-
normPInf
Computes the p=∞ norm. If A is a matrix then the induced norm is computed.- Parameters:
A
- Matrix or vector.- Returns:
- The norm.
-
inducedP1
Computes the induced p = 1 matrix norm.
||A||1= max(j=1 to n; sum(i=1 to m; |aij|))- Parameters:
A
- Matrix. Not modified.- Returns:
- The norm.
-
inducedP2
Computes the induced p = 2 matrix norm, which is the largest singular value.
- Parameters:
A
- Matrix. Not modified.- Returns:
- The norm.
-
inducedPInf
Induced matrix p = infinity norm.
||A||∞ = max(i=1 to m; sum(j=1 to n; |aij|))- Parameters:
A
- A matrix.- Returns:
- the norm.
-