pub(crate) fn givens<T: Real>(a: T, b: T) -> (Rot<T>, T)
Algorithm G: (G, r) with G (a, b) = (r, 0), r ≥ 0.
(G, r)
G (a, b) = (r, 0)
r ≥ 0