1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128

//! Methods for triangular matrices

use ndarray::*;
use num_traits::Zero;

use super::layout::*;
use super::error::*;
use super::lapack_traits::*;

pub use super::lapack_traits::Diag;

/// solve a triangular system with upper triangular matrix
pub trait SolveTriangular<Rhs> {
    type Output;
    fn solve_triangular(&self, UPLO, Diag, Rhs) -> Result<Self::Output>;
}

impl<A, Si, So> SolveTriangular<ArrayBase<So, Ix2>> for ArrayBase<Si, Ix2>
    where A: LapackScalar + Copy,
          Si: Data<Elem = A>,
          So: DataMut<Elem = A> + DataOwned
{
    type Output = ArrayBase<So, Ix2>;

    fn solve_triangular(&self, uplo: UPLO, diag: Diag, mut b: ArrayBase<So, Ix2>) -> Result<Self::Output> {
        self.solve_triangular(uplo, diag, &mut b)?;
        Ok(b)
    }
}

impl<'a, A, Si, So> SolveTriangular<&'a mut ArrayBase<So, Ix2>> for ArrayBase<Si, Ix2>
    where A: LapackScalar + Copy,
          Si: Data<Elem = A>,
          So: DataMut<Elem = A> + DataOwned
{
    type Output = &'a mut ArrayBase<So, Ix2>;

    fn solve_triangular(&self, uplo: UPLO, diag: Diag, mut b: &'a mut ArrayBase<So, Ix2>) -> Result<Self::Output> {
        let la = self.layout()?;
        let a_ = self.as_allocated()?;
        let lb = b.layout()?;
        if !la.same_order(&lb) {
            data_transpose(b)?;
        }
        let lb = b.layout()?;
        A::solve_triangular(la, lb, uplo, diag, a_, b.as_allocated_mut()?)?;
        Ok(b)
    }
}

impl<'a, A, Si, So> SolveTriangular<&'a ArrayBase<So, Ix2>> for ArrayBase<Si, Ix2>
    where A: LapackScalar + Copy,
          Si: Data<Elem = A>,
          So: DataMut<Elem = A> + DataOwned
{
    type Output = ArrayBase<So, Ix2>;

    fn solve_triangular(&self, uplo: UPLO, diag: Diag, b: &'a ArrayBase<So, Ix2>) -> Result<Self::Output> {
        let b = replicate(b);
        self.solve_triangular(uplo, diag, b)
    }
}

impl<A, Si, So> SolveTriangular<ArrayBase<So, Ix1>> for ArrayBase<Si, Ix2>
    where A: LapackScalar + Copy,
          Si: Data<Elem = A>,
          So: DataMut<Elem = A> + DataOwned
{
    type Output = ArrayBase<So, Ix1>;

    fn solve_triangular(&self, uplo: UPLO, diag: Diag, b: ArrayBase<So, Ix1>) -> Result<Self::Output> {
        let b = into_col_vec(b);
        let b = self.solve_triangular(uplo, diag, b)?;
        Ok(into_vec(b))
    }
}

impl<'a, A, Si, So> SolveTriangular<&'a ArrayBase<So, Ix1>> for ArrayBase<Si, Ix2>
    where A: LapackScalar + Copy,
          Si: Data<Elem = A>,
          So: DataMut<Elem = A> + DataOwned
{
    type Output = ArrayBase<So, Ix1>;

    fn solve_triangular(&self, uplo: UPLO, diag: Diag, b: &'a ArrayBase<So, Ix1>) -> Result<Self::Output> {
        let b = replicate(b);
        self.solve_triangular(uplo, diag, b)
    }
}

pub trait IntoTriangular<T> {
    fn into_triangular(self, UPLO) -> T;
}

impl<'a, A, S> IntoTriangular<&'a mut ArrayBase<S, Ix2>> for &'a mut ArrayBase<S, Ix2>
    where A: Zero,
          S: DataMut<Elem = A>
{
    fn into_triangular(self, uplo: UPLO) -> &'a mut ArrayBase<S, Ix2> {
        match uplo {
            UPLO::Upper => {
                for ((i, j), val) in self.indexed_iter_mut() {
                    if i > j {
                        *val = A::zero();
                    }
                }
            }
            UPLO::Lower => {
                for ((i, j), val) in self.indexed_iter_mut() {
                    if i < j {
                        *val = A::zero();
                    }
                }
            }
        }
        self
    }
}

impl<A, S> IntoTriangular<ArrayBase<S, Ix2>> for ArrayBase<S, Ix2>
    where A: Zero,
          S: DataMut<Elem = A>
{
    fn into_triangular(mut self, uplo: UPLO) -> ArrayBase<S, Ix2> {
        (&mut self).into_triangular(uplo);
        self
    }
}