1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68
// Copyright 2018-2022 argmin developers
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://apache.org/licenses/LICENSE-2.0> or the MIT license <LICENSE-MIT or
// http://opensource.org/licenses/MIT>, at your option. This file may not be
// copied, modified, or distributed except according to those terms.
use crate::ArgminInv;
use crate::Error;
use ndarray::Array2;
use ndarray_linalg::Inverse;
use num_complex::Complex;
macro_rules! make_inv {
($t:ty) => {
impl ArgminInv<Array2<$t>> for Array2<$t>
where
Array2<$t>: Inverse,
{
#[inline]
fn inv(&self) -> Result<Array2<$t>, Error> {
Ok(<Self as Inverse>::inv(&self)?)
}
}
};
}
make_inv!(f32);
make_inv!(f64);
make_inv!(Complex<f32>);
make_inv!(Complex<f64>);
#[cfg(test)]
mod tests {
use super::*;
use ndarray::array;
use paste::item;
macro_rules! make_test {
($t:ty) => {
item! {
#[test]
fn [<test_inv_ $t>]() {
let a = array![
[2 as $t, 5 as $t],
[1 as $t, 3 as $t],
];
let target = array![
[3 as $t, -5 as $t],
[-1 as $t, 2 as $t],
];
let res = <Array2<$t> as ArgminInv<Array2<$t>>>::inv(&a).unwrap();
for i in 0..2 {
for j in 0..2 {
// TODO: before ndarray 0.14 / ndarray-linalg 0.13, comparison with
// EPSILON worked, now errors are larger (and dependent on the BLAS
// backend)
assert!((((res[(i, j)] - target[(i, j)]) as f64).abs()) < 0.000001);
}
}
}
}
};
}
make_test!(f32);
make_test!(f64);
}