[−][src]Function gramschmidt::cgs
pub fn cgs<S>(
a: &ArrayBase<S, Ix2>
) -> Result<(Array<f64, Ix2>, Array<f64, Ix2>)> where
S: Data<Elem = f64>,
Convenience function that calculates a Classical Gram Schmidt QR factorization, returning a
tuple (Q,R)
.
If you want to repeatedly calculate QR factorizations, then prefer constructing a Classical
struct and calling its GramSchmidt::compute
method implemented through the GramSchmidt
trait.