The is a rank-revealing LU implementation which can leverage fast matrix-matrix operations. It thus has a very small overhead compared to PartialPivLU (about 30%), and it looks pretty simple to implement. A Fortran implementation under the BSD licence is available there:
-- GitLab Migration Automatic Message --
This bug has been migrated to gitlab.com's GitLab instance and has been closed from further activity.
You can subscribe and participate further through the new bug through this link to our GitLab instance: https://gitlab.com/libeigen/eigen/issues/831.