use crate::errors::linear_error::LinearError;
use crate::traits::matrix_view::MatrixView;
use deep_causality_algebra::{Normed, NormedScalar, Real};
use deep_causality_num::Zero;
pub fn vector_norm_l1<T: NormedScalar>(v: &[T]) -> <T as Normed>::Real {
let mut acc = <T as Normed>::Real::zero();
for x in v {
acc += x.modulus();
}
acc
}
pub fn vector_norm_sq<T: NormedScalar>(v: &[T]) -> <T as Normed>::Real {
let mut acc = <T as Normed>::Real::zero();
for x in v {
acc += x.modulus_squared();
}
acc
}
pub fn vector_norm_l2<T: NormedScalar>(v: &[T]) -> <T as Normed>::Real {
vector_norm_sq(v).sqrt()
}
pub fn vector_norm_inf<T: NormedScalar>(v: &[T]) -> <T as Normed>::Real {
let mut best = <T as Normed>::Real::zero();
for x in v {
let m = x.modulus();
if m > best {
best = m;
}
}
best
}
pub fn matrix_norm_l1<M>(m: &M) -> Result<<M::Scalar as Normed>::Real, LinearError>
where
M: MatrixView,
M::Scalar: NormedScalar,
{
let (r, c) = (m.rows(), m.cols());
let mut best = <M::Scalar as Normed>::Real::zero();
for j in 0..c {
let mut col = <M::Scalar as Normed>::Real::zero();
for i in 0..r {
col += m.get(i, j)?.modulus();
}
if col > best {
best = col;
}
}
Ok(best)
}
pub fn matrix_norm_inf<M>(m: &M) -> Result<<M::Scalar as Normed>::Real, LinearError>
where
M: MatrixView,
M::Scalar: NormedScalar,
{
let (r, c) = (m.rows(), m.cols());
let mut best = <M::Scalar as Normed>::Real::zero();
for i in 0..r {
let mut row = <M::Scalar as Normed>::Real::zero();
for j in 0..c {
row += m.get(i, j)?.modulus();
}
if row > best {
best = row;
}
}
Ok(best)
}
pub fn matrix_norm_frobenius<M>(m: &M) -> Result<<M::Scalar as Normed>::Real, LinearError>
where
M: MatrixView,
M::Scalar: NormedScalar,
{
let (r, c) = (m.rows(), m.cols());
let mut acc = <M::Scalar as Normed>::Real::zero();
for i in 0..r {
for j in 0..c {
acc += m.get(i, j)?.modulus_squared();
}
}
Ok(acc.sqrt())
}