forked from M-Labs/nalgebra
cea3bdc8e5
The previous implementation was correct only for real elements. The Cholesky decomposition is `L L^H`, so the determinant is `det(L) * det(L^H)`. Since `L` is a triangular matrix, `det(L)` is the product of the diagonal elements of `L`. Since `L^H` is triangular and its diagonal elements are the conjugates of the diagonal elements of `L`, `det(L^H)` is the conjugate of `det(L)`. So, the overall determinant is the product of the diagonal elements of `L` times its conjugate. |
||
|---|---|---|
| .. | ||
| balancing.rs | ||
| bidiagonal.rs | ||
| cholesky.rs | ||
| col_piv_qr.rs | ||
| convolution.rs | ||
| eigen.rs | ||
| exp.rs | ||
| full_piv_lu.rs | ||
| hessenberg.rs | ||
| inverse.rs | ||
| lu.rs | ||
| mod.rs | ||
| qr.rs | ||
| schur.rs | ||
| solve.rs | ||
| svd.rs | ||
| tridiagonal.rs | ||
| udu.rs | ||