|
1 | | -use super::Orthogonalizer; |
2 | | -use crate::types::*; |
3 | | -use ndarray::*; |
| 1 | +use super::*; |
4 | 2 |
|
5 | | -pub struct Arnoldi<S, F, Ortho> |
| 3 | +pub struct Arnoldi<A, S, F, Ortho> |
6 | 4 | where |
7 | | - S: DataMut, |
| 5 | + A: Scalar, |
| 6 | + S: DataMut<Elem = A>, |
8 | 7 | F: Fn(&mut ArrayBase<S, Ix1>), |
9 | | - Ortho: Orthogonalizer, |
| 8 | + Ortho: Orthogonalizer<Elem = A>, |
10 | 9 | { |
11 | 10 | a: F, |
12 | 11 | v: ArrayBase<S, Ix1>, |
13 | 12 | ortho: Ortho, |
14 | 13 | } |
15 | 14 |
|
16 | | -impl<S, F, Ortho> Arnoldi<S, F, Ortho> |
| 15 | +impl<A, S, F, Ortho> Arnoldi<A, S, F, Ortho> |
17 | 16 | where |
18 | | - S: DataMut, |
| 17 | + A: Scalar, |
| 18 | + S: DataMut<Elem = A>, |
19 | 19 | F: Fn(&mut ArrayBase<S, Ix1>), |
20 | | - Ortho: Orthogonalizer, |
| 20 | + Ortho: Orthogonalizer<Elem = A>, |
21 | 21 | { |
22 | 22 | pub fn new(a: F, v: ArrayBase<S, Ix1>, ortho: Ortho) -> Self { |
23 | 23 | Arnoldi { a, v, ortho } |
24 | 24 | } |
25 | 25 | } |
26 | 26 |
|
27 | | -impl<A, S, F, Ortho> Iterator for Arnoldi<S, F, Ortho> |
| 27 | +impl<A, S, F, Ortho> Iterator for Arnoldi<A, S, F, Ortho> |
28 | 28 | where |
29 | 29 | A: Scalar, |
30 | | - S: DataMut<Elem = A>, |
| 30 | + S: DataMut<Elem = A> + DataClone, |
31 | 31 | F: Fn(&mut ArrayBase<S, Ix1>), |
32 | 32 | Ortho: Orthogonalizer<Elem = A>, |
33 | 33 | { |
34 | | - type Item = (Array2<A>, Array2<A>); |
| 34 | + type Item = Array1<A>; |
35 | 35 |
|
36 | 36 | fn next(&mut self) -> Option<Self::Item> { |
37 | 37 | (self.a)(&mut self.v); |
38 | | - let coef = self.ortho.decompose(&mut self.v); |
39 | | - unimplemented!() |
| 38 | + match self.ortho.div_append(&mut self.v) { |
| 39 | + AppendResult::Added(coef) => { |
| 40 | + let norm = coef[coef.len() - 1].abs(); |
| 41 | + azip!(mut a(&mut self.v) in { *a = a.div_real(norm) }); |
| 42 | + Some(coef) |
| 43 | + } |
| 44 | + AppendResult::Dependent(_) => None, |
| 45 | + } |
40 | 46 | } |
41 | 47 | } |
0 commit comments