use nalgebra::DMatrix;
pub fn vander(u: &[f64], p: usize) -> DMatrix<f64> {
let n = u.len();
let mut m = DMatrix::<f64>::zeros(n, p + 1);
for i in 0..n {
m[(i, 0)] = 1.0;
}
for j in 1..=p {
for i in 0..n {
m[(i, j)] = m[(i, j - 1)] * u[i];
}
}
m
}
pub fn qr_xx_inv(x: &DMatrix<f64>) -> DMatrix<f64> {
let g = x.transpose() * x;
match g.clone().cholesky() {
Some(chol) => chol.inverse(),
None => ginv(&g),
}
}
pub fn ginv(g: &DMatrix<f64>) -> DMatrix<f64> {
let svd = g.clone().svd(true, true);
let d = &svd.singular_values;
let dmax = d.iter().cloned().fold(0.0_f64, f64::max);
let tol = f64::EPSILON.sqrt() * dmax;
let r = d.len();
let u = svd.u.as_ref().expect("u was requested");
let vt = svd.v_t.as_ref().expect("v_t was requested");
let mut dinv = DMatrix::<f64>::zeros(r, r);
for i in 0..r {
if d[i] > tol {
dinv[(i, i)] = 1.0 / d[i];
}
}
vt.transpose() * dinv * u.transpose()
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn vander_built_by_successive_mult() {
let m = vander(&[2.0, 3.0], 3);
assert_eq!(
(m[(0, 0)], m[(0, 1)], m[(0, 2)], m[(0, 3)]),
(1.0, 2.0, 4.0, 8.0)
);
assert_eq!((m[(1, 1)], m[(1, 2)], m[(1, 3)]), (3.0, 9.0, 27.0));
}
#[test]
fn vander_degree_zero_is_intercept() {
let m = vander(&[5.0, 9.0], 0);
assert_eq!((m.nrows(), m.ncols()), (2, 1));
assert_eq!((m[(0, 0)], m[(1, 0)]), (1.0, 1.0));
}
#[test]
fn qr_xx_inv_inverts_well_conditioned_gram() {
let x = vander(&[0.0, 1.0, 2.0, 3.0, 4.0], 2); let inv = qr_xx_inv(&x);
let g = x.transpose() * &x;
let id = &inv * &g;
let i3 = DMatrix::<f64>::identity(3, 3);
assert!((id - i3).amax() < 1e-9);
}
#[test]
fn ginv_satisfies_moore_penrose_on_singular() {
let g = DMatrix::from_row_slice(3, 3, &[2.0, 2.0, 0.0, 2.0, 2.0, 0.0, 0.0, 0.0, 1.0]);
let pinv = ginv(&g);
let recon = &g * &pinv * &g;
assert!((recon - g).amax() < 1e-9);
}
}