cargo fmt + tests
This commit is contained in:
Sébastien Crozet
parent
9c8b5f0f38
commit
e32f4ee16f
|
|
@ -1,31 +0,0 @@
|
|||
extern crate nalgebra as na;
|
||||
extern crate nalgebra_lapack;
|
||||
#[macro_use]
|
||||
extern crate approx; // for assert_relative_eq
|
||||
|
||||
use na::Matrix3;
|
||||
use nalgebra_lapack::Eigen;
|
||||
use num_complex::Complex;
|
||||
|
||||
//Matrix taken from https://textbooks.math.gatech.edu/ila/1553/complex-eigenvalues.html
|
||||
fn main() {
|
||||
let m = Matrix3::<f64>::new(4.0/5.0, -3.0/5.0, 0.0, 3.0/5.0, 4.0/5.0, 0.0, 1.0, 2.0, 2.0);
|
||||
let eigen = Eigen::new(m,true,true).expect("Eigen Creation Failed!");
|
||||
let (some_eigenvalues, some_left_vec, some_right_vec) = eigen.get_complex_elements();
|
||||
let eigenvalues = some_eigenvalues.expect("Eigenvalues Failed");
|
||||
let _left_eigenvectors = some_left_vec.expect("Left Eigenvectors Failed");
|
||||
let eigenvectors = some_right_vec.expect("Right Eigenvectors Failed");
|
||||
|
||||
assert_relative_eq!(eigenvalues[0].re, Complex::<f64>::new(4.0/5.0,3.0/5.0).re);
|
||||
assert_relative_eq!(eigenvalues[0].im, Complex::<f64>::new(4.0/5.0,3.0/5.0).im);
|
||||
assert_relative_eq!(eigenvalues[1].re, Complex::<f64>::new(4.0/5.0,-3.0/5.0).re);
|
||||
assert_relative_eq!(eigenvalues[1].im, Complex::<f64>::new(4.0/5.0,-3.0/5.0).im);
|
||||
|
||||
|
||||
assert_relative_eq!(eigenvectors[0][0].re, -12.0/32.7871926215100059134410999);
|
||||
assert_relative_eq!(eigenvectors[0][0].im, -9.0/32.7871926215100059134410999);
|
||||
assert_relative_eq!(eigenvectors[0][1].re, -9.0/32.7871926215100059134410999);
|
||||
assert_relative_eq!(eigenvectors[0][1].im, 12.0/32.7871926215100059134410999);
|
||||
assert_relative_eq!(eigenvectors[0][2].re, 25.0/32.7871926215100059134410999);
|
||||
assert_relative_eq!(eigenvectors[0][2].im, 0.0);
|
||||
}
|
||||
|
|
@ -8,7 +8,7 @@ use simba::scalar::RealField;
|
|||
|
||||
use crate::ComplexHelper;
|
||||
use na::dimension::{Const, Dim};
|
||||
use na::{DefaultAllocator, Matrix, OMatrix, OVector, Scalar, allocator::Allocator};
|
||||
use na::{allocator::Allocator, DefaultAllocator, Matrix, OMatrix, OVector, Scalar};
|
||||
|
||||
use lapack;
|
||||
|
||||
|
|
@ -147,7 +147,7 @@ where
|
|||
eigenvalues_re: wr,
|
||||
eigenvalues_im: wi,
|
||||
left_eigenvectors: vl,
|
||||
eigenvectors: vr
|
||||
eigenvectors: vr,
|
||||
})
|
||||
}
|
||||
|
||||
|
|
@ -168,103 +168,169 @@ where
|
|||
det
|
||||
}
|
||||
|
||||
/// Returns a tuple of vectors. The elements of the tuple are the real parts of the eigenvalues, left eigenvectors and right eigenvectors respectively.
|
||||
pub fn get_real_elements(&self) -> (Vec<T>, Option<Vec<OVector<T, D>>>, Option<Vec<OVector<T, D>>>) where DefaultAllocator: Allocator<T, D> {
|
||||
/// Returns a tuple of vectors. The elements of the tuple are the real parts of the eigenvalues, left eigenvectors and right eigenvectors respectively.
|
||||
pub fn get_real_elements(
|
||||
&self,
|
||||
) -> (
|
||||
Vec<T>,
|
||||
Option<Vec<OVector<T, D>>>,
|
||||
Option<Vec<OVector<T, D>>>,
|
||||
)
|
||||
where
|
||||
DefaultAllocator: Allocator<T, D>,
|
||||
{
|
||||
let (number_of_elements, _) = self.eigenvalues_re.shape_generic();
|
||||
let number_of_elements_value = number_of_elements.value();
|
||||
let mut eigenvalues = Vec::<T>::with_capacity(number_of_elements_value);
|
||||
let mut eigenvectors = match self.eigenvectors.is_some() {
|
||||
true => Some(Vec::<OVector<T, D>>::with_capacity(number_of_elements_value)),
|
||||
false => None
|
||||
true => Some(Vec::<OVector<T, D>>::with_capacity(
|
||||
number_of_elements_value,
|
||||
)),
|
||||
false => None,
|
||||
};
|
||||
let mut left_eigenvectors = match self.left_eigenvectors.is_some() {
|
||||
true => Some(Vec::<OVector<T, D>>::with_capacity(number_of_elements_value)),
|
||||
false => None
|
||||
true => Some(Vec::<OVector<T, D>>::with_capacity(
|
||||
number_of_elements_value,
|
||||
)),
|
||||
false => None,
|
||||
};
|
||||
|
||||
|
||||
let mut c = 0;
|
||||
while c < number_of_elements_value {
|
||||
eigenvalues.push(self.eigenvalues_re[c].clone());
|
||||
|
||||
if eigenvectors.is_some() {
|
||||
eigenvectors.as_mut().unwrap().push((&self.eigenvectors.as_ref()).unwrap().column(c).into_owned());
|
||||
eigenvectors.as_mut().unwrap().push(
|
||||
(&self.eigenvectors.as_ref())
|
||||
.unwrap()
|
||||
.column(c)
|
||||
.into_owned(),
|
||||
);
|
||||
}
|
||||
|
||||
if left_eigenvectors.is_some() {
|
||||
left_eigenvectors.as_mut().unwrap().push((&self.left_eigenvectors.as_ref()).unwrap().column(c).into_owned());
|
||||
left_eigenvectors.as_mut().unwrap().push(
|
||||
(&self.left_eigenvectors.as_ref())
|
||||
.unwrap()
|
||||
.column(c)
|
||||
.into_owned(),
|
||||
);
|
||||
}
|
||||
if self.eigenvalues_im[c] != T::zero() {
|
||||
//skip next entry
|
||||
c += 1;
|
||||
}
|
||||
c+=1;
|
||||
c += 1;
|
||||
}
|
||||
(eigenvalues, left_eigenvectors, eigenvectors)
|
||||
|
||||
|
||||
}
|
||||
|
||||
/// Returns a tuple of vectors. The elements of the tuple are the complex eigenvalues, complex left eigenvectors and complex right eigenvectors respectively.
|
||||
/// Returns a tuple of vectors. The elements of the tuple are the complex eigenvalues, complex left eigenvectors and complex right eigenvectors respectively.
|
||||
/// The elements appear as conjugate pairs within each vector, with the positive of the pair always being first.
|
||||
pub fn get_complex_elements(&self) -> (Option<Vec<Complex<T>>>, Option<Vec<OVector<Complex<T>, D>>>, Option<Vec<OVector<Complex<T>, D>>>) where DefaultAllocator: Allocator<Complex<T>, D> {
|
||||
pub fn get_complex_elements(
|
||||
&self,
|
||||
) -> (
|
||||
Option<Vec<Complex<T>>>,
|
||||
Option<Vec<OVector<Complex<T>, D>>>,
|
||||
Option<Vec<OVector<Complex<T>, D>>>,
|
||||
)
|
||||
where
|
||||
DefaultAllocator: Allocator<Complex<T>, D>,
|
||||
{
|
||||
match self.eigenvalues_are_real() {
|
||||
true => (None, None, None),
|
||||
false => {
|
||||
let (number_of_elements, _) = self.eigenvalues_re.shape_generic();
|
||||
let number_of_elements_value = number_of_elements.value();
|
||||
let number_of_complex_entries = self.eigenvalues_im.iter().fold(0, |acc, e| if !e.is_zero() {acc + 1} else {acc});
|
||||
let number_of_complex_entries =
|
||||
self.eigenvalues_im
|
||||
.iter()
|
||||
.fold(0, |acc, e| if !e.is_zero() { acc + 1 } else { acc });
|
||||
let mut eigenvalues = Vec::<Complex<T>>::with_capacity(number_of_complex_entries);
|
||||
let mut eigenvectors = match self.eigenvectors.is_some() {
|
||||
true => Some(Vec::<OVector<Complex<T>, D>>::with_capacity(number_of_complex_entries)),
|
||||
false => None
|
||||
true => Some(Vec::<OVector<Complex<T>, D>>::with_capacity(
|
||||
number_of_complex_entries,
|
||||
)),
|
||||
false => None,
|
||||
};
|
||||
let mut left_eigenvectors = match self.left_eigenvectors.is_some() {
|
||||
true => Some(Vec::<OVector<Complex<T>, D>>::with_capacity(number_of_complex_entries)),
|
||||
false => None
|
||||
true => Some(Vec::<OVector<Complex<T>, D>>::with_capacity(
|
||||
number_of_complex_entries,
|
||||
)),
|
||||
false => None,
|
||||
};
|
||||
|
||||
|
||||
let mut c = 0;
|
||||
while c < number_of_elements_value {
|
||||
if self.eigenvalues_im[c] != T::zero() {
|
||||
//Complex conjugate pairs of eigenvalues appear consecutively with the eigenvalue having the positive imaginary part first.
|
||||
eigenvalues.push(Complex::<T>::new(self.eigenvalues_re[c].clone(), self.eigenvalues_im[c].clone()));
|
||||
eigenvalues.push(Complex::<T>::new(self.eigenvalues_re[c+1].clone(), self.eigenvalues_im[c+1].clone()));
|
||||
eigenvalues.push(Complex::<T>::new(
|
||||
self.eigenvalues_re[c].clone(),
|
||||
self.eigenvalues_im[c].clone(),
|
||||
));
|
||||
eigenvalues.push(Complex::<T>::new(
|
||||
self.eigenvalues_re[c + 1].clone(),
|
||||
self.eigenvalues_im[c + 1].clone(),
|
||||
));
|
||||
|
||||
if eigenvectors.is_some() {
|
||||
let mut vec = OVector::<Complex<T>, D>::zeros_generic(number_of_elements, Const::<1>);
|
||||
let mut vec_conj = OVector::<Complex<T>, D>::zeros_generic(number_of_elements, Const::<1>);
|
||||
let mut vec = OVector::<Complex<T>, D>::zeros_generic(
|
||||
number_of_elements,
|
||||
Const::<1>,
|
||||
);
|
||||
let mut vec_conj = OVector::<Complex<T>, D>::zeros_generic(
|
||||
number_of_elements,
|
||||
Const::<1>,
|
||||
);
|
||||
|
||||
for r in 0..number_of_elements_value {
|
||||
vec[r] = Complex::<T>::new((&self.eigenvectors.as_ref()).unwrap()[(r,c)].clone(),(&self.eigenvectors.as_ref()).unwrap()[(r,c+1)].clone());
|
||||
vec_conj[r] = Complex::<T>::new((&self.eigenvectors.as_ref()).unwrap()[(r,c)].clone(),(&self.eigenvectors.as_ref()).unwrap()[(r,c+1)].clone());
|
||||
vec[r] = Complex::<T>::new(
|
||||
(&self.eigenvectors.as_ref()).unwrap()[(r, c)].clone(),
|
||||
(&self.eigenvectors.as_ref()).unwrap()[(r, c + 1)].clone(),
|
||||
);
|
||||
vec_conj[r] = Complex::<T>::new(
|
||||
(&self.eigenvectors.as_ref()).unwrap()[(r, c)].clone(),
|
||||
(&self.eigenvectors.as_ref()).unwrap()[(r, c + 1)].clone(),
|
||||
);
|
||||
}
|
||||
|
||||
|
||||
eigenvectors.as_mut().unwrap().push(vec);
|
||||
eigenvectors.as_mut().unwrap().push(vec_conj);
|
||||
}
|
||||
|
||||
if left_eigenvectors.is_some() {
|
||||
let mut vec = OVector::<Complex<T>, D>::zeros_generic(number_of_elements, Const::<1>);
|
||||
let mut vec_conj = OVector::<Complex<T>, D>::zeros_generic(number_of_elements, Const::<1>);
|
||||
let mut vec = OVector::<Complex<T>, D>::zeros_generic(
|
||||
number_of_elements,
|
||||
Const::<1>,
|
||||
);
|
||||
let mut vec_conj = OVector::<Complex<T>, D>::zeros_generic(
|
||||
number_of_elements,
|
||||
Const::<1>,
|
||||
);
|
||||
|
||||
for r in 0..number_of_elements_value {
|
||||
vec[r] = Complex::<T>::new((&self.left_eigenvectors.as_ref()).unwrap()[(r,c)].clone(),(&self.left_eigenvectors.as_ref()).unwrap()[(r,c+1)].clone());
|
||||
vec_conj[r] = Complex::<T>::new((&self.left_eigenvectors.as_ref()).unwrap()[(r,c)].clone(),(&self.left_eigenvectors.as_ref()).unwrap()[(r,c+1)].clone());
|
||||
vec[r] = Complex::<T>::new(
|
||||
(&self.left_eigenvectors.as_ref()).unwrap()[(r, c)].clone(),
|
||||
(&self.left_eigenvectors.as_ref()).unwrap()[(r, c + 1)].clone(),
|
||||
);
|
||||
vec_conj[r] = Complex::<T>::new(
|
||||
(&self.left_eigenvectors.as_ref()).unwrap()[(r, c)].clone(),
|
||||
(&self.left_eigenvectors.as_ref()).unwrap()[(r, c + 1)].clone(),
|
||||
);
|
||||
}
|
||||
|
||||
|
||||
left_eigenvectors.as_mut().unwrap().push(vec);
|
||||
left_eigenvectors.as_mut().unwrap().push(vec_conj);
|
||||
}
|
||||
//skip next entry
|
||||
c += 1;
|
||||
}
|
||||
c+=1;
|
||||
c += 1;
|
||||
}
|
||||
(Some(eigenvalues), left_eigenvectors, eigenvectors)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
/*
|
||||
|
|
|
|||
|
|
@ -58,8 +58,8 @@ proptest! {
|
|||
let sol1 = chol.solve(&b1).unwrap();
|
||||
let sol2 = chol.solve(&b2).unwrap();
|
||||
|
||||
prop_assert!(relative_eq!(m * sol1, b1, epsilon = 1.0e-7));
|
||||
prop_assert!(relative_eq!(m * sol2, b2, epsilon = 1.0e-7));
|
||||
prop_assert!(relative_eq!(m * sol1, b1, epsilon = 1.0e-4));
|
||||
prop_assert!(relative_eq!(m * sol2, b2, epsilon = 1.0e-4));
|
||||
}
|
||||
}
|
||||
|
||||
|
|
@ -84,7 +84,7 @@ proptest! {
|
|||
let id1 = &m * &m1;
|
||||
let id2 = &m1 * &m;
|
||||
|
||||
prop_assert!(id1.is_identity(1.0e-5) && id2.is_identity(1.0e-5))
|
||||
prop_assert!(id1.is_identity(1.0e-4) && id2.is_identity(1.0e-4))
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,19 +1,47 @@
|
|||
use std::cmp;
|
||||
|
||||
use na::{Matrix3};
|
||||
use na::Matrix3;
|
||||
use nalgebra_lapack::Eigen;
|
||||
use num_complex::Complex;
|
||||
|
||||
use crate::proptest::*;
|
||||
use proptest::{prop_assert, proptest};
|
||||
#[test]
|
||||
fn complex_eigen() {
|
||||
let m = Matrix3::<f64>::new(
|
||||
4.0 / 5.0,
|
||||
-3.0 / 5.0,
|
||||
0.0,
|
||||
3.0 / 5.0,
|
||||
4.0 / 5.0,
|
||||
0.0,
|
||||
1.0,
|
||||
2.0,
|
||||
2.0,
|
||||
);
|
||||
let eigen = Eigen::new(m, true, true).expect("Eigen Creation Failed!");
|
||||
let (some_eigenvalues, some_left_vec, some_right_vec) = eigen.get_complex_elements();
|
||||
let eigenvalues = some_eigenvalues.expect("Eigenvalues Failed");
|
||||
let _left_eigenvectors = some_left_vec.expect("Left Eigenvectors Failed");
|
||||
let eigenvectors = some_right_vec.expect("Right Eigenvectors Failed");
|
||||
|
||||
proptest! {
|
||||
//#[test]
|
||||
// fn complex_eigen() {
|
||||
// let n = cmp::max(1, cmp::min(n, 10));
|
||||
// let m = DMatrix::<f64>::new_random(n, n);
|
||||
// let eig = SymmetricEigen::new(m.clone());
|
||||
// let recomp = eig.recompose();
|
||||
// prop_assert!(relative_eq!(m.lower_triangle(), recomp.lower_triangle(), epsilon = 1.0e-5))
|
||||
// }
|
||||
assert_relative_eq!(
|
||||
eigenvalues[0].re,
|
||||
Complex::<f64>::new(4.0 / 5.0, 3.0 / 5.0).re
|
||||
);
|
||||
assert_relative_eq!(
|
||||
eigenvalues[0].im,
|
||||
Complex::<f64>::new(4.0 / 5.0, 3.0 / 5.0).im
|
||||
);
|
||||
assert_relative_eq!(
|
||||
eigenvalues[1].re,
|
||||
Complex::<f64>::new(4.0 / 5.0, -3.0 / 5.0).re
|
||||
);
|
||||
assert_relative_eq!(
|
||||
eigenvalues[1].im,
|
||||
Complex::<f64>::new(4.0 / 5.0, -3.0 / 5.0).im
|
||||
);
|
||||
|
||||
assert_relative_eq!(eigenvectors[0][0].re, -12.0 / 32.7871926215100059134410999);
|
||||
assert_relative_eq!(eigenvectors[0][0].im, -9.0 / 32.7871926215100059134410999);
|
||||
assert_relative_eq!(eigenvectors[0][1].re, -9.0 / 32.7871926215100059134410999);
|
||||
assert_relative_eq!(eigenvectors[0][1].im, 12.0 / 32.7871926215100059134410999);
|
||||
assert_relative_eq!(eigenvectors[0][2].re, 25.0 / 32.7871926215100059134410999);
|
||||
assert_relative_eq!(eigenvectors[0][2].im, 0.0);
|
||||
}
|
||||
|
|
|
|||
|
|
@ -51,10 +51,10 @@ proptest! {
|
|||
let tr_sol1 = lup.solve_transpose(&b1).unwrap();
|
||||
let tr_sol2 = lup.solve_transpose(&b2).unwrap();
|
||||
|
||||
prop_assert!(relative_eq!(&m * sol1, b1, epsilon = 1.0e-7));
|
||||
prop_assert!(relative_eq!(&m * sol2, b2, epsilon = 1.0e-7));
|
||||
prop_assert!(relative_eq!(m.transpose() * tr_sol1, b1, epsilon = 1.0e-7));
|
||||
prop_assert!(relative_eq!(m.transpose() * tr_sol2, b2, epsilon = 1.0e-7));
|
||||
prop_assert!(relative_eq!(&m * sol1, b1, epsilon = 1.0e-5));
|
||||
prop_assert!(relative_eq!(&m * sol2, b2, epsilon = 1.0e-5));
|
||||
prop_assert!(relative_eq!(m.transpose() * tr_sol1, b1, epsilon = 1.0e-5));
|
||||
prop_assert!(relative_eq!(m.transpose() * tr_sol2, b2, epsilon = 1.0e-5));
|
||||
}
|
||||
|
||||
#[test]
|
||||
|
|
@ -68,10 +68,10 @@ proptest! {
|
|||
let tr_sol1 = lup.solve_transpose(&b1).unwrap();
|
||||
let tr_sol2 = lup.solve_transpose(&b2).unwrap();
|
||||
|
||||
prop_assert!(relative_eq!(m * sol1, b1, epsilon = 1.0e-7));
|
||||
prop_assert!(relative_eq!(m * sol2, b2, epsilon = 1.0e-7));
|
||||
prop_assert!(relative_eq!(m.transpose() * tr_sol1, b1, epsilon = 1.0e-7));
|
||||
prop_assert!(relative_eq!(m.transpose() * tr_sol2, b2, epsilon = 1.0e-7));
|
||||
prop_assert!(relative_eq!(m * sol1, b1, epsilon = 1.0e-5));
|
||||
prop_assert!(relative_eq!(m * sol2, b2, epsilon = 1.0e-5));
|
||||
prop_assert!(relative_eq!(m.transpose() * tr_sol1, b1, epsilon = 1.0e-5));
|
||||
prop_assert!(relative_eq!(m.transpose() * tr_sol2, b2, epsilon = 1.0e-5));
|
||||
}
|
||||
|
||||
#[test]
|
||||
|
|
|
|||
|
|
@ -1,4 +1,5 @@
|
|||
mod cholesky;
|
||||
mod complex_eigen;
|
||||
mod generalized_eigenvalues;
|
||||
mod lu;
|
||||
mod qr;
|
||||
|
|
@ -7,4 +8,3 @@ mod real_eigensystem;
|
|||
mod schur;
|
||||
mod svd;
|
||||
mod symmetric_eigen;
|
||||
mod complex_eigen;
|
||||
|
|
|
|||
|
|
@ -13,30 +13,36 @@ proptest! {
|
|||
let m = DMatrix::<f64>::new_random(n, n);
|
||||
|
||||
if let Some(eig) = Eigen::new(m.clone(), true, true) {
|
||||
let eigvals = DMatrix::from_diagonal(&eig.eigenvalues);
|
||||
let transformed_eigvectors = &m * eig.eigenvectors.as_ref().unwrap();
|
||||
let scaled_eigvectors = eig.eigenvectors.as_ref().unwrap() * &eigvals;
|
||||
// TODO: test the complex case too.
|
||||
if eig.eigenvalues_are_real() {
|
||||
let eigvals = DMatrix::from_diagonal(&eig.eigenvalues_re);
|
||||
let transformed_eigvectors = &m * eig.eigenvectors.as_ref().unwrap();
|
||||
let scaled_eigvectors = eig.eigenvectors.as_ref().unwrap() * &eigvals;
|
||||
|
||||
let transformed_left_eigvectors = m.transpose() * eig.left_eigenvectors.as_ref().unwrap();
|
||||
let scaled_left_eigvectors = eig.left_eigenvectors.as_ref().unwrap() * &eigvals;
|
||||
let transformed_left_eigvectors = m.transpose() * eig.left_eigenvectors.as_ref().unwrap();
|
||||
let scaled_left_eigvectors = eig.left_eigenvectors.as_ref().unwrap() * &eigvals;
|
||||
|
||||
prop_assert!(relative_eq!(transformed_eigvectors, scaled_eigvectors, epsilon = 1.0e-7));
|
||||
prop_assert!(relative_eq!(transformed_left_eigvectors, scaled_left_eigvectors, epsilon = 1.0e-7));
|
||||
prop_assert!(relative_eq!(transformed_eigvectors, scaled_eigvectors, epsilon = 1.0e-5));
|
||||
prop_assert!(relative_eq!(transformed_left_eigvectors, scaled_left_eigvectors, epsilon = 1.0e-5));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn eigensystem_static(m in matrix4()) {
|
||||
if let Some(eig) = Eigen::new(m, true, true) {
|
||||
let eigvals = Matrix4::from_diagonal(&eig.eigenvalues);
|
||||
let transformed_eigvectors = m * eig.eigenvectors.unwrap();
|
||||
let scaled_eigvectors = eig.eigenvectors.unwrap() * eigvals;
|
||||
// TODO: test the complex case too.
|
||||
if eig.eigenvalues_are_real() {
|
||||
let eigvals = Matrix4::from_diagonal(&eig.eigenvalues_re);
|
||||
let transformed_eigvectors = m * eig.eigenvectors.unwrap();
|
||||
let scaled_eigvectors = eig.eigenvectors.unwrap() * eigvals;
|
||||
|
||||
let transformed_left_eigvectors = m.transpose() * eig.left_eigenvectors.unwrap();
|
||||
let scaled_left_eigvectors = eig.left_eigenvectors.unwrap() * eigvals;
|
||||
let transformed_left_eigvectors = m.transpose() * eig.left_eigenvectors.unwrap();
|
||||
let scaled_left_eigvectors = eig.left_eigenvectors.unwrap() * eigvals;
|
||||
|
||||
prop_assert!(relative_eq!(transformed_eigvectors, scaled_eigvectors, epsilon = 1.0e-7));
|
||||
prop_assert!(relative_eq!(transformed_left_eigvectors, scaled_left_eigvectors, epsilon = 1.0e-7));
|
||||
prop_assert!(relative_eq!(transformed_eigvectors, scaled_eigvectors, epsilon = 1.0e-5));
|
||||
prop_assert!(relative_eq!(transformed_left_eigvectors, scaled_left_eigvectors, epsilon = 1.0e-5));
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
|
|||
|
|
@ -11,14 +11,17 @@ proptest! {
|
|||
let n = cmp::max(1, cmp::min(n, 10));
|
||||
let m = DMatrix::<f64>::new_random(n, n);
|
||||
|
||||
let (vecs, vals) = Schur::new(m.clone()).unpack();
|
||||
|
||||
prop_assert!(relative_eq!(&vecs * vals * vecs.transpose(), m, epsilon = 1.0e-7))
|
||||
if let Some(schur) = Schur::try_new(m.clone()) {
|
||||
let (vecs, vals) = schur.unpack();
|
||||
prop_assert!(relative_eq!(&vecs * vals * vecs.transpose(), m, epsilon = 1.0e-5))
|
||||
}
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn schur_static(m in matrix4()) {
|
||||
let (vecs, vals) = Schur::new(m.clone()).unpack();
|
||||
prop_assert!(relative_eq!(vecs * vals * vecs.transpose(), m, epsilon = 1.0e-7))
|
||||
if let Some(schur) = Schur::try_new(m.clone()) {
|
||||
let (vecs, vals) = schur.unpack();
|
||||
prop_assert!(relative_eq!(vecs * vals * vecs.transpose(), m, epsilon = 1.0e-5))
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
|
|||
Loading…
Reference in New Issue