![]() |
Eigen
5.0.1
|
#include <Eigen/src/QR/CompleteOrthogonalDecomposition.h>
Complete orthogonal decomposition (COD) of a matrix, backed by RandColPivHouseholderQR.
Same factorization as CompleteOrthogonalDecomposition, but the rank-revealing QR step uses the randomized blocked column-pivoted Householder QR (BQRRP framework). On large matrices this is faster than the classical Businger-Golub pivoting in CompleteOrthogonalDecomposition because almost all work is performed in level-3 BLAS. The pivot-quality difference is empirically minor; see RandColPivHouseholderQR for references and details.
The block size and RNG seed of the underlying QR can be configured via setBlockSize() and setSeed() before calling compute().
For small or fixed-size matrices prefer CompleteOrthogonalDecomposition: the sketch overhead dominates below roughly a few hundred rows/columns.
Public Member Functions | |
| RandCompleteOrthogonalDecomposition & | setBlockSize (Index b) |
| Sets the panel block size of the underlying randomized QR. | |
| RandCompleteOrthogonalDecomposition & | setSeed (uint64_t seed) |
| Fixes the RNG seed of the underlying randomized QR. | |
|
inline |
Sets the panel block size of the underlying randomized QR.
|
inline |
Fixes the RNG seed of the underlying randomized QR.