#[cfg(feature = "serde-serialize")] use serde; use alga::general::Real; use num_complex::Complex; use std::cmp; use std::fmt::Display; use std::ops::MulAssign; use allocator::Allocator; use base::dimension::{Dim, DimDiff, DimSub, Dynamic, U1, U2, U3}; use base::storage::Storage; use base::{DefaultAllocator, Hessenberg, MatrixN, SquareMatrix, Unit, Vector2, Vector3, VectorN}; use constraint::{DimEq, ShapeConstraint}; use geometry::{Reflection, UnitComplex}; use linalg::householder; use linalg::RealSchur; /// Eigendecomposition of a matrix with real eigenvalues. #[cfg_attr(feature = "serde-serialize", derive(Serialize, Deserialize))] #[cfg_attr( feature = "serde-serialize", serde( bound( serialize = "DefaultAllocator: Allocator, VectorN: serde::Serialize, MatrixN: serde::Serialize" ) ) )] #[cfg_attr( feature = "serde-serialize", serde( bound( deserialize = "DefaultAllocator: Allocator, VectorN: serde::Serialize, MatrixN: serde::Deserialize<'de>" ) ) )] #[derive(Clone, Debug)] pub struct RealEigen where DefaultAllocator: Allocator + Allocator, { pub eigenvectors: MatrixN, pub eigenvalues: VectorN, } impl Copy for RealEigen where DefaultAllocator: Allocator + Allocator, MatrixN: Copy, VectorN: Copy, { } impl RealEigen where D: DimSub, // For Hessenberg. ShapeConstraint: DimEq>, // For Hessenberg. DefaultAllocator: Allocator> + Allocator> + Allocator + Allocator, // XXX: for debug DefaultAllocator: Allocator, MatrixN: Display, { /// Computes the eigendecomposition of a diagonalizable matrix with real eigenvalues. pub fn new(m: MatrixN) -> Option> { assert!( m.is_square(), "Unable to compute the eigendecomposition of a non-square matrix." ); let dim = m.nrows(); let (mut eigenvectors, mut eigenvalues) = RealSchur::new(m, 0).unwrap().unpack(); println!("Schur eigenvalues: {}", eigenvalues); // Check that the eigenvalues are all real. for i in 0..dim - 1 { if !eigenvalues[(i + 1, i)].is_zero() { return None; } } for j in 1..dim { for i in 0..j { let diff = eigenvalues[(i, i)] - eigenvalues[(j, j)]; if diff.is_zero() && !eigenvalues[(i, j)].is_zero() { return None; } let z = -eigenvalues[(i, j)] / diff; for k in j + 1..dim { eigenvalues[(i, k)] -= z * eigenvalues[(j, k)]; } for k in 0..dim { eigenvectors[(k, j)] += z * eigenvectors[(k, i)]; } } } // Normalize the eigenvector basis. for i in 0..dim { let _ = eigenvectors.column_mut(i).normalize_mut(); } Some(RealEigen { eigenvectors: eigenvectors, eigenvalues: eigenvalues.diagonal(), }) } }