use approx::assert_relative_eq;
use mdarray::{array, Array, Const, DArray};
use super::common::random_matrix;
use crate::solve::Solve;
fn test_solve_verification<T>(original_a: &DArray<T, 2>, x: &DArray<T, 2>, b: &DArray<T, 2>)
where
T: Default
+ std::fmt::Debug
+ Copy
+ std::ops::Mul<Output = T>
+ std::ops::Add<Output = T>
+ std::ops::Sub<Output = T>,
f64: From<T>,
{
let (n, nrhs) = *b.shape();
let mut ax = DArray::<T, 2>::zeros([n, nrhs]);
for i in 0..n {
for j in 0..nrhs {
let mut sum = T::default();
for k in 0..n {
sum = sum + original_a[[i, k]] * x[[k, j]];
}
ax[[i, j]] = sum;
}
}
for i in 0..n {
for j in 0..nrhs {
let diff = f64::from(ax[[i, j]]) - f64::from(b[[i, j]]);
assert_relative_eq!(diff, 0.0, epsilon = 1e-10);
}
}
}
pub fn test_solve_single_rhs(bd: &impl Solve<f64, usize>) {
let n = 4;
let a = random_matrix(n, n);
let original_a = a.clone();
let b = random_matrix(n, 1);
let x = bd.solve(&mut a.clone(), &b).expect("");
test_solve_verification(&original_a, &x, &b);
}
pub fn test_solve_static_rhs_shape(bd: &impl Solve<f64, Const<3>>) {
let mut a: Array<f64, (Const<3>, Const<3>)> = array![
[2.0, 1.0, 0.0],
[1.0, 3.0, 1.0],
[0.0, 1.0, 2.0],
];
let original_a = a.clone();
let b: Array<f64, (Const<3>, Const<1>)> = array![[1.0], [2.0], [1.0]];
let x = bd.solve(&mut a, &b).expect("");
for i in 0..3 {
let mut ax_i = 0.0;
for k in 0..3 {
ax_i += original_a[[i, k]] * x[[k, 0]];
}
assert_relative_eq!(ax_i, b[[i, 0]], epsilon = 1e-10);
}
}
pub fn test_solve_multiple_rhs(bd: &impl Solve<f64, usize>) {
let n = 5;
let nrhs = 3;
let mut a = random_matrix(n, n);
let original_a = a.clone();
let b = random_matrix(n, nrhs);
let x = bd.solve(&mut a, &b).expect("");
test_solve_verification(&original_a, &x, &b);
}
pub fn test_solve_write(bd: &impl Solve<f64, usize>) {
let n = 4;
let nrhs = 2;
let mut a = random_matrix(n, n);
let original_a = a.clone();
let mut b = random_matrix(n, nrhs);
let original_b = b.clone();
bd.solve_write(&mut a, &mut b).expect("solve_write failed");
test_solve_verification(&original_a, &b, &original_b);
}
pub fn test_solve_identity_matrix(bd: &impl Solve<f64, usize>) {
let n = 3;
let nrhs = 2;
let mut a = DArray::<f64, 2>::zeros([n, n]);
for i in 0..n {
a[[i, i]] = 1.0;
}
let original_a = a.clone();
let b = random_matrix(n, nrhs);
let x = bd.solve(&mut a, &b).expect("");
for i in 0..n {
for j in 0..nrhs {
let diff = x[[i, j]] - b[[i, j]];
assert_relative_eq!(diff, 0.0, epsilon = 1e-14);
}
}
test_solve_verification(&original_a, &x, &b);
}
pub fn test_solve_complex(bd: &impl Solve<num_complex::Complex<f64>, usize>) {
use num_complex::Complex;
let n = 4;
let nrhs = 2;
let re = random_matrix(n, n);
let im = random_matrix(n, n);
let mut a = DArray::<Complex<f64>, 2>::from_fn([n, n], |i| {
Complex::new(re[[i[0], i[1]]], im[[i[0], i[1]]])
});
println!("a={a:?}");
let original_a = a.clone();
let b = DArray::<Complex<f64>, 2>::from_fn([n, nrhs], |i| {
Complex::new((i[0] + 2 * i[1] + 1) as f64, (2 * i[0] + i[1] + 1) as f64)
});
println!("b={b:?}");
let x = bd.solve(&mut a, &b).expect("");
println!("{x:?}");
for i in 0..n {
for j in 0..nrhs {
let mut sum = Complex::new(0.0, 0.0);
for k in 0..n {
sum += original_a[[i, k]] * x[[k, j]];
}
let diff_real = sum.re - b[[i, j]].re;
let diff_imag = sum.im - b[[i, j]].im;
assert_relative_eq!(diff_real, 0.0, epsilon = 1e-10);
assert_relative_eq!(diff_imag, 0.0, epsilon = 1e-10);
}
}
}