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_fill.h | |
parent | ebf8ca4fa8c390806cfece958743234a8303f7bb (diff) |
Extend unit tests of sefladjoint-eigensolver
Diffstat (limited to 'test/svd_fill.h')
-rw-r--r-- | test/svd_fill.h | 85 |
1 files changed, 85 insertions, 0 deletions
diff --git a/test/svd_fill.h b/test/svd_fill.h new file mode 100644 index 000000000..aa75326d9 --- /dev/null +++ b/test/svd_fill.h @@ -0,0 +1,85 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2014-2015 Gael Guennebaud <gael.guennebaud@inria.fr> +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +template<typename MatrixType> +void svd_fill_random(MatrixType &m, int Option = 0) +{ + 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(); + } + + if(Option==Symmetric) + { + m = U * d.asDiagonal() * U.transpose(); + + // randomly nullify some rows/columns + { + Index count = internal::random<Index>(-1,1); + for(Index k=0; k<count; ++k) + { + Index i = internal::random<Index>(0,diagSize-1); + m.row(i).setZero(); + m.col(i).setZero(); + } + } + } + else + { + 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)); + } + } +} + |