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
//! Implementation of ?geqrf - QR factorization.
use lapack::{cgeqrf, dgeqrf, sgeqrf, zgeqrf};
use crate::base_types::LapackResult;
use crate::base_types::{LapackError, c32, c64};
use crate::dense::linalg::lapack::interface::lapack_return;
use num::{Zero, complex::ComplexFloat};
/// ?geqrf - QR factorization.
pub trait Geqrf: Sized {
/// Perform QR factorization of a matrix `a` with dimensions `m` x `n`.
///
fn geqrf(m: usize, n: usize, a: &mut [Self], lda: usize, tau: &mut [Self]) -> LapackResult<()>;
}
macro_rules! implement_geqrf {
($scalar:ty, $geqrf:expr) => {
impl Geqrf for $scalar {
fn geqrf(
m: usize,
n: usize,
a: &mut [Self],
lda: usize,
tau: &mut [Self],
) -> LapackResult<()> {
assert_eq!(
lda * n,
a.len(),
"Require `lda * n` {} == `a.len()` {}.",
lda * n,
a.len()
);
assert!(
lda >= std::cmp::max(1, m),
"Require `lda` {} >= `max(1, m)` {}.",
lda,
std::cmp::max(1, m)
);
let k = std::cmp::min(m, n);
assert_eq!(
tau.len(),
k,
"Require `tau.len()` {} == `min(m, n)` {}.",
tau.len(),
k
);
let mut info = 0;
let mut work = vec![<$scalar>::zero(); 1];
unsafe {
$geqrf(
m as i32, n as i32, a, lda as i32, tau, &mut work, -1, &mut info,
);
}
if info != 0 {
Err(LapackError::LapackInfoCode(info))
} else {
let lwork = work[0].re() as usize;
let mut work = vec![<$scalar>::zero(); lwork];
unsafe {
$geqrf(
m as i32,
n as i32,
a,
lda as i32,
tau,
&mut work,
lwork as i32,
&mut info,
);
}
lapack_return(info, ())
}
}
}
};
}
implement_geqrf!(f32, sgeqrf);
implement_geqrf!(f64, dgeqrf);
implement_geqrf!(c32, cgeqrf);
implement_geqrf!(c64, zgeqrf);