mirror of
https://gitlab.com/libeigen/eigen.git
synced 2025-05-29 01:26:58 +08:00
8332c232db
* continue the decomposition until a pivot is exactly zero; don't try to compute the rank in the decomposition itself. * Instead, methods such as rank() use a new internal parameter called 'threshold' to determine which pivots are to be considered nonzero. * The threshold is by default determined by defaultThreshold() but the user can override that by calling useThreshold(value). * In solve/kernel/image, don't assume that the diagonal of U is sorted in decreasing order, because that's only approximately true. Additional work was needed to extract the right pivots.