mdarray-linalg-faer 0.1.2

Faer backend for mdarray-linalg
Documentation
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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
// Eigenvalue Decomposition:
//     A * V = V * Λ  (right eigenvectors)
//     W^H * A = Λ * W^H  (left eigenvectors)
// where:
//     - A is n × n         (input square matrix)
//     - V is n × n         (right eigenvectors as columns)
//     - W is n × n         (left eigenvectors as columns)
//     - Λ is n × n         (diagonal matrix with eigenvalues)
//
// For Hermitian/Symmetric matrices:
//     A = Q * Λ * Q^H
// where:
//     - Q is n × n         (orthogonal/unitary eigenvectors)
//     - Λ is n × n         (diagonal matrix with real eigenvalues)
//
// Schur Decomposition:
//     A = Z * T * Z^H
// where:
//     - Z is n × n         (unitary Schur vectors)
//     - T is n × n         (upper triangular for complex, quasi-upper triangular for real)

use faer_traits::ComplexField;
use mdarray::{DSlice, Dense, Layout, tensor};
use mdarray_linalg::eig::{Eig, EigDecomp, EigError, EigResult, SchurError, SchurResult};
use num_complex::{Complex, ComplexFloat};

use crate::{Faer, into_faer, into_faer_mut};

macro_rules! complex_from_faer {
    ($val:expr, $t:ty) => {{
        let re: <$t as ComplexFloat>::Real = unsafe { std::mem::transmute_copy(&($val.re)) };
        let im: <$t as ComplexFloat>::Real = unsafe { std::mem::transmute_copy(&($val.im)) };
        Complex::new(re, im)
    }};
}

