2013-05-31 17:28:42 +08:00
|
|
|
use core::num::{One, Zero};
|
|
|
|
use core::vec::{from_elem, swap, all, all2, len};
|
|
|
|
use core::cmp::ApproxEq;
|
|
|
|
use traits::inv::Inv;
|
2013-06-01 00:35:48 +08:00
|
|
|
use traits::division_ring::DivisionRing;
|
2013-05-31 17:28:42 +08:00
|
|
|
use traits::transpose::Transpose;
|
|
|
|
use traits::workarounds::rlmul::{RMul, LMul};
|
|
|
|
use ndim::dvec::{DVec, zero_vec_with_dim};
|
|
|
|
|
|
|
|
#[deriving(Eq, ToStr, Clone)]
|
|
|
|
pub struct DMat<T>
|
|
|
|
{
|
|
|
|
dim: uint, // FIXME: handle more than just square matrices
|
|
|
|
mij: ~[T]
|
|
|
|
}
|
|
|
|
|
|
|
|
pub fn zero_mat_with_dim<T: Zero + Copy>(dim: uint) -> DMat<T>
|
|
|
|
{ DMat { dim: dim, mij: from_elem(dim * dim, Zero::zero()) } }
|
|
|
|
|
|
|
|
pub fn is_zero_mat<T: Zero>(mat: &DMat<T>) -> bool
|
|
|
|
{ all(mat.mij, |e| e.is_zero()) }
|
|
|
|
|
|
|
|
pub fn one_mat_with_dim<T: Copy + One + Zero>(dim: uint) -> DMat<T>
|
|
|
|
{
|
|
|
|
let mut res = zero_mat_with_dim(dim);
|
|
|
|
let _1 = One::one::<T>();
|
|
|
|
|
|
|
|
for uint::range(0u, dim) |i|
|
|
|
|
{ res.set(i, i, &_1); }
|
|
|
|
|
|
|
|
res
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<T: Copy> DMat<T>
|
|
|
|
{
|
|
|
|
pub fn offset(&self, i: uint, j: uint) -> uint
|
|
|
|
{ i * self.dim + j }
|
|
|
|
|
|
|
|
pub fn set(&mut self, i: uint, j: uint, t: &T)
|
|
|
|
{
|
|
|
|
assert!(i < self.dim);
|
|
|
|
assert!(j < self.dim);
|
|
|
|
self.mij[self.offset(i, j)] = *t
|
|
|
|
}
|
2013-06-01 00:35:48 +08:00
|
|
|
|
|
|
|
pub fn at(&self, i: uint, j: uint) -> T
|
|
|
|
{
|
|
|
|
assert!(i < self.dim);
|
|
|
|
assert!(j < self.dim);
|
|
|
|
self.mij[self.offset(i, j)]
|
|
|
|
}
|
2013-05-31 17:28:42 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
impl<T: Copy> Index<(uint, uint), T> for DMat<T>
|
|
|
|
{
|
|
|
|
fn index(&self, &(i, j): &(uint, uint)) -> T
|
2013-06-01 00:35:48 +08:00
|
|
|
{ self.at(i, j) }
|
2013-05-31 17:28:42 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
impl<T: Copy + Mul<T, T> + Add<T, T> + Zero>
|
|
|
|
Mul<DMat<T>, DMat<T>> for DMat<T>
|
|
|
|
{
|
|
|
|
fn mul(&self, other: &DMat<T>) -> DMat<T>
|
|
|
|
{
|
|
|
|
assert!(self.dim == other.dim);
|
|
|
|
|
|
|
|
let dim = self.dim;
|
|
|
|
let mut res = zero_mat_with_dim(dim);
|
|
|
|
|
|
|
|
for uint::range(0u, dim) |i|
|
|
|
|
{
|
|
|
|
for uint::range(0u, dim) |j|
|
|
|
|
{
|
2013-06-01 00:35:48 +08:00
|
|
|
let mut acc = Zero::zero::<T>();
|
2013-05-31 17:28:42 +08:00
|
|
|
|
|
|
|
for uint::range(0u, dim) |k|
|
2013-06-01 00:35:48 +08:00
|
|
|
{ acc += self.at(i, k) * other.at(k, j); }
|
2013-05-31 17:28:42 +08:00
|
|
|
|
|
|
|
res.set(i, j, &acc);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
res
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<T: Copy + Add<T, T> + Mul<T, T> + Zero>
|
|
|
|
RMul<DVec<T>> for DMat<T>
|
|
|
|
{
|
|
|
|
fn rmul(&self, other: &DVec<T>) -> DVec<T>
|
|
|
|
{
|
|
|
|
assert!(self.dim == len(other.at));
|
|
|
|
|
|
|
|
let dim = self.dim;
|
|
|
|
let mut res : DVec<T> = zero_vec_with_dim(dim);
|
|
|
|
|
|
|
|
for uint::range(0u, dim) |i|
|
|
|
|
{
|
|
|
|
for uint::range(0u, dim) |j|
|
2013-06-01 00:35:48 +08:00
|
|
|
{ res.at[i] = res.at[i] + other.at[j] * self.at(i, j); }
|
2013-05-31 17:28:42 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
res
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<T: Copy + Add<T, T> + Mul<T, T> + Zero>
|
|
|
|
LMul<DVec<T>> for DMat<T>
|
|
|
|
{
|
|
|
|
fn lmul(&self, other: &DVec<T>) -> DVec<T>
|
|
|
|
{
|
|
|
|
assert!(self.dim == len(other.at));
|
|
|
|
|
|
|
|
let dim = self.dim;
|
|
|
|
let mut res : DVec<T> = zero_vec_with_dim(dim);
|
|
|
|
|
|
|
|
for uint::range(0u, dim) |i|
|
|
|
|
{
|
|
|
|
for uint::range(0u, dim) |j|
|
2013-06-01 00:35:48 +08:00
|
|
|
{ res.at[i] = res.at[i] + other.at[j] * self.at(j, i); }
|
2013-05-31 17:28:42 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
res
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-06-01 00:35:48 +08:00
|
|
|
impl<T: Clone + Copy + Eq + DivisionRing>
|
2013-05-31 17:28:42 +08:00
|
|
|
Inv for DMat<T>
|
|
|
|
{
|
|
|
|
fn inverse(&self) -> DMat<T>
|
|
|
|
{
|
|
|
|
let mut res : DMat<T> = self.clone();
|
|
|
|
|
|
|
|
res.invert();
|
|
|
|
|
|
|
|
res
|
|
|
|
}
|
|
|
|
|
|
|
|
fn invert(&mut self)
|
|
|
|
{
|
|
|
|
let dim = self.dim;
|
|
|
|
let mut res = one_mat_with_dim::<T>(dim);
|
|
|
|
let _0T = Zero::zero::<T>();
|
|
|
|
|
|
|
|
// inversion using Gauss-Jordan elimination
|
|
|
|
for uint::range(0u, dim) |k|
|
|
|
|
{
|
|
|
|
// search a non-zero value on the k-th column
|
|
|
|
// FIXME: would it be worth it to spend some more time searching for the
|
|
|
|
// max instead?
|
|
|
|
|
2013-06-01 00:35:48 +08:00
|
|
|
let mut n0 = k; // index of a non-zero entry
|
2013-05-31 17:28:42 +08:00
|
|
|
|
|
|
|
while (n0 != dim)
|
|
|
|
{
|
2013-06-01 00:35:48 +08:00
|
|
|
if (self.at(n0, k) != _0T)
|
2013-05-31 17:28:42 +08:00
|
|
|
{ break; }
|
|
|
|
|
|
|
|
n0 += 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
assert!(n0 != dim); // non inversible matrix
|
|
|
|
|
|
|
|
// swap pivot line
|
|
|
|
if (n0 != k)
|
|
|
|
{
|
|
|
|
for uint::range(0u, dim) |j|
|
|
|
|
{
|
|
|
|
let off_n0_j = self.offset(n0, j);
|
|
|
|
let off_k_j = self.offset(k, j);
|
|
|
|
|
|
|
|
swap(self.mij, off_n0_j, off_k_j);
|
|
|
|
swap(res.mij, off_n0_j, off_k_j);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-06-01 00:35:48 +08:00
|
|
|
let pivot = self.at(k, k);
|
2013-05-31 17:28:42 +08:00
|
|
|
|
|
|
|
for uint::range(k, dim) |j|
|
|
|
|
{
|
2013-06-01 00:35:48 +08:00
|
|
|
let selfval = &(self.at(k, j) / pivot);
|
2013-05-31 17:28:42 +08:00
|
|
|
self.set(k, j, selfval);
|
2013-06-01 00:35:48 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
for uint::range(0u, dim) |j|
|
|
|
|
{
|
|
|
|
let resval = &(res.at(k, j) / pivot);
|
2013-05-31 17:28:42 +08:00
|
|
|
res.set(k, j, resval);
|
|
|
|
}
|
|
|
|
|
|
|
|
for uint::range(0u, dim) |l|
|
|
|
|
{
|
|
|
|
if (l != k)
|
|
|
|
{
|
2013-06-01 00:35:48 +08:00
|
|
|
let normalizer = self.at(l, k);
|
2013-05-31 17:28:42 +08:00
|
|
|
|
|
|
|
for uint::range(k, dim) |j|
|
|
|
|
{
|
2013-06-01 00:35:48 +08:00
|
|
|
let selfval = &(self.at(l, j) - self.at(k, j) * normalizer);
|
|
|
|
self.set(l, j, selfval);
|
|
|
|
}
|
2013-05-31 17:28:42 +08:00
|
|
|
|
2013-06-01 00:35:48 +08:00
|
|
|
for uint::range(0u, dim) |j|
|
|
|
|
{
|
|
|
|
let resval = &(res.at(l, j) - res.at(k, j) * normalizer);
|
|
|
|
res.set(l, j, resval);
|
2013-05-31 17:28:42 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2013-06-01 00:35:48 +08:00
|
|
|
|
|
|
|
*self = res;
|
2013-05-31 17:28:42 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<T:Copy> Transpose for DMat<T>
|
|
|
|
{
|
|
|
|
fn transposed(&self) -> DMat<T>
|
|
|
|
{
|
|
|
|
let mut res = copy *self;
|
|
|
|
|
|
|
|
res.transpose();
|
|
|
|
|
|
|
|
res
|
|
|
|
}
|
|
|
|
|
|
|
|
fn transpose(&mut self)
|
|
|
|
{
|
|
|
|
let dim = self.dim;
|
|
|
|
|
|
|
|
for uint::range(1u, dim) |i|
|
|
|
|
{
|
|
|
|
for uint::range(0u, dim - 1) |j|
|
|
|
|
{
|
|
|
|
let off_i_j = self.offset(i, j);
|
|
|
|
let off_j_i = self.offset(j, i);
|
|
|
|
|
|
|
|
swap(self.mij, off_i_j, off_j_i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<T: ApproxEq<T>> ApproxEq<T> for DMat<T>
|
|
|
|
{
|
|
|
|
fn approx_epsilon() -> T
|
|
|
|
{ ApproxEq::approx_epsilon::<T, T>() }
|
|
|
|
|
|
|
|
fn approx_eq(&self, other: &DMat<T>) -> bool
|
|
|
|
{ all2(self.mij, other.mij, |a, b| a.approx_eq(b)) }
|
|
|
|
|
|
|
|
fn approx_eq_eps(&self, other: &DMat<T>, epsilon: &T) -> bool
|
|
|
|
{ all2(self.mij, other.mij, |a, b| a.approx_eq_eps(b, epsilon)) }
|
|
|
|
}
|