umappp 0.1.2
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +7 -0
- data/LICENSE.txt +25 -0
- data/README.md +110 -0
- data/ext/umappp/extconf.rb +25 -0
- data/ext/umappp/numo.hpp +867 -0
- data/ext/umappp/umappp.cpp +225 -0
- data/lib/umappp/version.rb +5 -0
- data/lib/umappp.rb +41 -0
- data/vendor/Eigen/Cholesky +45 -0
- data/vendor/Eigen/CholmodSupport +48 -0
- data/vendor/Eigen/Core +384 -0
- data/vendor/Eigen/Dense +7 -0
- data/vendor/Eigen/Eigen +2 -0
- data/vendor/Eigen/Eigenvalues +60 -0
- data/vendor/Eigen/Geometry +59 -0
- data/vendor/Eigen/Householder +29 -0
- data/vendor/Eigen/IterativeLinearSolvers +48 -0
- data/vendor/Eigen/Jacobi +32 -0
- data/vendor/Eigen/KLUSupport +41 -0
- data/vendor/Eigen/LU +47 -0
- data/vendor/Eigen/MetisSupport +35 -0
- data/vendor/Eigen/OrderingMethods +70 -0
- data/vendor/Eigen/PaStiXSupport +49 -0
- data/vendor/Eigen/PardisoSupport +35 -0
- data/vendor/Eigen/QR +50 -0
- data/vendor/Eigen/QtAlignedMalloc +39 -0
- data/vendor/Eigen/SPQRSupport +34 -0
- data/vendor/Eigen/SVD +50 -0
- data/vendor/Eigen/Sparse +34 -0
- data/vendor/Eigen/SparseCholesky +37 -0
- data/vendor/Eigen/SparseCore +69 -0
- data/vendor/Eigen/SparseLU +50 -0
- data/vendor/Eigen/SparseQR +36 -0
- data/vendor/Eigen/StdDeque +27 -0
- data/vendor/Eigen/StdList +26 -0
- data/vendor/Eigen/StdVector +27 -0
- data/vendor/Eigen/SuperLUSupport +64 -0
- data/vendor/Eigen/UmfPackSupport +40 -0
- data/vendor/Eigen/src/Cholesky/LDLT.h +688 -0
- data/vendor/Eigen/src/Cholesky/LLT.h +558 -0
- data/vendor/Eigen/src/Cholesky/LLT_LAPACKE.h +99 -0
- data/vendor/Eigen/src/CholmodSupport/CholmodSupport.h +682 -0
- data/vendor/Eigen/src/Core/ArithmeticSequence.h +413 -0
- data/vendor/Eigen/src/Core/Array.h +417 -0
- data/vendor/Eigen/src/Core/ArrayBase.h +226 -0
- data/vendor/Eigen/src/Core/ArrayWrapper.h +209 -0
- data/vendor/Eigen/src/Core/Assign.h +90 -0
- data/vendor/Eigen/src/Core/AssignEvaluator.h +1010 -0
- data/vendor/Eigen/src/Core/Assign_MKL.h +178 -0
- data/vendor/Eigen/src/Core/BandMatrix.h +353 -0
- data/vendor/Eigen/src/Core/Block.h +448 -0
- data/vendor/Eigen/src/Core/BooleanRedux.h +162 -0
- data/vendor/Eigen/src/Core/CommaInitializer.h +164 -0
- data/vendor/Eigen/src/Core/ConditionEstimator.h +175 -0
- data/vendor/Eigen/src/Core/CoreEvaluators.h +1741 -0
- data/vendor/Eigen/src/Core/CoreIterators.h +132 -0
- data/vendor/Eigen/src/Core/CwiseBinaryOp.h +183 -0
- data/vendor/Eigen/src/Core/CwiseNullaryOp.h +1001 -0
- data/vendor/Eigen/src/Core/CwiseTernaryOp.h +197 -0
- data/vendor/Eigen/src/Core/CwiseUnaryOp.h +103 -0
- data/vendor/Eigen/src/Core/CwiseUnaryView.h +132 -0
- data/vendor/Eigen/src/Core/DenseBase.h +701 -0
- data/vendor/Eigen/src/Core/DenseCoeffsBase.h +685 -0
- data/vendor/Eigen/src/Core/DenseStorage.h +652 -0
- data/vendor/Eigen/src/Core/Diagonal.h +258 -0
- data/vendor/Eigen/src/Core/DiagonalMatrix.h +391 -0
- data/vendor/Eigen/src/Core/DiagonalProduct.h +28 -0
- data/vendor/Eigen/src/Core/Dot.h +318 -0
- data/vendor/Eigen/src/Core/EigenBase.h +160 -0
- data/vendor/Eigen/src/Core/ForceAlignedAccess.h +150 -0
- data/vendor/Eigen/src/Core/Fuzzy.h +155 -0
- data/vendor/Eigen/src/Core/GeneralProduct.h +465 -0
- data/vendor/Eigen/src/Core/GenericPacketMath.h +1040 -0
- data/vendor/Eigen/src/Core/GlobalFunctions.h +194 -0
- data/vendor/Eigen/src/Core/IO.h +258 -0
- data/vendor/Eigen/src/Core/IndexedView.h +237 -0
- data/vendor/Eigen/src/Core/Inverse.h +117 -0
- data/vendor/Eigen/src/Core/Map.h +171 -0
- data/vendor/Eigen/src/Core/MapBase.h +310 -0
- data/vendor/Eigen/src/Core/MathFunctions.h +2057 -0
- data/vendor/Eigen/src/Core/MathFunctionsImpl.h +200 -0
- data/vendor/Eigen/src/Core/Matrix.h +565 -0
- data/vendor/Eigen/src/Core/MatrixBase.h +547 -0
- data/vendor/Eigen/src/Core/NestByValue.h +85 -0
- data/vendor/Eigen/src/Core/NoAlias.h +109 -0
- data/vendor/Eigen/src/Core/NumTraits.h +335 -0
- data/vendor/Eigen/src/Core/PartialReduxEvaluator.h +232 -0
- data/vendor/Eigen/src/Core/PermutationMatrix.h +605 -0
- data/vendor/Eigen/src/Core/PlainObjectBase.h +1128 -0
- data/vendor/Eigen/src/Core/Product.h +191 -0
- data/vendor/Eigen/src/Core/ProductEvaluators.h +1179 -0
- data/vendor/Eigen/src/Core/Random.h +218 -0
- data/vendor/Eigen/src/Core/Redux.h +515 -0
- data/vendor/Eigen/src/Core/Ref.h +381 -0
- data/vendor/Eigen/src/Core/Replicate.h +142 -0
- data/vendor/Eigen/src/Core/Reshaped.h +454 -0
- data/vendor/Eigen/src/Core/ReturnByValue.h +119 -0
- data/vendor/Eigen/src/Core/Reverse.h +217 -0
- data/vendor/Eigen/src/Core/Select.h +164 -0
- data/vendor/Eigen/src/Core/SelfAdjointView.h +365 -0
- data/vendor/Eigen/src/Core/SelfCwiseBinaryOp.h +47 -0
- data/vendor/Eigen/src/Core/Solve.h +188 -0
- data/vendor/Eigen/src/Core/SolveTriangular.h +235 -0
- data/vendor/Eigen/src/Core/SolverBase.h +168 -0
- data/vendor/Eigen/src/Core/StableNorm.h +251 -0
- data/vendor/Eigen/src/Core/StlIterators.h +463 -0
- data/vendor/Eigen/src/Core/Stride.h +116 -0
- data/vendor/Eigen/src/Core/Swap.h +68 -0
- data/vendor/Eigen/src/Core/Transpose.h +464 -0
- data/vendor/Eigen/src/Core/Transpositions.h +386 -0
- data/vendor/Eigen/src/Core/TriangularMatrix.h +1001 -0
- data/vendor/Eigen/src/Core/VectorBlock.h +96 -0
- data/vendor/Eigen/src/Core/VectorwiseOp.h +784 -0
- data/vendor/Eigen/src/Core/Visitor.h +381 -0
- data/vendor/Eigen/src/Core/arch/AVX/Complex.h +372 -0
- data/vendor/Eigen/src/Core/arch/AVX/MathFunctions.h +228 -0
- data/vendor/Eigen/src/Core/arch/AVX/PacketMath.h +1574 -0
- data/vendor/Eigen/src/Core/arch/AVX/TypeCasting.h +115 -0
- data/vendor/Eigen/src/Core/arch/AVX512/Complex.h +422 -0
- data/vendor/Eigen/src/Core/arch/AVX512/MathFunctions.h +362 -0
- data/vendor/Eigen/src/Core/arch/AVX512/PacketMath.h +2303 -0
- data/vendor/Eigen/src/Core/arch/AVX512/TypeCasting.h +89 -0
- data/vendor/Eigen/src/Core/arch/AltiVec/Complex.h +417 -0
- data/vendor/Eigen/src/Core/arch/AltiVec/MathFunctions.h +90 -0
- data/vendor/Eigen/src/Core/arch/AltiVec/MatrixProduct.h +2937 -0
- data/vendor/Eigen/src/Core/arch/AltiVec/MatrixProductCommon.h +221 -0
- data/vendor/Eigen/src/Core/arch/AltiVec/MatrixProductMMA.h +629 -0
- data/vendor/Eigen/src/Core/arch/AltiVec/PacketMath.h +2711 -0
- data/vendor/Eigen/src/Core/arch/CUDA/Complex.h +258 -0
- data/vendor/Eigen/src/Core/arch/Default/BFloat16.h +700 -0
- data/vendor/Eigen/src/Core/arch/Default/ConjHelper.h +117 -0
- data/vendor/Eigen/src/Core/arch/Default/GenericPacketMathFunctions.h +1649 -0
- data/vendor/Eigen/src/Core/arch/Default/GenericPacketMathFunctionsFwd.h +110 -0
- data/vendor/Eigen/src/Core/arch/Default/Half.h +942 -0
- data/vendor/Eigen/src/Core/arch/Default/Settings.h +49 -0
- data/vendor/Eigen/src/Core/arch/Default/TypeCasting.h +120 -0
- data/vendor/Eigen/src/Core/arch/GPU/MathFunctions.h +103 -0
- data/vendor/Eigen/src/Core/arch/GPU/PacketMath.h +1685 -0
- data/vendor/Eigen/src/Core/arch/GPU/TypeCasting.h +80 -0
- data/vendor/Eigen/src/Core/arch/HIP/hcc/math_constants.h +23 -0
- data/vendor/Eigen/src/Core/arch/MSA/Complex.h +648 -0
- data/vendor/Eigen/src/Core/arch/MSA/MathFunctions.h +387 -0
- data/vendor/Eigen/src/Core/arch/MSA/PacketMath.h +1233 -0
- data/vendor/Eigen/src/Core/arch/NEON/Complex.h +584 -0
- data/vendor/Eigen/src/Core/arch/NEON/GeneralBlockPanelKernel.h +183 -0
- data/vendor/Eigen/src/Core/arch/NEON/MathFunctions.h +75 -0
- data/vendor/Eigen/src/Core/arch/NEON/PacketMath.h +4587 -0
- data/vendor/Eigen/src/Core/arch/NEON/TypeCasting.h +1419 -0
- data/vendor/Eigen/src/Core/arch/SSE/Complex.h +351 -0
- data/vendor/Eigen/src/Core/arch/SSE/MathFunctions.h +199 -0
- data/vendor/Eigen/src/Core/arch/SSE/PacketMath.h +1505 -0
- data/vendor/Eigen/src/Core/arch/SSE/TypeCasting.h +142 -0
- data/vendor/Eigen/src/Core/arch/SVE/MathFunctions.h +44 -0
- data/vendor/Eigen/src/Core/arch/SVE/PacketMath.h +752 -0
- data/vendor/Eigen/src/Core/arch/SVE/TypeCasting.h +49 -0
- data/vendor/Eigen/src/Core/arch/SYCL/InteropHeaders.h +232 -0
- data/vendor/Eigen/src/Core/arch/SYCL/MathFunctions.h +301 -0
- data/vendor/Eigen/src/Core/arch/SYCL/PacketMath.h +670 -0
- data/vendor/Eigen/src/Core/arch/SYCL/SyclMemoryModel.h +694 -0
- data/vendor/Eigen/src/Core/arch/SYCL/TypeCasting.h +85 -0
- data/vendor/Eigen/src/Core/arch/ZVector/Complex.h +426 -0
- data/vendor/Eigen/src/Core/arch/ZVector/MathFunctions.h +233 -0
- data/vendor/Eigen/src/Core/arch/ZVector/PacketMath.h +1060 -0
- data/vendor/Eigen/src/Core/functors/AssignmentFunctors.h +177 -0
- data/vendor/Eigen/src/Core/functors/BinaryFunctors.h +541 -0
- data/vendor/Eigen/src/Core/functors/NullaryFunctors.h +189 -0
- data/vendor/Eigen/src/Core/functors/StlFunctors.h +166 -0
- data/vendor/Eigen/src/Core/functors/TernaryFunctors.h +25 -0
- data/vendor/Eigen/src/Core/functors/UnaryFunctors.h +1131 -0
- data/vendor/Eigen/src/Core/products/GeneralBlockPanelKernel.h +2645 -0
- data/vendor/Eigen/src/Core/products/GeneralMatrixMatrix.h +517 -0
- data/vendor/Eigen/src/Core/products/GeneralMatrixMatrixTriangular.h +317 -0
- data/vendor/Eigen/src/Core/products/GeneralMatrixMatrixTriangular_BLAS.h +145 -0
- data/vendor/Eigen/src/Core/products/GeneralMatrixMatrix_BLAS.h +124 -0
- data/vendor/Eigen/src/Core/products/GeneralMatrixVector.h +518 -0
- data/vendor/Eigen/src/Core/products/GeneralMatrixVector_BLAS.h +136 -0
- data/vendor/Eigen/src/Core/products/Parallelizer.h +180 -0
- data/vendor/Eigen/src/Core/products/SelfadjointMatrixMatrix.h +544 -0
- data/vendor/Eigen/src/Core/products/SelfadjointMatrixMatrix_BLAS.h +295 -0
- data/vendor/Eigen/src/Core/products/SelfadjointMatrixVector.h +262 -0
- data/vendor/Eigen/src/Core/products/SelfadjointMatrixVector_BLAS.h +118 -0
- data/vendor/Eigen/src/Core/products/SelfadjointProduct.h +133 -0
- data/vendor/Eigen/src/Core/products/SelfadjointRank2Update.h +94 -0
- data/vendor/Eigen/src/Core/products/TriangularMatrixMatrix.h +472 -0
- data/vendor/Eigen/src/Core/products/TriangularMatrixMatrix_BLAS.h +317 -0
- data/vendor/Eigen/src/Core/products/TriangularMatrixVector.h +350 -0
- data/vendor/Eigen/src/Core/products/TriangularMatrixVector_BLAS.h +255 -0
- data/vendor/Eigen/src/Core/products/TriangularSolverMatrix.h +337 -0
- data/vendor/Eigen/src/Core/products/TriangularSolverMatrix_BLAS.h +167 -0
- data/vendor/Eigen/src/Core/products/TriangularSolverVector.h +148 -0
- data/vendor/Eigen/src/Core/util/BlasUtil.h +583 -0
- data/vendor/Eigen/src/Core/util/ConfigureVectorization.h +512 -0
- data/vendor/Eigen/src/Core/util/Constants.h +563 -0
- data/vendor/Eigen/src/Core/util/DisableStupidWarnings.h +106 -0
- data/vendor/Eigen/src/Core/util/ForwardDeclarations.h +322 -0
- data/vendor/Eigen/src/Core/util/IndexedViewHelper.h +186 -0
- data/vendor/Eigen/src/Core/util/IntegralConstant.h +272 -0
- data/vendor/Eigen/src/Core/util/MKL_support.h +137 -0
- data/vendor/Eigen/src/Core/util/Macros.h +1464 -0
- data/vendor/Eigen/src/Core/util/Memory.h +1163 -0
- data/vendor/Eigen/src/Core/util/Meta.h +812 -0
- data/vendor/Eigen/src/Core/util/NonMPL2.h +3 -0
- data/vendor/Eigen/src/Core/util/ReenableStupidWarnings.h +31 -0
- data/vendor/Eigen/src/Core/util/ReshapedHelper.h +51 -0
- data/vendor/Eigen/src/Core/util/StaticAssert.h +221 -0
- data/vendor/Eigen/src/Core/util/SymbolicIndex.h +293 -0
- data/vendor/Eigen/src/Core/util/XprHelper.h +856 -0
- data/vendor/Eigen/src/Eigenvalues/ComplexEigenSolver.h +346 -0
- data/vendor/Eigen/src/Eigenvalues/ComplexSchur.h +462 -0
- data/vendor/Eigen/src/Eigenvalues/ComplexSchur_LAPACKE.h +91 -0
- data/vendor/Eigen/src/Eigenvalues/EigenSolver.h +622 -0
- data/vendor/Eigen/src/Eigenvalues/GeneralizedEigenSolver.h +418 -0
- data/vendor/Eigen/src/Eigenvalues/GeneralizedSelfAdjointEigenSolver.h +226 -0
- data/vendor/Eigen/src/Eigenvalues/HessenbergDecomposition.h +374 -0
- data/vendor/Eigen/src/Eigenvalues/MatrixBaseEigenvalues.h +158 -0
- data/vendor/Eigen/src/Eigenvalues/RealQZ.h +657 -0
- data/vendor/Eigen/src/Eigenvalues/RealSchur.h +558 -0
- data/vendor/Eigen/src/Eigenvalues/RealSchur_LAPACKE.h +77 -0
- data/vendor/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h +904 -0
- data/vendor/Eigen/src/Eigenvalues/SelfAdjointEigenSolver_LAPACKE.h +87 -0
- data/vendor/Eigen/src/Eigenvalues/Tridiagonalization.h +561 -0
- data/vendor/Eigen/src/Geometry/AlignedBox.h +486 -0
- data/vendor/Eigen/src/Geometry/AngleAxis.h +247 -0
- data/vendor/Eigen/src/Geometry/EulerAngles.h +114 -0
- data/vendor/Eigen/src/Geometry/Homogeneous.h +501 -0
- data/vendor/Eigen/src/Geometry/Hyperplane.h +282 -0
- data/vendor/Eigen/src/Geometry/OrthoMethods.h +235 -0
- data/vendor/Eigen/src/Geometry/ParametrizedLine.h +232 -0
- data/vendor/Eigen/src/Geometry/Quaternion.h +870 -0
- data/vendor/Eigen/src/Geometry/Rotation2D.h +199 -0
- data/vendor/Eigen/src/Geometry/RotationBase.h +206 -0
- data/vendor/Eigen/src/Geometry/Scaling.h +188 -0
- data/vendor/Eigen/src/Geometry/Transform.h +1563 -0
- data/vendor/Eigen/src/Geometry/Translation.h +202 -0
- data/vendor/Eigen/src/Geometry/Umeyama.h +166 -0
- data/vendor/Eigen/src/Geometry/arch/Geometry_SIMD.h +168 -0
- data/vendor/Eigen/src/Householder/BlockHouseholder.h +110 -0
- data/vendor/Eigen/src/Householder/Householder.h +176 -0
- data/vendor/Eigen/src/Householder/HouseholderSequence.h +545 -0
- data/vendor/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h +226 -0
- data/vendor/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h +212 -0
- data/vendor/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h +229 -0
- data/vendor/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h +394 -0
- data/vendor/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h +453 -0
- data/vendor/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h +444 -0
- data/vendor/Eigen/src/IterativeLinearSolvers/LeastSquareConjugateGradient.h +198 -0
- data/vendor/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h +117 -0
- data/vendor/Eigen/src/Jacobi/Jacobi.h +483 -0
- data/vendor/Eigen/src/KLUSupport/KLUSupport.h +358 -0
- data/vendor/Eigen/src/LU/Determinant.h +117 -0
- data/vendor/Eigen/src/LU/FullPivLU.h +877 -0
- data/vendor/Eigen/src/LU/InverseImpl.h +432 -0
- data/vendor/Eigen/src/LU/PartialPivLU.h +624 -0
- data/vendor/Eigen/src/LU/PartialPivLU_LAPACKE.h +83 -0
- data/vendor/Eigen/src/LU/arch/InverseSize4.h +351 -0
- data/vendor/Eigen/src/MetisSupport/MetisSupport.h +137 -0
- data/vendor/Eigen/src/OrderingMethods/Amd.h +435 -0
- data/vendor/Eigen/src/OrderingMethods/Eigen_Colamd.h +1863 -0
- data/vendor/Eigen/src/OrderingMethods/Ordering.h +153 -0
- data/vendor/Eigen/src/PaStiXSupport/PaStiXSupport.h +678 -0
- data/vendor/Eigen/src/PardisoSupport/PardisoSupport.h +545 -0
- data/vendor/Eigen/src/QR/ColPivHouseholderQR.h +674 -0
- data/vendor/Eigen/src/QR/ColPivHouseholderQR_LAPACKE.h +97 -0
- data/vendor/Eigen/src/QR/CompleteOrthogonalDecomposition.h +635 -0
- data/vendor/Eigen/src/QR/FullPivHouseholderQR.h +713 -0
- data/vendor/Eigen/src/QR/HouseholderQR.h +434 -0
- data/vendor/Eigen/src/QR/HouseholderQR_LAPACKE.h +68 -0
- data/vendor/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h +335 -0
- data/vendor/Eigen/src/SVD/BDCSVD.h +1366 -0
- data/vendor/Eigen/src/SVD/JacobiSVD.h +812 -0
- data/vendor/Eigen/src/SVD/JacobiSVD_LAPACKE.h +91 -0
- data/vendor/Eigen/src/SVD/SVDBase.h +376 -0
- data/vendor/Eigen/src/SVD/UpperBidiagonalization.h +414 -0
- data/vendor/Eigen/src/SparseCholesky/SimplicialCholesky.h +697 -0
- data/vendor/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h +174 -0
- data/vendor/Eigen/src/SparseCore/AmbiVector.h +378 -0
- data/vendor/Eigen/src/SparseCore/CompressedStorage.h +274 -0
- data/vendor/Eigen/src/SparseCore/ConservativeSparseSparseProduct.h +352 -0
- data/vendor/Eigen/src/SparseCore/MappedSparseMatrix.h +67 -0
- data/vendor/Eigen/src/SparseCore/SparseAssign.h +270 -0
- data/vendor/Eigen/src/SparseCore/SparseBlock.h +571 -0
- data/vendor/Eigen/src/SparseCore/SparseColEtree.h +206 -0
- data/vendor/Eigen/src/SparseCore/SparseCompressedBase.h +370 -0
- data/vendor/Eigen/src/SparseCore/SparseCwiseBinaryOp.h +722 -0
- data/vendor/Eigen/src/SparseCore/SparseCwiseUnaryOp.h +150 -0
- data/vendor/Eigen/src/SparseCore/SparseDenseProduct.h +342 -0
- data/vendor/Eigen/src/SparseCore/SparseDiagonalProduct.h +138 -0
- data/vendor/Eigen/src/SparseCore/SparseDot.h +98 -0
- data/vendor/Eigen/src/SparseCore/SparseFuzzy.h +29 -0
- data/vendor/Eigen/src/SparseCore/SparseMap.h +305 -0
- data/vendor/Eigen/src/SparseCore/SparseMatrix.h +1518 -0
- data/vendor/Eigen/src/SparseCore/SparseMatrixBase.h +398 -0
- data/vendor/Eigen/src/SparseCore/SparsePermutation.h +178 -0
- data/vendor/Eigen/src/SparseCore/SparseProduct.h +181 -0
- data/vendor/Eigen/src/SparseCore/SparseRedux.h +49 -0
- data/vendor/Eigen/src/SparseCore/SparseRef.h +397 -0
- data/vendor/Eigen/src/SparseCore/SparseSelfAdjointView.h +659 -0
- data/vendor/Eigen/src/SparseCore/SparseSolverBase.h +124 -0
- data/vendor/Eigen/src/SparseCore/SparseSparseProductWithPruning.h +198 -0
- data/vendor/Eigen/src/SparseCore/SparseTranspose.h +92 -0
- data/vendor/Eigen/src/SparseCore/SparseTriangularView.h +189 -0
- data/vendor/Eigen/src/SparseCore/SparseUtil.h +186 -0
- data/vendor/Eigen/src/SparseCore/SparseVector.h +478 -0
- data/vendor/Eigen/src/SparseCore/SparseView.h +254 -0
- data/vendor/Eigen/src/SparseCore/TriangularSolver.h +315 -0
- data/vendor/Eigen/src/SparseLU/SparseLU.h +923 -0
- data/vendor/Eigen/src/SparseLU/SparseLUImpl.h +66 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_Memory.h +226 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_Structs.h +110 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_SupernodalMatrix.h +375 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_Utils.h +80 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_column_bmod.h +181 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_column_dfs.h +179 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_copy_to_ucol.h +107 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_gemm_kernel.h +280 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_heap_relax_snode.h +126 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_kernel_bmod.h +130 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_panel_bmod.h +223 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_panel_dfs.h +258 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_pivotL.h +137 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_pruneL.h +136 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_relax_snode.h +83 -0
- data/vendor/Eigen/src/SparseQR/SparseQR.h +758 -0
- data/vendor/Eigen/src/StlSupport/StdDeque.h +116 -0
- data/vendor/Eigen/src/StlSupport/StdList.h +106 -0
- data/vendor/Eigen/src/StlSupport/StdVector.h +131 -0
- data/vendor/Eigen/src/StlSupport/details.h +84 -0
- data/vendor/Eigen/src/SuperLUSupport/SuperLUSupport.h +1025 -0
- data/vendor/Eigen/src/UmfPackSupport/UmfPackSupport.h +642 -0
- data/vendor/Eigen/src/misc/Image.h +82 -0
- data/vendor/Eigen/src/misc/Kernel.h +79 -0
- data/vendor/Eigen/src/misc/RealSvd2x2.h +55 -0
- data/vendor/Eigen/src/misc/blas.h +440 -0
- data/vendor/Eigen/src/misc/lapack.h +152 -0
- data/vendor/Eigen/src/misc/lapacke.h +16292 -0
- data/vendor/Eigen/src/misc/lapacke_mangling.h +17 -0
- data/vendor/Eigen/src/plugins/ArrayCwiseBinaryOps.h +358 -0
- data/vendor/Eigen/src/plugins/ArrayCwiseUnaryOps.h +696 -0
- data/vendor/Eigen/src/plugins/BlockMethods.h +1442 -0
- data/vendor/Eigen/src/plugins/CommonCwiseBinaryOps.h +115 -0
- data/vendor/Eigen/src/plugins/CommonCwiseUnaryOps.h +177 -0
- data/vendor/Eigen/src/plugins/IndexedViewMethods.h +262 -0
- data/vendor/Eigen/src/plugins/MatrixCwiseBinaryOps.h +152 -0
- data/vendor/Eigen/src/plugins/MatrixCwiseUnaryOps.h +95 -0
- data/vendor/Eigen/src/plugins/ReshapedMethods.h +149 -0
- data/vendor/aarand/aarand.hpp +114 -0
- data/vendor/annoy/annoylib.h +1495 -0
- data/vendor/annoy/kissrandom.h +120 -0
- data/vendor/annoy/mman.h +242 -0
- data/vendor/hnswlib/bruteforce.h +152 -0
- data/vendor/hnswlib/hnswalg.h +1192 -0
- data/vendor/hnswlib/hnswlib.h +108 -0
- data/vendor/hnswlib/space_ip.h +282 -0
- data/vendor/hnswlib/space_l2.h +281 -0
- data/vendor/hnswlib/visited_list_pool.h +79 -0
- data/vendor/irlba/irlba.hpp +575 -0
- data/vendor/irlba/lanczos.hpp +212 -0
- data/vendor/irlba/parallel.hpp +474 -0
- data/vendor/irlba/utils.hpp +224 -0
- data/vendor/irlba/wrappers.hpp +228 -0
- data/vendor/kmeans/Base.hpp +75 -0
- data/vendor/kmeans/Details.hpp +79 -0
- data/vendor/kmeans/HartiganWong.hpp +492 -0
- data/vendor/kmeans/InitializeKmeansPP.hpp +144 -0
- data/vendor/kmeans/InitializeNone.hpp +44 -0
- data/vendor/kmeans/InitializePCAPartition.hpp +309 -0
- data/vendor/kmeans/InitializeRandom.hpp +91 -0
- data/vendor/kmeans/Kmeans.hpp +161 -0
- data/vendor/kmeans/Lloyd.hpp +134 -0
- data/vendor/kmeans/MiniBatch.hpp +269 -0
- data/vendor/kmeans/QuickSearch.hpp +179 -0
- data/vendor/kmeans/compute_centroids.hpp +32 -0
- data/vendor/kmeans/compute_wcss.hpp +27 -0
- data/vendor/kmeans/is_edge_case.hpp +42 -0
- data/vendor/kmeans/random.hpp +55 -0
- data/vendor/knncolle/Annoy/Annoy.hpp +193 -0
- data/vendor/knncolle/BruteForce/BruteForce.hpp +120 -0
- data/vendor/knncolle/Hnsw/Hnsw.hpp +225 -0
- data/vendor/knncolle/Kmknn/Kmknn.hpp +286 -0
- data/vendor/knncolle/VpTree/VpTree.hpp +256 -0
- data/vendor/knncolle/knncolle.hpp +34 -0
- data/vendor/knncolle/utils/Base.hpp +100 -0
- data/vendor/knncolle/utils/NeighborQueue.hpp +94 -0
- data/vendor/knncolle/utils/distances.hpp +98 -0
- data/vendor/knncolle/utils/find_nearest_neighbors.hpp +112 -0
- data/vendor/powerit/PowerIterations.hpp +157 -0
- data/vendor/umappp/NeighborList.hpp +37 -0
- data/vendor/umappp/Umap.hpp +662 -0
- data/vendor/umappp/combine_neighbor_sets.hpp +95 -0
- data/vendor/umappp/find_ab.hpp +157 -0
- data/vendor/umappp/neighbor_similarities.hpp +136 -0
- data/vendor/umappp/optimize_layout.hpp +285 -0
- data/vendor/umappp/spectral_init.hpp +181 -0
- data/vendor/umappp/umappp.hpp +13 -0
- metadata +465 -0
@@ -0,0 +1,91 @@
|
|
1
|
+
/*
|
2
|
+
Copyright (c) 2011, Intel Corporation. All rights reserved.
|
3
|
+
|
4
|
+
Redistribution and use in source and binary forms, with or without modification,
|
5
|
+
are permitted provided that the following conditions are met:
|
6
|
+
|
7
|
+
* Redistributions of source code must retain the above copyright notice, this
|
8
|
+
list of conditions and the following disclaimer.
|
9
|
+
* Redistributions in binary form must reproduce the above copyright notice,
|
10
|
+
this list of conditions and the following disclaimer in the documentation
|
11
|
+
and/or other materials provided with the distribution.
|
12
|
+
* Neither the name of Intel Corporation nor the names of its contributors may
|
13
|
+
be used to endorse or promote products derived from this software without
|
14
|
+
specific prior written permission.
|
15
|
+
|
16
|
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
17
|
+
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
18
|
+
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
19
|
+
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
|
20
|
+
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
21
|
+
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
22
|
+
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
23
|
+
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
24
|
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
25
|
+
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
26
|
+
|
27
|
+
********************************************************************************
|
28
|
+
* Content : Eigen bindings to LAPACKe
|
29
|
+
* Singular Value Decomposition - SVD.
|
30
|
+
********************************************************************************
|
31
|
+
*/
|
32
|
+
|
33
|
+
#ifndef EIGEN_JACOBISVD_LAPACKE_H
|
34
|
+
#define EIGEN_JACOBISVD_LAPACKE_H
|
35
|
+
|
36
|
+
namespace Eigen {
|
37
|
+
|
38
|
+
/** \internal Specialization for the data types supported by LAPACKe */
|
39
|
+
|
40
|
+
#define EIGEN_LAPACKE_SVD(EIGTYPE, LAPACKE_TYPE, LAPACKE_RTYPE, LAPACKE_PREFIX, EIGCOLROW, LAPACKE_COLROW) \
|
41
|
+
template<> inline \
|
42
|
+
JacobiSVD<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic>, ColPivHouseholderQRPreconditioner>& \
|
43
|
+
JacobiSVD<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic>, ColPivHouseholderQRPreconditioner>::compute(const Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic>& matrix, unsigned int computationOptions) \
|
44
|
+
{ \
|
45
|
+
typedef Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic> MatrixType; \
|
46
|
+
/*typedef MatrixType::Scalar Scalar;*/ \
|
47
|
+
/*typedef MatrixType::RealScalar RealScalar;*/ \
|
48
|
+
allocate(matrix.rows(), matrix.cols(), computationOptions); \
|
49
|
+
\
|
50
|
+
/*const RealScalar precision = RealScalar(2) * NumTraits<Scalar>::epsilon();*/ \
|
51
|
+
m_nonzeroSingularValues = m_diagSize; \
|
52
|
+
\
|
53
|
+
lapack_int lda = internal::convert_index<lapack_int>(matrix.outerStride()), ldu, ldvt; \
|
54
|
+
lapack_int matrix_order = LAPACKE_COLROW; \
|
55
|
+
char jobu, jobvt; \
|
56
|
+
LAPACKE_TYPE *u, *vt, dummy; \
|
57
|
+
jobu = (m_computeFullU) ? 'A' : (m_computeThinU) ? 'S' : 'N'; \
|
58
|
+
jobvt = (m_computeFullV) ? 'A' : (m_computeThinV) ? 'S' : 'N'; \
|
59
|
+
if (computeU()) { \
|
60
|
+
ldu = internal::convert_index<lapack_int>(m_matrixU.outerStride()); \
|
61
|
+
u = (LAPACKE_TYPE*)m_matrixU.data(); \
|
62
|
+
} else { ldu=1; u=&dummy; }\
|
63
|
+
MatrixType localV; \
|
64
|
+
lapack_int vt_rows = (m_computeFullV) ? internal::convert_index<lapack_int>(m_cols) : (m_computeThinV) ? internal::convert_index<lapack_int>(m_diagSize) : 1; \
|
65
|
+
if (computeV()) { \
|
66
|
+
localV.resize(vt_rows, m_cols); \
|
67
|
+
ldvt = internal::convert_index<lapack_int>(localV.outerStride()); \
|
68
|
+
vt = (LAPACKE_TYPE*)localV.data(); \
|
69
|
+
} else { ldvt=1; vt=&dummy; }\
|
70
|
+
Matrix<LAPACKE_RTYPE, Dynamic, Dynamic> superb; superb.resize(m_diagSize, 1); \
|
71
|
+
MatrixType m_temp; m_temp = matrix; \
|
72
|
+
LAPACKE_##LAPACKE_PREFIX##gesvd( matrix_order, jobu, jobvt, internal::convert_index<lapack_int>(m_rows), internal::convert_index<lapack_int>(m_cols), (LAPACKE_TYPE*)m_temp.data(), lda, (LAPACKE_RTYPE*)m_singularValues.data(), u, ldu, vt, ldvt, superb.data()); \
|
73
|
+
if (computeV()) m_matrixV = localV.adjoint(); \
|
74
|
+
/* for(int i=0;i<m_diagSize;i++) if (m_singularValues.coeffRef(i) < precision) { m_nonzeroSingularValues--; m_singularValues.coeffRef(i)=RealScalar(0);}*/ \
|
75
|
+
m_isInitialized = true; \
|
76
|
+
return *this; \
|
77
|
+
}
|
78
|
+
|
79
|
+
EIGEN_LAPACKE_SVD(double, double, double, d, ColMajor, LAPACK_COL_MAJOR)
|
80
|
+
EIGEN_LAPACKE_SVD(float, float, float , s, ColMajor, LAPACK_COL_MAJOR)
|
81
|
+
EIGEN_LAPACKE_SVD(dcomplex, lapack_complex_double, double, z, ColMajor, LAPACK_COL_MAJOR)
|
82
|
+
EIGEN_LAPACKE_SVD(scomplex, lapack_complex_float, float , c, ColMajor, LAPACK_COL_MAJOR)
|
83
|
+
|
84
|
+
EIGEN_LAPACKE_SVD(double, double, double, d, RowMajor, LAPACK_ROW_MAJOR)
|
85
|
+
EIGEN_LAPACKE_SVD(float, float, float , s, RowMajor, LAPACK_ROW_MAJOR)
|
86
|
+
EIGEN_LAPACKE_SVD(dcomplex, lapack_complex_double, double, z, RowMajor, LAPACK_ROW_MAJOR)
|
87
|
+
EIGEN_LAPACKE_SVD(scomplex, lapack_complex_float, float , c, RowMajor, LAPACK_ROW_MAJOR)
|
88
|
+
|
89
|
+
} // end namespace Eigen
|
90
|
+
|
91
|
+
#endif // EIGEN_JACOBISVD_LAPACKE_H
|
@@ -0,0 +1,376 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2009-2010 Benoit Jacob <jacob.benoit.1@gmail.com>
|
5
|
+
// Copyright (C) 2014 Gael Guennebaud <gael.guennebaud@inria.fr>
|
6
|
+
//
|
7
|
+
// Copyright (C) 2013 Gauthier Brun <brun.gauthier@gmail.com>
|
8
|
+
// Copyright (C) 2013 Nicolas Carre <nicolas.carre@ensimag.fr>
|
9
|
+
// Copyright (C) 2013 Jean Ceccato <jean.ceccato@ensimag.fr>
|
10
|
+
// Copyright (C) 2013 Pierre Zoppitelli <pierre.zoppitelli@ensimag.fr>
|
11
|
+
//
|
12
|
+
// This Source Code Form is subject to the terms of the Mozilla
|
13
|
+
// Public License v. 2.0. If a copy of the MPL was not distributed
|
14
|
+
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
15
|
+
|
16
|
+
#ifndef EIGEN_SVDBASE_H
|
17
|
+
#define EIGEN_SVDBASE_H
|
18
|
+
|
19
|
+
namespace Eigen {
|
20
|
+
|
21
|
+
namespace internal {
|
22
|
+
template<typename Derived> struct traits<SVDBase<Derived> >
|
23
|
+
: traits<Derived>
|
24
|
+
{
|
25
|
+
typedef MatrixXpr XprKind;
|
26
|
+
typedef SolverStorage StorageKind;
|
27
|
+
typedef int StorageIndex;
|
28
|
+
enum { Flags = 0 };
|
29
|
+
};
|
30
|
+
}
|
31
|
+
|
32
|
+
/** \ingroup SVD_Module
|
33
|
+
*
|
34
|
+
*
|
35
|
+
* \class SVDBase
|
36
|
+
*
|
37
|
+
* \brief Base class of SVD algorithms
|
38
|
+
*
|
39
|
+
* \tparam Derived the type of the actual SVD decomposition
|
40
|
+
*
|
41
|
+
* SVD decomposition consists in decomposing any n-by-p matrix \a A as a product
|
42
|
+
* \f[ A = U S V^* \f]
|
43
|
+
* where \a U is a n-by-n unitary, \a V is a p-by-p unitary, and \a S is a n-by-p real positive matrix which is zero outside of its main diagonal;
|
44
|
+
* the diagonal entries of S are known as the \em singular \em values of \a A and the columns of \a U and \a V are known as the left
|
45
|
+
* and right \em singular \em vectors of \a A respectively.
|
46
|
+
*
|
47
|
+
* Singular values are always sorted in decreasing order.
|
48
|
+
*
|
49
|
+
*
|
50
|
+
* You can ask for only \em thin \a U or \a V to be computed, meaning the following. In case of a rectangular n-by-p matrix, letting \a m be the
|
51
|
+
* smaller value among \a n and \a p, there are only \a m singular vectors; the remaining columns of \a U and \a V do not correspond to actual
|
52
|
+
* singular vectors. Asking for \em thin \a U or \a V means asking for only their \a m first columns to be formed. So \a U is then a n-by-m matrix,
|
53
|
+
* and \a V is then a p-by-m matrix. Notice that thin \a U and \a V are all you need for (least squares) solving.
|
54
|
+
*
|
55
|
+
* The status of the computation can be retrived using the \a info() method. Unless \a info() returns \a Success, the results should be not
|
56
|
+
* considered well defined.
|
57
|
+
*
|
58
|
+
* If the input matrix has inf or nan coefficients, the result of the computation is undefined, and \a info() will return \a InvalidInput, but the computation is guaranteed to
|
59
|
+
* terminate in finite (and reasonable) time.
|
60
|
+
* \sa class BDCSVD, class JacobiSVD
|
61
|
+
*/
|
62
|
+
template<typename Derived> class SVDBase
|
63
|
+
: public SolverBase<SVDBase<Derived> >
|
64
|
+
{
|
65
|
+
public:
|
66
|
+
|
67
|
+
template<typename Derived_>
|
68
|
+
friend struct internal::solve_assertion;
|
69
|
+
|
70
|
+
typedef typename internal::traits<Derived>::MatrixType MatrixType;
|
71
|
+
typedef typename MatrixType::Scalar Scalar;
|
72
|
+
typedef typename NumTraits<typename MatrixType::Scalar>::Real RealScalar;
|
73
|
+
typedef typename Eigen::internal::traits<SVDBase>::StorageIndex StorageIndex;
|
74
|
+
typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3
|
75
|
+
enum {
|
76
|
+
RowsAtCompileTime = MatrixType::RowsAtCompileTime,
|
77
|
+
ColsAtCompileTime = MatrixType::ColsAtCompileTime,
|
78
|
+
DiagSizeAtCompileTime = EIGEN_SIZE_MIN_PREFER_DYNAMIC(RowsAtCompileTime,ColsAtCompileTime),
|
79
|
+
MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime,
|
80
|
+
MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime,
|
81
|
+
MaxDiagSizeAtCompileTime = EIGEN_SIZE_MIN_PREFER_FIXED(MaxRowsAtCompileTime,MaxColsAtCompileTime),
|
82
|
+
MatrixOptions = MatrixType::Options
|
83
|
+
};
|
84
|
+
|
85
|
+
typedef Matrix<Scalar, RowsAtCompileTime, RowsAtCompileTime, MatrixOptions, MaxRowsAtCompileTime, MaxRowsAtCompileTime> MatrixUType;
|
86
|
+
typedef Matrix<Scalar, ColsAtCompileTime, ColsAtCompileTime, MatrixOptions, MaxColsAtCompileTime, MaxColsAtCompileTime> MatrixVType;
|
87
|
+
typedef typename internal::plain_diag_type<MatrixType, RealScalar>::type SingularValuesType;
|
88
|
+
|
89
|
+
Derived& derived() { return *static_cast<Derived*>(this); }
|
90
|
+
const Derived& derived() const { return *static_cast<const Derived*>(this); }
|
91
|
+
|
92
|
+
/** \returns the \a U matrix.
|
93
|
+
*
|
94
|
+
* For the SVD decomposition of a n-by-p matrix, letting \a m be the minimum of \a n and \a p,
|
95
|
+
* the U matrix is n-by-n if you asked for \link Eigen::ComputeFullU ComputeFullU \endlink, and is n-by-m if you asked for \link Eigen::ComputeThinU ComputeThinU \endlink.
|
96
|
+
*
|
97
|
+
* The \a m first columns of \a U are the left singular vectors of the matrix being decomposed.
|
98
|
+
*
|
99
|
+
* This method asserts that you asked for \a U to be computed.
|
100
|
+
*/
|
101
|
+
const MatrixUType& matrixU() const
|
102
|
+
{
|
103
|
+
_check_compute_assertions();
|
104
|
+
eigen_assert(computeU() && "This SVD decomposition didn't compute U. Did you ask for it?");
|
105
|
+
return m_matrixU;
|
106
|
+
}
|
107
|
+
|
108
|
+
/** \returns the \a V matrix.
|
109
|
+
*
|
110
|
+
* For the SVD decomposition of a n-by-p matrix, letting \a m be the minimum of \a n and \a p,
|
111
|
+
* the V matrix is p-by-p if you asked for \link Eigen::ComputeFullV ComputeFullV \endlink, and is p-by-m if you asked for \link Eigen::ComputeThinV ComputeThinV \endlink.
|
112
|
+
*
|
113
|
+
* The \a m first columns of \a V are the right singular vectors of the matrix being decomposed.
|
114
|
+
*
|
115
|
+
* This method asserts that you asked for \a V to be computed.
|
116
|
+
*/
|
117
|
+
const MatrixVType& matrixV() const
|
118
|
+
{
|
119
|
+
_check_compute_assertions();
|
120
|
+
eigen_assert(computeV() && "This SVD decomposition didn't compute V. Did you ask for it?");
|
121
|
+
return m_matrixV;
|
122
|
+
}
|
123
|
+
|
124
|
+
/** \returns the vector of singular values.
|
125
|
+
*
|
126
|
+
* For the SVD decomposition of a n-by-p matrix, letting \a m be the minimum of \a n and \a p, the
|
127
|
+
* returned vector has size \a m. Singular values are always sorted in decreasing order.
|
128
|
+
*/
|
129
|
+
const SingularValuesType& singularValues() const
|
130
|
+
{
|
131
|
+
_check_compute_assertions();
|
132
|
+
return m_singularValues;
|
133
|
+
}
|
134
|
+
|
135
|
+
/** \returns the number of singular values that are not exactly 0 */
|
136
|
+
Index nonzeroSingularValues() const
|
137
|
+
{
|
138
|
+
_check_compute_assertions();
|
139
|
+
return m_nonzeroSingularValues;
|
140
|
+
}
|
141
|
+
|
142
|
+
/** \returns the rank of the matrix of which \c *this is the SVD.
|
143
|
+
*
|
144
|
+
* \note This method has to determine which singular values should be considered nonzero.
|
145
|
+
* For that, it uses the threshold value that you can control by calling
|
146
|
+
* setThreshold(const RealScalar&).
|
147
|
+
*/
|
148
|
+
inline Index rank() const
|
149
|
+
{
|
150
|
+
using std::abs;
|
151
|
+
_check_compute_assertions();
|
152
|
+
if(m_singularValues.size()==0) return 0;
|
153
|
+
RealScalar premultiplied_threshold = numext::maxi<RealScalar>(m_singularValues.coeff(0) * threshold(), (std::numeric_limits<RealScalar>::min)());
|
154
|
+
Index i = m_nonzeroSingularValues-1;
|
155
|
+
while(i>=0 && m_singularValues.coeff(i) < premultiplied_threshold) --i;
|
156
|
+
return i+1;
|
157
|
+
}
|
158
|
+
|
159
|
+
/** Allows to prescribe a threshold to be used by certain methods, such as rank() and solve(),
|
160
|
+
* which need to determine when singular values are to be considered nonzero.
|
161
|
+
* This is not used for the SVD decomposition itself.
|
162
|
+
*
|
163
|
+
* When it needs to get the threshold value, Eigen calls threshold().
|
164
|
+
* The default is \c NumTraits<Scalar>::epsilon()
|
165
|
+
*
|
166
|
+
* \param threshold The new value to use as the threshold.
|
167
|
+
*
|
168
|
+
* A singular value will be considered nonzero if its value is strictly greater than
|
169
|
+
* \f$ \vert singular value \vert \leqslant threshold \times \vert max singular value \vert \f$.
|
170
|
+
*
|
171
|
+
* If you want to come back to the default behavior, call setThreshold(Default_t)
|
172
|
+
*/
|
173
|
+
Derived& setThreshold(const RealScalar& threshold)
|
174
|
+
{
|
175
|
+
m_usePrescribedThreshold = true;
|
176
|
+
m_prescribedThreshold = threshold;
|
177
|
+
return derived();
|
178
|
+
}
|
179
|
+
|
180
|
+
/** Allows to come back to the default behavior, letting Eigen use its default formula for
|
181
|
+
* determining the threshold.
|
182
|
+
*
|
183
|
+
* You should pass the special object Eigen::Default as parameter here.
|
184
|
+
* \code svd.setThreshold(Eigen::Default); \endcode
|
185
|
+
*
|
186
|
+
* See the documentation of setThreshold(const RealScalar&).
|
187
|
+
*/
|
188
|
+
Derived& setThreshold(Default_t)
|
189
|
+
{
|
190
|
+
m_usePrescribedThreshold = false;
|
191
|
+
return derived();
|
192
|
+
}
|
193
|
+
|
194
|
+
/** Returns the threshold that will be used by certain methods such as rank().
|
195
|
+
*
|
196
|
+
* See the documentation of setThreshold(const RealScalar&).
|
197
|
+
*/
|
198
|
+
RealScalar threshold() const
|
199
|
+
{
|
200
|
+
eigen_assert(m_isInitialized || m_usePrescribedThreshold);
|
201
|
+
// this temporary is needed to workaround a MSVC issue
|
202
|
+
Index diagSize = (std::max<Index>)(1,m_diagSize);
|
203
|
+
return m_usePrescribedThreshold ? m_prescribedThreshold
|
204
|
+
: RealScalar(diagSize)*NumTraits<Scalar>::epsilon();
|
205
|
+
}
|
206
|
+
|
207
|
+
/** \returns true if \a U (full or thin) is asked for in this SVD decomposition */
|
208
|
+
inline bool computeU() const { return m_computeFullU || m_computeThinU; }
|
209
|
+
/** \returns true if \a V (full or thin) is asked for in this SVD decomposition */
|
210
|
+
inline bool computeV() const { return m_computeFullV || m_computeThinV; }
|
211
|
+
|
212
|
+
inline Index rows() const { return m_rows; }
|
213
|
+
inline Index cols() const { return m_cols; }
|
214
|
+
|
215
|
+
#ifdef EIGEN_PARSED_BY_DOXYGEN
|
216
|
+
/** \returns a (least squares) solution of \f$ A x = b \f$ using the current SVD decomposition of A.
|
217
|
+
*
|
218
|
+
* \param b the right-hand-side of the equation to solve.
|
219
|
+
*
|
220
|
+
* \note Solving requires both U and V to be computed. Thin U and V are enough, there is no need for full U or V.
|
221
|
+
*
|
222
|
+
* \note SVD solving is implicitly least-squares. Thus, this method serves both purposes of exact solving and least-squares solving.
|
223
|
+
* In other words, the returned solution is guaranteed to minimize the Euclidean norm \f$ \Vert A x - b \Vert \f$.
|
224
|
+
*/
|
225
|
+
template<typename Rhs>
|
226
|
+
inline const Solve<Derived, Rhs>
|
227
|
+
solve(const MatrixBase<Rhs>& b) const;
|
228
|
+
#endif
|
229
|
+
|
230
|
+
|
231
|
+
/** \brief Reports whether previous computation was successful.
|
232
|
+
*
|
233
|
+
* \returns \c Success if computation was successful.
|
234
|
+
*/
|
235
|
+
EIGEN_DEVICE_FUNC
|
236
|
+
ComputationInfo info() const
|
237
|
+
{
|
238
|
+
eigen_assert(m_isInitialized && "SVD is not initialized.");
|
239
|
+
return m_info;
|
240
|
+
}
|
241
|
+
|
242
|
+
#ifndef EIGEN_PARSED_BY_DOXYGEN
|
243
|
+
template<typename RhsType, typename DstType>
|
244
|
+
void _solve_impl(const RhsType &rhs, DstType &dst) const;
|
245
|
+
|
246
|
+
template<bool Conjugate, typename RhsType, typename DstType>
|
247
|
+
void _solve_impl_transposed(const RhsType &rhs, DstType &dst) const;
|
248
|
+
#endif
|
249
|
+
|
250
|
+
protected:
|
251
|
+
|
252
|
+
static void check_template_parameters()
|
253
|
+
{
|
254
|
+
EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar);
|
255
|
+
}
|
256
|
+
|
257
|
+
void _check_compute_assertions() const {
|
258
|
+
eigen_assert(m_isInitialized && "SVD is not initialized.");
|
259
|
+
}
|
260
|
+
|
261
|
+
template<bool Transpose_, typename Rhs>
|
262
|
+
void _check_solve_assertion(const Rhs& b) const {
|
263
|
+
EIGEN_ONLY_USED_FOR_DEBUG(b);
|
264
|
+
_check_compute_assertions();
|
265
|
+
eigen_assert(computeU() && computeV() && "SVDBase::solve(): Both unitaries U and V are required to be computed (thin unitaries suffice).");
|
266
|
+
eigen_assert((Transpose_?cols():rows())==b.rows() && "SVDBase::solve(): invalid number of rows of the right hand side matrix b");
|
267
|
+
}
|
268
|
+
|
269
|
+
// return true if already allocated
|
270
|
+
bool allocate(Index rows, Index cols, unsigned int computationOptions) ;
|
271
|
+
|
272
|
+
MatrixUType m_matrixU;
|
273
|
+
MatrixVType m_matrixV;
|
274
|
+
SingularValuesType m_singularValues;
|
275
|
+
ComputationInfo m_info;
|
276
|
+
bool m_isInitialized, m_isAllocated, m_usePrescribedThreshold;
|
277
|
+
bool m_computeFullU, m_computeThinU;
|
278
|
+
bool m_computeFullV, m_computeThinV;
|
279
|
+
unsigned int m_computationOptions;
|
280
|
+
Index m_nonzeroSingularValues, m_rows, m_cols, m_diagSize;
|
281
|
+
RealScalar m_prescribedThreshold;
|
282
|
+
|
283
|
+
/** \brief Default Constructor.
|
284
|
+
*
|
285
|
+
* Default constructor of SVDBase
|
286
|
+
*/
|
287
|
+
SVDBase()
|
288
|
+
: m_info(Success),
|
289
|
+
m_isInitialized(false),
|
290
|
+
m_isAllocated(false),
|
291
|
+
m_usePrescribedThreshold(false),
|
292
|
+
m_computeFullU(false),
|
293
|
+
m_computeThinU(false),
|
294
|
+
m_computeFullV(false),
|
295
|
+
m_computeThinV(false),
|
296
|
+
m_computationOptions(0),
|
297
|
+
m_rows(-1), m_cols(-1), m_diagSize(0)
|
298
|
+
{
|
299
|
+
check_template_parameters();
|
300
|
+
}
|
301
|
+
|
302
|
+
|
303
|
+
};
|
304
|
+
|
305
|
+
#ifndef EIGEN_PARSED_BY_DOXYGEN
|
306
|
+
template<typename Derived>
|
307
|
+
template<typename RhsType, typename DstType>
|
308
|
+
void SVDBase<Derived>::_solve_impl(const RhsType &rhs, DstType &dst) const
|
309
|
+
{
|
310
|
+
// A = U S V^*
|
311
|
+
// So A^{-1} = V S^{-1} U^*
|
312
|
+
|
313
|
+
Matrix<typename RhsType::Scalar, Dynamic, RhsType::ColsAtCompileTime, 0, MatrixType::MaxRowsAtCompileTime, RhsType::MaxColsAtCompileTime> tmp;
|
314
|
+
Index l_rank = rank();
|
315
|
+
tmp.noalias() = m_matrixU.leftCols(l_rank).adjoint() * rhs;
|
316
|
+
tmp = m_singularValues.head(l_rank).asDiagonal().inverse() * tmp;
|
317
|
+
dst = m_matrixV.leftCols(l_rank) * tmp;
|
318
|
+
}
|
319
|
+
|
320
|
+
template<typename Derived>
|
321
|
+
template<bool Conjugate, typename RhsType, typename DstType>
|
322
|
+
void SVDBase<Derived>::_solve_impl_transposed(const RhsType &rhs, DstType &dst) const
|
323
|
+
{
|
324
|
+
// A = U S V^*
|
325
|
+
// So A^{-*} = U S^{-1} V^*
|
326
|
+
// And A^{-T} = U_conj S^{-1} V^T
|
327
|
+
Matrix<typename RhsType::Scalar, Dynamic, RhsType::ColsAtCompileTime, 0, MatrixType::MaxRowsAtCompileTime, RhsType::MaxColsAtCompileTime> tmp;
|
328
|
+
Index l_rank = rank();
|
329
|
+
|
330
|
+
tmp.noalias() = m_matrixV.leftCols(l_rank).transpose().template conjugateIf<Conjugate>() * rhs;
|
331
|
+
tmp = m_singularValues.head(l_rank).asDiagonal().inverse() * tmp;
|
332
|
+
dst = m_matrixU.template conjugateIf<!Conjugate>().leftCols(l_rank) * tmp;
|
333
|
+
}
|
334
|
+
#endif
|
335
|
+
|
336
|
+
template<typename MatrixType>
|
337
|
+
bool SVDBase<MatrixType>::allocate(Index rows, Index cols, unsigned int computationOptions)
|
338
|
+
{
|
339
|
+
eigen_assert(rows >= 0 && cols >= 0);
|
340
|
+
|
341
|
+
if (m_isAllocated &&
|
342
|
+
rows == m_rows &&
|
343
|
+
cols == m_cols &&
|
344
|
+
computationOptions == m_computationOptions)
|
345
|
+
{
|
346
|
+
return true;
|
347
|
+
}
|
348
|
+
|
349
|
+
m_rows = rows;
|
350
|
+
m_cols = cols;
|
351
|
+
m_info = Success;
|
352
|
+
m_isInitialized = false;
|
353
|
+
m_isAllocated = true;
|
354
|
+
m_computationOptions = computationOptions;
|
355
|
+
m_computeFullU = (computationOptions & ComputeFullU) != 0;
|
356
|
+
m_computeThinU = (computationOptions & ComputeThinU) != 0;
|
357
|
+
m_computeFullV = (computationOptions & ComputeFullV) != 0;
|
358
|
+
m_computeThinV = (computationOptions & ComputeThinV) != 0;
|
359
|
+
eigen_assert(!(m_computeFullU && m_computeThinU) && "SVDBase: you can't ask for both full and thin U");
|
360
|
+
eigen_assert(!(m_computeFullV && m_computeThinV) && "SVDBase: you can't ask for both full and thin V");
|
361
|
+
eigen_assert(EIGEN_IMPLIES(m_computeThinU || m_computeThinV, MatrixType::ColsAtCompileTime==Dynamic) &&
|
362
|
+
"SVDBase: thin U and V are only available when your matrix has a dynamic number of columns.");
|
363
|
+
|
364
|
+
m_diagSize = (std::min)(m_rows, m_cols);
|
365
|
+
m_singularValues.resize(m_diagSize);
|
366
|
+
if(RowsAtCompileTime==Dynamic)
|
367
|
+
m_matrixU.resize(m_rows, m_computeFullU ? m_rows : m_computeThinU ? m_diagSize : 0);
|
368
|
+
if(ColsAtCompileTime==Dynamic)
|
369
|
+
m_matrixV.resize(m_cols, m_computeFullV ? m_cols : m_computeThinV ? m_diagSize : 0);
|
370
|
+
|
371
|
+
return false;
|
372
|
+
}
|
373
|
+
|
374
|
+
}// end namespace
|
375
|
+
|
376
|
+
#endif // EIGEN_SVDBASE_H
|