impl<T> Eig<T> for Faer
where
    T: ComplexFloat
        + ComplexField
        + Default
        + std::convert::From<<T as num_complex::ComplexFloat>::Real>
        + 'static,
{
    /// Compute eigenvalues and right eigenvectors with new allocated matrices
    /// The matrix `A` satisfies: `A * v = λ * v` where v are the right eigenvectors
    fn eig<L: Layout>(&self, a: &mut DSlice<T, 2, L>) -> EigResult<T> {
        let (m, n) = *a.shape();

        if m != n {
            return Err(EigError::NotSquareMatrix);
        }

        let a_faer = into_faer(a);
        let eig_result = a_faer.eigen();

        match eig_result {
            Ok(eig) => {
                let eigenvalues = eig.S();
                let right_vecs = eig.U();

                let x = T::default();
                let mut eigenvalues_mda = tensor![[Complex::new(x.re(), x.re()); n]; 1];
                let mut right_vecs_mda = tensor![[Complex::new(x.re(), x.re());n]; n];

                for i in 0..n {
                    eigenvalues_mda[[0, i]] = complex_from_faer!(&eigenvalues[i], T);
                }

                for i in 0..n {
                    for j in 0..n {
                        right_vecs_mda[[i, j]] = complex_from_faer!(&right_vecs[(i, j)], T);
                    }
                }

                Ok(EigDecomp {
                    eigenvalues: eigenvalues_mda,
                    left_eigenvectors: None,
                    right_eigenvectors: Some(right_vecs_mda),
                })
            }
            Err(_) => Err(EigError::BackendDidNotConverge { iterations: 0 }),
        }
    }

    // /// Compute eigenvalues and both left/right eigenvectors with new allocated matrices
    // /// The matrix A satisfies: `A * vr = λ * vr` and `vl^H * A = λ * vl^H`
    // /// where `vr` are right eigenvectors and `vl` are left eigenvectors
    // fn eig_full<L: Layout>(&self, a: &mut DSlice<T, 2, L>) -> EigResult<T> {
    //     let (m, n) = *a.shape();

    //     if m != n {
    //         return Err(EigError::NotSquareMatrix);
    //     }

    //     let a_faer = into_faer(a);

    //     let eig_result = a_faer.eigen();

    //     match eig_result {
    //         Ok(eig) => {
    //             let eigenvalues = eig.S();
    //             let right_vecs = eig.U();

    //             let x = T::default();
    //             let mut eigenvalues_mda = tensor![[Complex::new(x.re(), x.re()); n]; 1];
    //             let mut right_vecs_mda = tensor![[Complex::new(x.re(), x.re());n]; n];

    //             for i in 0..n {
    //                 eigenvalues_mda[[0, i]] = complex_from_faer!(&eigenvalues[i], T);
    //             }

    //             let mut right_vecs_faer = into_faer_mut(&mut right_vecs_mda);
    //             for i in 0..n {
    //                 for j in 0..n {
    //                     right_vecs_faer[(i, j)] = complex_from_faer!(right_vecs[(i, j)], T);
    //                 }
    //             }

    //             let mut left_vecs_mda = tensor![[Complex::new(x.re(), x.re());n]; n];

    //             let mut left_vecs_faer = into_faer_mut(&mut left_vecs_mda);
    //             for i in 0..n {
    //                 for j in 0..n {
    //                     left_vecs_faer[(i, j)] = complex_from_faer!(right_vecs[(i, j)].conj(), T);
    //                 }
    //             }

    //             Ok(EigDecomp {
    //                 eigenvalues: eigenvalues_mda,
    //                 left_eigenvectors: Some(left_vecs_mda),
    //                 right_eigenvectors: Some(right_vecs_mda),
    //             })
    //         }
    //         Err(_) => Err(EigError::BackendDidNotConverge { iterations: 0 }),
    //     }
    // }

    fn eig_full<L: Layout>(&self, _a: &mut DSlice<T, 2, L>) -> Result<EigDecomp<T>, EigError> {
        todo!();
        // let (m, n) = *a.shape();
        // if m != n {
        //     return Err(EigError::NotSquareMatrix);
        // }

        // let par = faer::get_global_parallelism();

        // let x = T::default();

        // let mut eigenvalues_mda = tensor![[Complex::new(x.re(), x.re()); n]; 1];
        // let mut right_vecs_mda = tensor![[Complex::new(x.re(), x.re()); n]; n];
        // let mut left_vecs_mda = tensor![[Complex::new(x.re(), x.re()); n]; n];

        // let a_faer = into_faer_mut(a);

        // let params = <faer::linalg::evd::EvdParams as faer::Auto<T>>::auto();

        // // let eig_result = if TypeId::of::<T>() == TypeId::of::<Complex<f32>>()
        // //     || TypeId::of::<T>() == TypeId::of::<Complex<f64>>()
        // // {
        // let eig_result = if true {
        //     let mut eigenvalues_faer = into_faer_mut(&mut eigenvalues_mda);
        //     let mut right_vecs_faer = into_faer_mut(&mut right_vecs_mda);
        //     let mut left_vecs_faer = into_faer_mut(&mut left_vecs_mda);

        //     let a_faer_complex: MatRef<'_, Complex<<T as faer::traits::ComplexField>::Real>> = unsafe {
        //         faer::hacks::coerce::<_, MatRef<'_, Complex<<T as faer::traits::ComplexField>::Real>>>(
        //             a_faer,
        //         )
        //     };

        //     let mut left_vecs_complex: MatMut<
        //         '_,
        //         Complex<<T as faer::traits::ComplexField>::Real>,
        //     > = unsafe {
        //         faer::hacks::coerce::<_, MatMut<'_, Complex<<T as faer::traits::ComplexField>::Real>>>(
        //             left_vecs_faer,
        //         )
        //     };

        //     let mut right_vecs_complex: MatMut<
        //         '_,
        //         Complex<<T as faer::traits::ComplexField>::Real>,
        //     > = unsafe {
        //         faer::hacks::coerce::<_, MatMut<'_, Complex<<T as faer::traits::ComplexField>::Real>>>(
        //             right_vecs_faer,
        //         )
        //     };

        //     let mut stack_buf = MemBuffer::new(faer::linalg::evd::evd_scratch::<T>(
        //         n,
        //         ComputeEigenvectors::Yes,
        //         ComputeEigenvectors::Yes,
        //         par,
        //         params.into(),
        //     ));
        //     let stack = MemStack::new(&mut stack_buf);

        //     let col0 = eigenvalues_faer.col_mut(0);

        //     let col0_as_matmut: MatMut<'_, Complex<<T as faer::traits::ComplexField>::Real>> = unsafe {
        //         faer::hacks::coerce::<_, MatMut<'_, Complex<<T as faer::traits::ComplexField>::Real>>>(
        //             col0,
        //         )
        //     };

        //     let diag_mut = col0_as_matmut.diagonal_mut();

        //     faer::linalg::evd::evd_cplx::<<T as faer::traits::ComplexField>::Real>(
        //         a_faer_complex,
        //         diag_mut,
        //         Some(left_vecs_complex.as_mut()),
        //         Some(right_vecs_complex.as_mut()),
        //         par,
        //         stack,
        //         params.into(),
        //     )
        // } else {
        //     let mut s_re_mda = tensor![[x.re(); n]; 1];
        //     let mut s_im_mda = tensor![[x.re(); n]; 1];

        //     let mut right_vecs_faer = into_faer_mut(&mut right_vecs_mda);
        //     let mut left_vecs_faer = into_faer_mut(&mut left_vecs_mda);
        //     let mut s_re_faer = into_faer_mut(&mut s_re_mda);
        //     let mut s_im_faer = into_faer_mut(&mut s_im_mda);

        //     let a_faer_real: MatRef<'_, <T as faer::traits::ComplexField>::Real> = unsafe {
        //         faer::hacks::coerce::<_, MatRef<'_, <T as faer::traits::ComplexField>::Real>>(
        //             a_faer,
        //         )
        //     };

        //     println!("ici");

        //     let mut left_vecs_real: MatMut<'_, <T as faer::traits::ComplexField>::Real> = unsafe {
        //         faer::hacks::coerce::<_, MatMut<'_, <T as faer::traits::ComplexField>::Real>>(
        //             left_vecs_faer,
        //         )
        //     };

        //     let mut right_vecs_real: MatMut<'_, <T as faer::traits::ComplexField>::Real> = unsafe {
        //         faer::hacks::coerce::<_, MatMut<'_, <T as faer::traits::ComplexField>::Real>>(
        //             right_vecs_faer,
        //         )
        //     };

        //     let mut stack_buf = MemBuffer::new(faer::linalg::evd::evd_scratch::<T>(
        //         n,
        //         ComputeEigenvectors::Yes,
        //         ComputeEigenvectors::Yes,
        //         par,
        //         params.into(),
        //     ));
        //     let stack = MemStack::new(&mut stack_buf);

        //     let s_re_col0 = s_re_faer.col_mut(0);
        //     let s_re_as_matmut: MatMut<'_, <T as faer::traits::ComplexField>::Real> = unsafe {
        //         faer::hacks::coerce::<_, MatMut<'_, <T as faer::traits::ComplexField>::Real>>(
        //             s_re_col0,
        //         )
        //     };
        //     let s_re_diag = s_re_as_matmut.diagonal_mut();

        //     let s_im_col0 = s_im_faer.col_mut(0);
        //     let s_im_as_matmut: MatMut<'_, <T as faer::traits::ComplexField>::Real> = unsafe {
        //         faer::hacks::coerce::<_, MatMut<'_, <T as faer::traits::ComplexField>::Real>>(
        //             s_im_col0,
        //         )
        //     };
        //     let s_im_diag = s_im_as_matmut.diagonal_mut();

        //     let result = faer::linalg::evd::evd_real::<<T as faer::traits::ComplexField>::Real>(
        //         a_faer_real,
        //         s_re_diag,
        //         s_im_diag,
        //         Some(left_vecs_real.as_mut()),
        //         Some(right_vecs_real.as_mut()),
        //         par,
        //         stack,
        //         params.into(),
        //     );

        //     if result.is_ok() {
        //         for i in 0..n {
        //             eigenvalues_mda[[0, i]] = Complex::new(s_re_mda[[0, i]], s_im_mda[[0, i]]);
        //         }
        //     }

        //     result
        // };

        // match eig_result {
        //     Ok(_) => Ok(EigDecomp {
        //         eigenvalues: eigenvalues_mda,
        //         left_eigenvectors: Some(left_vecs_mda),
        //         right_eigenvectors: Some(right_vecs_mda),
        //     }),
        //     Err(_) => Err(EigError::BackendDidNotConverge { iterations: 0 }),
        // }
    }
    /// Compute only eigenvalues with new allocated vectors
    fn eig_values<L: Layout>(&self, a: &mut DSlice<T, 2, L>) -> EigResult<T> {
        let (m, n) = *a.shape();

        if m != n {
            return Err(EigError::NotSquareMatrix);
        }

        let a_faer = into_faer(a);

        let eigenvalues_result = a_faer.eigenvalues();

        match eigenvalues_result {
            Ok(eigenvalues) => {
                let x = T::default();
                let mut eigenvalues_mda = tensor![[Complex::new(x.re(), x.re()); n]; 1];

                for i in 0..n {
                    eigenvalues_mda[[0, i]] = complex_from_faer!(&eigenvalues[i], T);
                }

                Ok(EigDecomp {
                    eigenvalues: eigenvalues_mda,
                    left_eigenvectors: None,
                    right_eigenvectors: None,
                })
            }
            Err(_) => Err(EigError::BackendDidNotConverge { iterations: 0 }),
        }
    }

    /// Compute eigenvalues and eigenvectors of a Hermitian matrix (input should be complex)
    fn eigh<L: Layout>(&self, a: &mut DSlice<T, 2, L>) -> EigResult<T> {
        let (m, n) = *a.shape();

        if m != n {
            return Err(EigError::NotSquareMatrix);
        }

        let a_faer = into_faer(a);

        let eig_result = a_faer.self_adjoint_eigen(faer::Side::Lower);

        match eig_result {
            Ok(eig) => {
                let eigenvalues = eig.S();
                let eigenvectors = eig.U();

                let x = T::default();
                let mut eigenvalues_mda = tensor![[Complex::new(x.re(), x.re()); n]; 1];

                let mut eigenvalues_faer = into_faer_mut(&mut eigenvalues_mda);
                for i in 0..n {
                    eigenvalues_faer[(0, i)] = Complex::new(eigenvalues[i].re(), x.re());
                }

                let mut right_vecs_mda = tensor![[Complex::new(x.re(), x.re());n]; n];

                let mut eigenvectors_faer = into_faer_mut(&mut right_vecs_mda);
                for i in 0..n {
                    for j in 0..n {
                        let val = eigenvectors[(i, j)];
                        eigenvectors_faer[(i, j)] = Complex::new(val.re(), val.im());
                    }
                }

                Ok(EigDecomp {
                    eigenvalues: eigenvalues_mda,
                    left_eigenvectors: None,
                    right_eigenvectors: Some(right_vecs_mda),
                })
            }
            Err(_) => Err(EigError::BackendDidNotConverge { iterations: 0 }),
        }
    }

    /// Compute eigenvalues and eigenvectors of a symmetric matrix (input should be real)
    fn eigs<L: Layout>(&self, a: &mut DSlice<T, 2, L>) -> EigResult<T> {
        self.eigh(a)
    }

    /// Compute Schur decomposition with new allocated matrices
    fn schur<L: Layout>(&self, _a: &mut DSlice<T, 2, L>) -> SchurResult<T> {
        todo!();
    }

    /// Compute Schur decomposition overwriting existing matrices
    fn schur_overwrite<L: Layout>(
        &self,
        _a: &mut DSlice<T, 2, L>,
        _t: &mut DSlice<T, 2, Dense>,
        _z: &mut DSlice<T, 2, Dense>,
    ) -> Result<(), SchurError> {
        todo!();
    }

    /// Compute Schur (complex) decomposition with new allocated matrices
    fn schur_complex<L: Layout>(&self, _a: &mut DSlice<T, 2, L>) -> SchurResult<T> {
        todo!();
    }

    /// Compute Schur (complex) decomposition overwriting existing matrices
    fn schur_complex_overwrite<L: Layout>(
        &self,
        _a: &mut DSlice<T, 2, L>,
        _t: &mut DSlice<T, 2, Dense>,
        _z: &mut DSlice<T, 2, Dense>,
    ) -> Result<(), SchurError> {
        todo!();
    }
}