diff options
author | Gael Guennebaud <g.gael@free.fr> | 2015-05-07 15:54:07 +0200 |
---|---|---|
committer | Gael Guennebaud <g.gael@free.fr> | 2015-05-07 15:54:07 +0200 |
commit | c2107d30ce9b9f30ff1f2d436667f3d09a4d9bd5 (patch) | |
tree | 0c38d7f2023d51753a37f1f04f489491e2901a5f /test/svd_common.h | |
parent | ebf8ca4fa8c390806cfece958743234a8303f7bb (diff) |
Extend unit tests of sefladjoint-eigensolver
Diffstat (limited to 'test/svd_common.h')
-rw-r--r-- | test/svd_common.h | 61 |
1 files changed, 2 insertions, 59 deletions
diff --git a/test/svd_common.h b/test/svd_common.h index b44b79124..b06a8a0f2 100644 --- a/test/svd_common.h +++ b/test/svd_common.h @@ -16,6 +16,8 @@ #error a macro SVD_FOR_MIN_NORM(MatrixType) must be defined prior to including svd_common.h #endif +#include "svd_fill.h" + // Check that the matrix m is properly reconstructed and that the U and V factors are unitary // The SVD must have already been computed. template<typename SvdType, typename MatrixType> @@ -257,65 +259,6 @@ void svd_test_all_computation_options(const MatrixType& m, bool full_only) } } -template<typename MatrixType> -void svd_fill_random(MatrixType &m) -{ - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - typedef typename MatrixType::Index Index; - Index diagSize = (std::min)(m.rows(), m.cols()); - RealScalar s = std::numeric_limits<RealScalar>::max_exponent10/4; - s = internal::random<RealScalar>(1,s); - Matrix<RealScalar,Dynamic,1> d = Matrix<RealScalar,Dynamic,1>::Random(diagSize); - for(Index k=0; k<diagSize; ++k) - d(k) = d(k)*std::pow(RealScalar(10),internal::random<RealScalar>(-s,s)); - - bool dup = internal::random<int>(0,10) < 3; - bool unit_uv = internal::random<int>(0,10) < (dup?7:3); // if we duplicate some diagonal entries, then increase the chance to preserve them using unitary U and V factors - - // duplicate some singular values - if(dup) - { - Index n = internal::random<Index>(0,d.size()-1); - for(Index i=0; i<n; ++i) - d(internal::random<Index>(0,d.size()-1)) = d(internal::random<Index>(0,d.size()-1)); - } - - Matrix<Scalar,Dynamic,Dynamic> U(m.rows(),diagSize); - Matrix<Scalar,Dynamic,Dynamic> VT(diagSize,m.cols()); - if(unit_uv) - { - // in very rare cases let's try with a pure diagonal matrix - if(internal::random<int>(0,10) < 1) - { - U.setIdentity(); - VT.setIdentity(); - } - else - { - createRandomPIMatrixOfRank(diagSize,U.rows(), U.cols(), U); - createRandomPIMatrixOfRank(diagSize,VT.rows(), VT.cols(), VT); - } - } - else - { - U.setRandom(); - VT.setRandom(); - } - - m = U * d.asDiagonal() * VT; - - // (partly) cancel some coeffs - if(!(dup && unit_uv)) - { - Matrix<Scalar,Dynamic,1> samples(7); - samples << 0, 5.60844e-313, -5.60844e-313, 4.94e-324, -4.94e-324, -1./NumTraits<RealScalar>::highest(), 1./NumTraits<RealScalar>::highest(); - Index n = internal::random<Index>(0,m.size()-1); - for(Index i=0; i<n; ++i) - m(internal::random<Index>(0,m.rows()-1), internal::random<Index>(0,m.cols()-1)) = samples(internal::random<Index>(0,6)); - } -} - // work around stupid msvc error when constructing at compile time an expression that involves // a division by zero, even if the numeric type has floating point |