2024-03-28 22:26:11 +08:00
|
|
|
use na::{DMatrix, Matrix3};
|
2017-08-03 01:37:44 +08:00
|
|
|
|
2021-03-01 00:52:14 +08:00
|
|
|
#[cfg(feature = "proptest-support")]
|
|
|
|
mod proptest_tests {
|
2019-03-23 18:46:56 +08:00
|
|
|
macro_rules! gen_tests(
|
2021-03-01 00:52:14 +08:00
|
|
|
($module: ident, $scalar: expr, $scalar_type: ty) => {
|
2019-03-23 18:46:56 +08:00
|
|
|
mod $module {
|
2021-03-01 00:52:14 +08:00
|
|
|
use na::DMatrix;
|
2019-03-23 18:46:56 +08:00
|
|
|
#[allow(unused_imports)]
|
2019-03-23 21:29:07 +08:00
|
|
|
use crate::core::helper::{RandScalar, RandComplex};
|
2019-03-23 18:46:56 +08:00
|
|
|
use std::cmp;
|
|
|
|
|
2021-03-01 00:52:14 +08:00
|
|
|
use crate::proptest::*;
|
|
|
|
use proptest::{prop_assert, proptest};
|
|
|
|
|
|
|
|
proptest! {
|
|
|
|
#[test]
|
|
|
|
fn symmetric_eigen(n in PROPTEST_MATRIX_DIM) {
|
2019-03-23 18:46:56 +08:00
|
|
|
let n = cmp::max(1, cmp::min(n, 10));
|
2021-03-01 00:52:14 +08:00
|
|
|
let m = DMatrix::<$scalar_type>::new_random(n, n).map(|e| e.0).hermitian_part();
|
2019-03-23 18:46:56 +08:00
|
|
|
let eig = m.clone().symmetric_eigen();
|
|
|
|
let recomp = eig.recompose();
|
|
|
|
|
2021-03-01 00:52:14 +08:00
|
|
|
prop_assert!(relative_eq!(m.lower_triangle(), recomp.lower_triangle(), epsilon = 1.0e-5))
|
2019-03-23 18:46:56 +08:00
|
|
|
}
|
|
|
|
|
2021-03-01 00:52:14 +08:00
|
|
|
#[test]
|
|
|
|
fn symmetric_eigen_singular(n in PROPTEST_MATRIX_DIM) {
|
2019-03-23 18:46:56 +08:00
|
|
|
let n = cmp::max(1, cmp::min(n, 10));
|
2021-03-01 00:52:14 +08:00
|
|
|
let mut m = DMatrix::<$scalar_type>::new_random(n, n).map(|e| e.0).hermitian_part();
|
2019-03-23 18:46:56 +08:00
|
|
|
m.row_mut(n / 2).fill(na::zero());
|
|
|
|
m.column_mut(n / 2).fill(na::zero());
|
|
|
|
let eig = m.clone().symmetric_eigen();
|
|
|
|
let recomp = eig.recompose();
|
|
|
|
|
2021-03-01 00:52:14 +08:00
|
|
|
prop_assert!(relative_eq!(m.lower_triangle(), recomp.lower_triangle(), epsilon = 1.0e-5))
|
2019-03-23 18:46:56 +08:00
|
|
|
}
|
|
|
|
|
2021-03-01 00:52:14 +08:00
|
|
|
#[test]
|
|
|
|
fn symmetric_eigen_static_square_4x4(m in matrix4_($scalar)) {
|
|
|
|
let m = m.hermitian_part();
|
2019-03-23 18:46:56 +08:00
|
|
|
let eig = m.symmetric_eigen();
|
|
|
|
let recomp = eig.recompose();
|
|
|
|
|
2021-03-01 00:52:14 +08:00
|
|
|
prop_assert!(relative_eq!(m.lower_triangle(), recomp.lower_triangle(), epsilon = 1.0e-5))
|
2019-03-23 18:46:56 +08:00
|
|
|
}
|
|
|
|
|
2021-03-01 00:52:14 +08:00
|
|
|
#[test]
|
|
|
|
fn symmetric_eigen_static_square_3x3(m in matrix3_($scalar)) {
|
|
|
|
let m = m.hermitian_part();
|
2019-03-23 18:46:56 +08:00
|
|
|
let eig = m.symmetric_eigen();
|
|
|
|
let recomp = eig.recompose();
|
|
|
|
|
2021-03-01 00:52:14 +08:00
|
|
|
prop_assert!(relative_eq!(m.lower_triangle(), recomp.lower_triangle(), epsilon = 1.0e-5))
|
2019-03-23 18:46:56 +08:00
|
|
|
}
|
|
|
|
|
2021-03-01 00:52:14 +08:00
|
|
|
#[test]
|
|
|
|
fn symmetric_eigen_static_square_2x2(m in matrix2_($scalar)) {
|
|
|
|
let m = m.hermitian_part();
|
2019-03-23 18:46:56 +08:00
|
|
|
let eig = m.symmetric_eigen();
|
|
|
|
let recomp = eig.recompose();
|
|
|
|
|
2021-03-01 00:52:14 +08:00
|
|
|
prop_assert!(relative_eq!(m.lower_triangle(), recomp.lower_triangle(), epsilon = 1.0e-5))
|
2019-03-23 18:46:56 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2018-01-17 23:48:47 +08:00
|
|
|
}
|
2019-03-23 18:46:56 +08:00
|
|
|
);
|
2017-08-03 01:37:44 +08:00
|
|
|
|
2021-03-01 00:52:14 +08:00
|
|
|
gen_tests!(complex, complex_f64(), RandComplex<f64>);
|
|
|
|
gen_tests!(f64, PROPTEST_F64, RandScalar<f64>);
|
2017-08-03 01:37:44 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Test proposed on the issue #176 of rulinalg.
|
|
|
|
#[test]
|
2020-06-07 15:28:39 +08:00
|
|
|
#[rustfmt::skip]
|
2017-08-03 01:37:44 +08:00
|
|
|
fn symmetric_eigen_singular_24x24() {
|
2018-10-21 04:26:44 +08:00
|
|
|
let m = DMatrix::from_row_slice(
|
|
|
|
24,
|
|
|
|
24,
|
|
|
|
&[
|
2018-10-22 13:00:10 +08:00
|
|
|
1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 0.0, 1.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
-1.0, -1.0, -1.0, -1.0, -1.0, 0.0, 1.0, 0.0, 0.0, 1.0, 1.0, 1.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, -1.0, -1.0, -1.0, -1.0, 0.0, 0.0, 0.0, 0.0, 1.0, 1.0, 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0, -1.0, -1.0, 0.0, 0.0, 0.0, 0.0, 1.0, 1.0, 1.0, 1.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, 0.0, 1.0, 1.0, 1.0,
|
|
|
|
0.0, -4.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, -4.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, -4.0, 4.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 4.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 4.0, 0.0, -4.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 0.0, 4.0, 0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 4.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 4.0, 0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 4.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -4.0, 4.0, 0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 4.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 0.0, 4.0, 0.0, 0.0, 0.0, 0.0, -4.0, 0.0, 4.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 0.0, 4.0, 0.0, 0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 4.0, 0.0, 0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -4.0, 4.0, 0.0, 0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 0.0, 4.0, 0.0, 0.0, 0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 4.0, 0.0, 0.0, 0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -4.0, 4.0, 0.0, 0.0, 0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 0.0, 4.0, 0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 0.0, 0.0, 4.0, 0.0, 0.0, 0.0, 0.0, 0.0,
|
|
|
|
0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 4.0, 0.0, 0.0, 0.0, -4.0, 0.0, 0.0, 0.0, 0.0, 4.0, 0.0, 0.0, 0.0, 0.0, 0.0
|
2018-10-21 04:26:44 +08:00
|
|
|
],
|
|
|
|
);
|
2017-08-03 01:37:44 +08:00
|
|
|
|
2017-08-14 01:52:46 +08:00
|
|
|
let eig = m.clone().symmetric_eigen();
|
2017-08-03 01:37:44 +08:00
|
|
|
let recomp = eig.recompose();
|
|
|
|
|
2019-03-20 05:53:21 +08:00
|
|
|
assert_relative_eq!(
|
2018-10-21 04:26:44 +08:00
|
|
|
m.lower_triangle(),
|
|
|
|
recomp.lower_triangle(),
|
|
|
|
epsilon = 1.0e-5
|
2019-03-20 05:53:21 +08:00
|
|
|
);
|
2019-03-18 18:23:19 +08:00
|
|
|
}
|
2017-08-03 01:37:44 +08:00
|
|
|
|
2024-03-28 22:26:11 +08:00
|
|
|
// Regression test for #1368
|
|
|
|
#[test]
|
|
|
|
fn very_small_deviation_from_identity_issue_1368() {
|
|
|
|
let m = Matrix3::<f32>::new(
|
|
|
|
1.0,
|
|
|
|
3.1575704e-23,
|
|
|
|
8.1146196e-23,
|
|
|
|
3.1575704e-23,
|
|
|
|
1.0,
|
|
|
|
1.7471054e-22,
|
|
|
|
8.1146196e-23,
|
|
|
|
1.7471054e-22,
|
|
|
|
1.0,
|
|
|
|
);
|
|
|
|
|
|
|
|
for v in m
|
|
|
|
.try_symmetric_eigen(f32::EPSILON, 0)
|
|
|
|
.unwrap()
|
|
|
|
.eigenvalues
|
|
|
|
.into_iter()
|
|
|
|
{
|
|
|
|
assert_relative_eq!(*v, 1.);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-08-03 01:37:44 +08:00
|
|
|
// #[cfg(feature = "arbitrary")]
|
|
|
|
// quickcheck! {
|
2020-11-15 23:57:49 +08:00
|
|
|
// TODO: full eigendecomposition is not implemented yet because of its complexity when some
|
2017-08-03 01:37:44 +08:00
|
|
|
// eigenvalues have multiplicity > 1.
|
|
|
|
//
|
|
|
|
// /*
|
|
|
|
// * NOTE: for the following tests, we use only upper-triangular matrices.
|
2023-02-01 14:48:06 +08:00
|
|
|
// * This ensures the schur decomposition will work, and allows use to test the eigenvector
|
2017-08-03 01:37:44 +08:00
|
|
|
// * computation.
|
|
|
|
// */
|
|
|
|
// fn eigen(n: usize) -> bool {
|
|
|
|
// let n = cmp::max(1, cmp::min(n, 10));
|
|
|
|
// let m = DMatrix::<f64>::new_random(n, n).upper_triangle();
|
|
|
|
//
|
|
|
|
// let eig = RealEigen::new(m.clone()).unwrap();
|
|
|
|
// verify_eigenvectors(m, eig)
|
|
|
|
// }
|
|
|
|
//
|
2023-02-01 14:48:06 +08:00
|
|
|
// fn eigen_with_adjacent_duplicate_diagonals(n: usize) -> bool {
|
2017-08-03 01:37:44 +08:00
|
|
|
// let n = cmp::max(1, cmp::min(n, 10));
|
|
|
|
// let mut m = DMatrix::<f64>::new_random(n, n).upper_triangle();
|
|
|
|
//
|
2023-02-01 14:48:06 +08:00
|
|
|
// // Suplicate some adjacent diagonal elements.
|
2017-08-03 01:37:44 +08:00
|
|
|
// for i in 0 .. n / 2 {
|
|
|
|
// m[(i * 2 + 1, i * 2 + 1)] = m[(i * 2, i * 2)];
|
|
|
|
// }
|
|
|
|
//
|
|
|
|
// let eig = RealEigen::new(m.clone()).unwrap();
|
|
|
|
// verify_eigenvectors(m, eig)
|
|
|
|
// }
|
|
|
|
//
|
2023-02-01 14:48:06 +08:00
|
|
|
// fn eigen_with_nonadjacent_duplicate_diagonals(n: usize) -> bool {
|
2017-08-03 01:37:44 +08:00
|
|
|
// let n = cmp::max(3, cmp::min(n, 10));
|
|
|
|
// let mut m = DMatrix::<f64>::new_random(n, n).upper_triangle();
|
|
|
|
//
|
|
|
|
// // Suplicate some diagonal elements.
|
|
|
|
// for i in n / 2 .. n {
|
|
|
|
// m[(i, i)] = m[(i - n / 2, i - n / 2)];
|
|
|
|
// }
|
|
|
|
//
|
|
|
|
// let eig = RealEigen::new(m.clone()).unwrap();
|
|
|
|
// verify_eigenvectors(m, eig)
|
|
|
|
// }
|
|
|
|
//
|
|
|
|
// fn eigen_static_square_4x4(m: Matrix4<f64>) -> bool {
|
|
|
|
// let m = m.upper_triangle();
|
|
|
|
// let eig = RealEigen::new(m.clone()).unwrap();
|
|
|
|
// verify_eigenvectors(m, eig)
|
|
|
|
// }
|
|
|
|
//
|
|
|
|
// fn eigen_static_square_3x3(m: Matrix3<f64>) -> bool {
|
|
|
|
// let m = m.upper_triangle();
|
|
|
|
// let eig = RealEigen::new(m.clone()).unwrap();
|
|
|
|
// verify_eigenvectors(m, eig)
|
|
|
|
// }
|
|
|
|
//
|
|
|
|
// fn eigen_static_square_2x2(m: Matrix2<f64>) -> bool {
|
|
|
|
// let m = m.upper_triangle();
|
|
|
|
// println!("{}", m);
|
|
|
|
// let eig = RealEigen::new(m.clone()).unwrap();
|
|
|
|
// verify_eigenvectors(m, eig)
|
|
|
|
// }
|
|
|
|
// }
|
|
|
|
//
|
2021-04-11 17:00:38 +08:00
|
|
|
// fn verify_eigenvectors<D: Dim>(m: OMatrix<f64, D>, mut eig: RealEigen<f64, D>) -> bool
|
2017-08-03 01:37:44 +08:00
|
|
|
// where DefaultAllocator: Allocator<f64, D, D> +
|
|
|
|
// Allocator<f64, D> +
|
2024-06-12 17:16:06 +08:00
|
|
|
// Allocator<D, D> +
|
|
|
|
// Allocator<D>,
|
2021-04-11 17:00:38 +08:00
|
|
|
// OMatrix<f64, D>: Display,
|
|
|
|
// OVector<f64, D>: Display {
|
2017-08-03 01:37:44 +08:00
|
|
|
// let mv = &m * &eig.eigenvectors;
|
2018-10-21 04:26:44 +08:00
|
|
|
//
|
2017-08-03 01:37:44 +08:00
|
|
|
// println!("eigenvalues: {}eigenvectors: {}", eig.eigenvalues, eig.eigenvectors);
|
2018-10-21 04:26:44 +08:00
|
|
|
//
|
2017-08-03 01:37:44 +08:00
|
|
|
// let dim = m.nrows();
|
|
|
|
// for i in 0 .. dim {
|
|
|
|
// let mut col = eig.eigenvectors.column_mut(i);
|
|
|
|
// col *= eig.eigenvalues[i];
|
|
|
|
// }
|
2018-10-21 04:26:44 +08:00
|
|
|
//
|
2017-08-03 01:37:44 +08:00
|
|
|
// println!("{}{:.5}{:.5}", m, mv, eig.eigenvectors);
|
2018-10-21 04:26:44 +08:00
|
|
|
//
|
2017-08-03 01:37:44 +08:00
|
|
|
// relative_eq!(eig.eigenvectors, mv, epsilon = 1.0e-5)
|
|
|
|
// }
|