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
//! Implementation of ?geqp3 - Column pivoted QR factorization.
use lapack::{cgeqp3, dgeqp3, sgeqp3, zgeqp3};
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};
/// ?geqp3 - Column pivoted QR factorization.
pub trait Geqp3: Sized {
/// Perform column pivoted QR factorization of a matrix `a` with dimensions `m` x `n`.
fn geqp3(
m: usize,
n: usize,
a: &mut [Self],
lda: usize,
jpvt: &mut Vec<i32>,
tau: &mut Vec<Self>,
) -> LapackResult<()>;
}
macro_rules! implement_geqp3 {
($scalar:ty, $geqp3:expr) => {
impl Geqp3 for $scalar {
fn geqp3(
m: usize,
n: usize,
a: &mut [Self],
lda: usize,
jpvt: &mut Vec<i32>,
tau: &mut Vec<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!(
jpvt.len(),
n,
"Require `jpvt.len()` {} == `n` {}.",
jpvt.len(),
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 {
$geqp3(
m as i32, n as i32, a, lda as i32, jpvt, 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 {
$geqp3(
m as i32,
n as i32,
a,
lda as i32,
jpvt,
tau,
&mut work,
lwork as i32,
&mut info,
);
}
lapack_return(info, ())
}
}
}
};
($scalar:ty, $real_scalar:ty, $geqp3:expr) => {
impl Geqp3 for $scalar {
fn geqp3(
m: usize,
n: usize,
a: &mut [Self],
lda: usize,
jpvt: &mut Vec<i32>,
tau: &mut Vec<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!(
jpvt.len(),
n,
"Require `jpvt.len()` {} == `n` {}.",
jpvt.len(),
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];
let mut rwork = vec![<$real_scalar>::zero(); 2 * n];
unsafe {
$geqp3(
m as i32, n as i32, a, lda as i32, jpvt, tau, &mut work, -1, &mut rwork,
&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 {
$geqp3(
m as i32,
n as i32,
a,
lda as i32,
jpvt,
tau,
&mut work,
lwork as i32,
&mut rwork,
&mut info,
);
}
lapack_return(info, ())
}
}
}
};
}
implement_geqp3!(f32, sgeqp3);
implement_geqp3!(f64, dgeqp3);
implement_geqp3!(c32, f32, cgeqp3);
implement_geqp3!(c64, f64, zgeqp3);