nalgebra/tests/linalg/udu.rs

63 lines
1.7 KiB
Rust
Raw Normal View History

use na::Matrix3;
use na::UDU;
#[test]
#[rustfmt::skip]
fn udu_simple() {
let m = Matrix3::new(
2.0, -1.0, 0.0,
-1.0, 2.0, -1.0,
0.0, -1.0, 2.0);
let udu = UDU::new(m);
// Rebuild
let p = &udu.u * &udu.d * &udu.u.transpose();
assert!(relative_eq!(m, 2.0*p, epsilon = 1.0e-7));
}
#[cfg(feature = "arbitrary")]
mod quickcheck_tests {
#[allow(unused_imports)]
use crate::core::helper::{RandComplex, RandScalar};
macro_rules! gen_tests(
($module: ident, $scalar: ty) => {
mod $module {
use std::cmp;
use na::{DMatrix, Matrix4};
#[allow(unused_imports)]
use crate::core::helper::{RandScalar, RandComplex};
quickcheck! {
fn udu(m: DMatrix<$scalar>) -> bool {
let mut m = m;
if m.len() == 0 {
m = DMatrix::<$scalar>::new_random(1, 1);
}
let m = m.map(|e| e.0);
let udu = UDU::new(m.clone());
let p = &udu.u * &udu.d * &udu.u.transpose();
relative_eq!(m, p, epsilon = 1.0e-7)
}
fn udu_static(m: Matrix4<$scalar>) -> bool {
let m = m.map(|e| e.0);
let udu = UDU::new(m.clone());
let p = &udu.u * &udu.d * &udu.u.transpose();
relative_eq!(m, p, epsilon = 1.0e-7)
}
}
}
}
);
gen_tests!(complex, RandComplex<f64>);
gen_tests!(f64, RandScalar<f64>);
}