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,414 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2010 Benoit Jacob <jacob.benoit.1@gmail.com>
|
5
|
+
// Copyright (C) 2013-2014 Gael Guennebaud <gael.guennebaud@inria.fr>
|
6
|
+
//
|
7
|
+
// This Source Code Form is subject to the terms of the Mozilla
|
8
|
+
// Public License v. 2.0. If a copy of the MPL was not distributed
|
9
|
+
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
10
|
+
|
11
|
+
#ifndef EIGEN_BIDIAGONALIZATION_H
|
12
|
+
#define EIGEN_BIDIAGONALIZATION_H
|
13
|
+
|
14
|
+
namespace Eigen {
|
15
|
+
|
16
|
+
namespace internal {
|
17
|
+
// UpperBidiagonalization will probably be replaced by a Bidiagonalization class, don't want to make it stable API.
|
18
|
+
// At the same time, it's useful to keep for now as it's about the only thing that is testing the BandMatrix class.
|
19
|
+
|
20
|
+
template<typename _MatrixType> class UpperBidiagonalization
|
21
|
+
{
|
22
|
+
public:
|
23
|
+
|
24
|
+
typedef _MatrixType MatrixType;
|
25
|
+
enum {
|
26
|
+
RowsAtCompileTime = MatrixType::RowsAtCompileTime,
|
27
|
+
ColsAtCompileTime = MatrixType::ColsAtCompileTime,
|
28
|
+
ColsAtCompileTimeMinusOne = internal::decrement_size<ColsAtCompileTime>::ret
|
29
|
+
};
|
30
|
+
typedef typename MatrixType::Scalar Scalar;
|
31
|
+
typedef typename MatrixType::RealScalar RealScalar;
|
32
|
+
typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3
|
33
|
+
typedef Matrix<Scalar, 1, ColsAtCompileTime> RowVectorType;
|
34
|
+
typedef Matrix<Scalar, RowsAtCompileTime, 1> ColVectorType;
|
35
|
+
typedef BandMatrix<RealScalar, ColsAtCompileTime, ColsAtCompileTime, 1, 0, RowMajor> BidiagonalType;
|
36
|
+
typedef Matrix<Scalar, ColsAtCompileTime, 1> DiagVectorType;
|
37
|
+
typedef Matrix<Scalar, ColsAtCompileTimeMinusOne, 1> SuperDiagVectorType;
|
38
|
+
typedef HouseholderSequence<
|
39
|
+
const MatrixType,
|
40
|
+
const typename internal::remove_all<typename Diagonal<const MatrixType,0>::ConjugateReturnType>::type
|
41
|
+
> HouseholderUSequenceType;
|
42
|
+
typedef HouseholderSequence<
|
43
|
+
const typename internal::remove_all<typename MatrixType::ConjugateReturnType>::type,
|
44
|
+
Diagonal<const MatrixType,1>,
|
45
|
+
OnTheRight
|
46
|
+
> HouseholderVSequenceType;
|
47
|
+
|
48
|
+
/**
|
49
|
+
* \brief Default Constructor.
|
50
|
+
*
|
51
|
+
* The default constructor is useful in cases in which the user intends to
|
52
|
+
* perform decompositions via Bidiagonalization::compute(const MatrixType&).
|
53
|
+
*/
|
54
|
+
UpperBidiagonalization() : m_householder(), m_bidiagonal(), m_isInitialized(false) {}
|
55
|
+
|
56
|
+
explicit UpperBidiagonalization(const MatrixType& matrix)
|
57
|
+
: m_householder(matrix.rows(), matrix.cols()),
|
58
|
+
m_bidiagonal(matrix.cols(), matrix.cols()),
|
59
|
+
m_isInitialized(false)
|
60
|
+
{
|
61
|
+
compute(matrix);
|
62
|
+
}
|
63
|
+
|
64
|
+
UpperBidiagonalization& compute(const MatrixType& matrix);
|
65
|
+
UpperBidiagonalization& computeUnblocked(const MatrixType& matrix);
|
66
|
+
|
67
|
+
const MatrixType& householder() const { return m_householder; }
|
68
|
+
const BidiagonalType& bidiagonal() const { return m_bidiagonal; }
|
69
|
+
|
70
|
+
const HouseholderUSequenceType householderU() const
|
71
|
+
{
|
72
|
+
eigen_assert(m_isInitialized && "UpperBidiagonalization is not initialized.");
|
73
|
+
return HouseholderUSequenceType(m_householder, m_householder.diagonal().conjugate());
|
74
|
+
}
|
75
|
+
|
76
|
+
const HouseholderVSequenceType householderV() // const here gives nasty errors and i'm lazy
|
77
|
+
{
|
78
|
+
eigen_assert(m_isInitialized && "UpperBidiagonalization is not initialized.");
|
79
|
+
return HouseholderVSequenceType(m_householder.conjugate(), m_householder.const_derived().template diagonal<1>())
|
80
|
+
.setLength(m_householder.cols()-1)
|
81
|
+
.setShift(1);
|
82
|
+
}
|
83
|
+
|
84
|
+
protected:
|
85
|
+
MatrixType m_householder;
|
86
|
+
BidiagonalType m_bidiagonal;
|
87
|
+
bool m_isInitialized;
|
88
|
+
};
|
89
|
+
|
90
|
+
// Standard upper bidiagonalization without fancy optimizations
|
91
|
+
// This version should be faster for small matrix size
|
92
|
+
template<typename MatrixType>
|
93
|
+
void upperbidiagonalization_inplace_unblocked(MatrixType& mat,
|
94
|
+
typename MatrixType::RealScalar *diagonal,
|
95
|
+
typename MatrixType::RealScalar *upper_diagonal,
|
96
|
+
typename MatrixType::Scalar* tempData = 0)
|
97
|
+
{
|
98
|
+
typedef typename MatrixType::Scalar Scalar;
|
99
|
+
|
100
|
+
Index rows = mat.rows();
|
101
|
+
Index cols = mat.cols();
|
102
|
+
|
103
|
+
typedef Matrix<Scalar,Dynamic,1,ColMajor,MatrixType::MaxRowsAtCompileTime,1> TempType;
|
104
|
+
TempType tempVector;
|
105
|
+
if(tempData==0)
|
106
|
+
{
|
107
|
+
tempVector.resize(rows);
|
108
|
+
tempData = tempVector.data();
|
109
|
+
}
|
110
|
+
|
111
|
+
for (Index k = 0; /* breaks at k==cols-1 below */ ; ++k)
|
112
|
+
{
|
113
|
+
Index remainingRows = rows - k;
|
114
|
+
Index remainingCols = cols - k - 1;
|
115
|
+
|
116
|
+
// construct left householder transform in-place in A
|
117
|
+
mat.col(k).tail(remainingRows)
|
118
|
+
.makeHouseholderInPlace(mat.coeffRef(k,k), diagonal[k]);
|
119
|
+
// apply householder transform to remaining part of A on the left
|
120
|
+
mat.bottomRightCorner(remainingRows, remainingCols)
|
121
|
+
.applyHouseholderOnTheLeft(mat.col(k).tail(remainingRows-1), mat.coeff(k,k), tempData);
|
122
|
+
|
123
|
+
if(k == cols-1) break;
|
124
|
+
|
125
|
+
// construct right householder transform in-place in mat
|
126
|
+
mat.row(k).tail(remainingCols)
|
127
|
+
.makeHouseholderInPlace(mat.coeffRef(k,k+1), upper_diagonal[k]);
|
128
|
+
// apply householder transform to remaining part of mat on the left
|
129
|
+
mat.bottomRightCorner(remainingRows-1, remainingCols)
|
130
|
+
.applyHouseholderOnTheRight(mat.row(k).tail(remainingCols-1).adjoint(), mat.coeff(k,k+1), tempData);
|
131
|
+
}
|
132
|
+
}
|
133
|
+
|
134
|
+
/** \internal
|
135
|
+
* Helper routine for the block reduction to upper bidiagonal form.
|
136
|
+
*
|
137
|
+
* Let's partition the matrix A:
|
138
|
+
*
|
139
|
+
* | A00 A01 |
|
140
|
+
* A = | |
|
141
|
+
* | A10 A11 |
|
142
|
+
*
|
143
|
+
* This function reduces to bidiagonal form the left \c rows x \a blockSize vertical panel [A00/A10]
|
144
|
+
* and the \a blockSize x \c cols horizontal panel [A00 A01] of the matrix \a A. The bottom-right block A11
|
145
|
+
* is updated using matrix-matrix products:
|
146
|
+
* A22 -= V * Y^T - X * U^T
|
147
|
+
* where V and U contains the left and right Householder vectors. U and V are stored in A10, and A01
|
148
|
+
* respectively, and the update matrices X and Y are computed during the reduction.
|
149
|
+
*
|
150
|
+
*/
|
151
|
+
template<typename MatrixType>
|
152
|
+
void upperbidiagonalization_blocked_helper(MatrixType& A,
|
153
|
+
typename MatrixType::RealScalar *diagonal,
|
154
|
+
typename MatrixType::RealScalar *upper_diagonal,
|
155
|
+
Index bs,
|
156
|
+
Ref<Matrix<typename MatrixType::Scalar, Dynamic, Dynamic,
|
157
|
+
traits<MatrixType>::Flags & RowMajorBit> > X,
|
158
|
+
Ref<Matrix<typename MatrixType::Scalar, Dynamic, Dynamic,
|
159
|
+
traits<MatrixType>::Flags & RowMajorBit> > Y)
|
160
|
+
{
|
161
|
+
typedef typename MatrixType::Scalar Scalar;
|
162
|
+
typedef typename MatrixType::RealScalar RealScalar;
|
163
|
+
typedef typename NumTraits<RealScalar>::Literal Literal;
|
164
|
+
enum { StorageOrder = traits<MatrixType>::Flags & RowMajorBit };
|
165
|
+
typedef InnerStride<int(StorageOrder) == int(ColMajor) ? 1 : Dynamic> ColInnerStride;
|
166
|
+
typedef InnerStride<int(StorageOrder) == int(ColMajor) ? Dynamic : 1> RowInnerStride;
|
167
|
+
typedef Ref<Matrix<Scalar, Dynamic, 1>, 0, ColInnerStride> SubColumnType;
|
168
|
+
typedef Ref<Matrix<Scalar, 1, Dynamic>, 0, RowInnerStride> SubRowType;
|
169
|
+
typedef Ref<Matrix<Scalar, Dynamic, Dynamic, StorageOrder > > SubMatType;
|
170
|
+
|
171
|
+
Index brows = A.rows();
|
172
|
+
Index bcols = A.cols();
|
173
|
+
|
174
|
+
Scalar tau_u, tau_u_prev(0), tau_v;
|
175
|
+
|
176
|
+
for(Index k = 0; k < bs; ++k)
|
177
|
+
{
|
178
|
+
Index remainingRows = brows - k;
|
179
|
+
Index remainingCols = bcols - k - 1;
|
180
|
+
|
181
|
+
SubMatType X_k1( X.block(k,0, remainingRows,k) );
|
182
|
+
SubMatType V_k1( A.block(k,0, remainingRows,k) );
|
183
|
+
|
184
|
+
// 1 - update the k-th column of A
|
185
|
+
SubColumnType v_k = A.col(k).tail(remainingRows);
|
186
|
+
v_k -= V_k1 * Y.row(k).head(k).adjoint();
|
187
|
+
if(k) v_k -= X_k1 * A.col(k).head(k);
|
188
|
+
|
189
|
+
// 2 - construct left Householder transform in-place
|
190
|
+
v_k.makeHouseholderInPlace(tau_v, diagonal[k]);
|
191
|
+
|
192
|
+
if(k+1<bcols)
|
193
|
+
{
|
194
|
+
SubMatType Y_k ( Y.block(k+1,0, remainingCols, k+1) );
|
195
|
+
SubMatType U_k1 ( A.block(0,k+1, k,remainingCols) );
|
196
|
+
|
197
|
+
// this eases the application of Householder transforAions
|
198
|
+
// A(k,k) will store tau_v later
|
199
|
+
A(k,k) = Scalar(1);
|
200
|
+
|
201
|
+
// 3 - Compute y_k^T = tau_v * ( A^T*v_k - Y_k-1*V_k-1^T*v_k - U_k-1*X_k-1^T*v_k )
|
202
|
+
{
|
203
|
+
SubColumnType y_k( Y.col(k).tail(remainingCols) );
|
204
|
+
|
205
|
+
// let's use the beginning of column k of Y as a temporary vector
|
206
|
+
SubColumnType tmp( Y.col(k).head(k) );
|
207
|
+
y_k.noalias() = A.block(k,k+1, remainingRows,remainingCols).adjoint() * v_k; // bottleneck
|
208
|
+
tmp.noalias() = V_k1.adjoint() * v_k;
|
209
|
+
y_k.noalias() -= Y_k.leftCols(k) * tmp;
|
210
|
+
tmp.noalias() = X_k1.adjoint() * v_k;
|
211
|
+
y_k.noalias() -= U_k1.adjoint() * tmp;
|
212
|
+
y_k *= numext::conj(tau_v);
|
213
|
+
}
|
214
|
+
|
215
|
+
// 4 - update k-th row of A (it will become u_k)
|
216
|
+
SubRowType u_k( A.row(k).tail(remainingCols) );
|
217
|
+
u_k = u_k.conjugate();
|
218
|
+
{
|
219
|
+
u_k -= Y_k * A.row(k).head(k+1).adjoint();
|
220
|
+
if(k) u_k -= U_k1.adjoint() * X.row(k).head(k).adjoint();
|
221
|
+
}
|
222
|
+
|
223
|
+
// 5 - construct right Householder transform in-place
|
224
|
+
u_k.makeHouseholderInPlace(tau_u, upper_diagonal[k]);
|
225
|
+
|
226
|
+
// this eases the application of Householder transformations
|
227
|
+
// A(k,k+1) will store tau_u later
|
228
|
+
A(k,k+1) = Scalar(1);
|
229
|
+
|
230
|
+
// 6 - Compute x_k = tau_u * ( A*u_k - X_k-1*U_k-1^T*u_k - V_k*Y_k^T*u_k )
|
231
|
+
{
|
232
|
+
SubColumnType x_k ( X.col(k).tail(remainingRows-1) );
|
233
|
+
|
234
|
+
// let's use the beginning of column k of X as a temporary vectors
|
235
|
+
// note that tmp0 and tmp1 overlaps
|
236
|
+
SubColumnType tmp0 ( X.col(k).head(k) ),
|
237
|
+
tmp1 ( X.col(k).head(k+1) );
|
238
|
+
|
239
|
+
x_k.noalias() = A.block(k+1,k+1, remainingRows-1,remainingCols) * u_k.transpose(); // bottleneck
|
240
|
+
tmp0.noalias() = U_k1 * u_k.transpose();
|
241
|
+
x_k.noalias() -= X_k1.bottomRows(remainingRows-1) * tmp0;
|
242
|
+
tmp1.noalias() = Y_k.adjoint() * u_k.transpose();
|
243
|
+
x_k.noalias() -= A.block(k+1,0, remainingRows-1,k+1) * tmp1;
|
244
|
+
x_k *= numext::conj(tau_u);
|
245
|
+
tau_u = numext::conj(tau_u);
|
246
|
+
u_k = u_k.conjugate();
|
247
|
+
}
|
248
|
+
|
249
|
+
if(k>0) A.coeffRef(k-1,k) = tau_u_prev;
|
250
|
+
tau_u_prev = tau_u;
|
251
|
+
}
|
252
|
+
else
|
253
|
+
A.coeffRef(k-1,k) = tau_u_prev;
|
254
|
+
|
255
|
+
A.coeffRef(k,k) = tau_v;
|
256
|
+
}
|
257
|
+
|
258
|
+
if(bs<bcols)
|
259
|
+
A.coeffRef(bs-1,bs) = tau_u_prev;
|
260
|
+
|
261
|
+
// update A22
|
262
|
+
if(bcols>bs && brows>bs)
|
263
|
+
{
|
264
|
+
SubMatType A11( A.bottomRightCorner(brows-bs,bcols-bs) );
|
265
|
+
SubMatType A10( A.block(bs,0, brows-bs,bs) );
|
266
|
+
SubMatType A01( A.block(0,bs, bs,bcols-bs) );
|
267
|
+
Scalar tmp = A01(bs-1,0);
|
268
|
+
A01(bs-1,0) = Literal(1);
|
269
|
+
A11.noalias() -= A10 * Y.topLeftCorner(bcols,bs).bottomRows(bcols-bs).adjoint();
|
270
|
+
A11.noalias() -= X.topLeftCorner(brows,bs).bottomRows(brows-bs) * A01;
|
271
|
+
A01(bs-1,0) = tmp;
|
272
|
+
}
|
273
|
+
}
|
274
|
+
|
275
|
+
/** \internal
|
276
|
+
*
|
277
|
+
* Implementation of a block-bidiagonal reduction.
|
278
|
+
* It is based on the following paper:
|
279
|
+
* The Design of a Parallel Dense Linear Algebra Software Library: Reduction to Hessenberg, Tridiagonal, and Bidiagonal Form.
|
280
|
+
* by Jaeyoung Choi, Jack J. Dongarra, David W. Walker. (1995)
|
281
|
+
* section 3.3
|
282
|
+
*/
|
283
|
+
template<typename MatrixType, typename BidiagType>
|
284
|
+
void upperbidiagonalization_inplace_blocked(MatrixType& A, BidiagType& bidiagonal,
|
285
|
+
Index maxBlockSize=32,
|
286
|
+
typename MatrixType::Scalar* /*tempData*/ = 0)
|
287
|
+
{
|
288
|
+
typedef typename MatrixType::Scalar Scalar;
|
289
|
+
typedef Block<MatrixType,Dynamic,Dynamic> BlockType;
|
290
|
+
|
291
|
+
Index rows = A.rows();
|
292
|
+
Index cols = A.cols();
|
293
|
+
Index size = (std::min)(rows, cols);
|
294
|
+
|
295
|
+
// X and Y are work space
|
296
|
+
enum { StorageOrder = traits<MatrixType>::Flags & RowMajorBit };
|
297
|
+
Matrix<Scalar,
|
298
|
+
MatrixType::RowsAtCompileTime,
|
299
|
+
Dynamic,
|
300
|
+
StorageOrder,
|
301
|
+
MatrixType::MaxRowsAtCompileTime> X(rows,maxBlockSize);
|
302
|
+
Matrix<Scalar,
|
303
|
+
MatrixType::ColsAtCompileTime,
|
304
|
+
Dynamic,
|
305
|
+
StorageOrder,
|
306
|
+
MatrixType::MaxColsAtCompileTime> Y(cols,maxBlockSize);
|
307
|
+
Index blockSize = (std::min)(maxBlockSize,size);
|
308
|
+
|
309
|
+
Index k = 0;
|
310
|
+
for(k = 0; k < size; k += blockSize)
|
311
|
+
{
|
312
|
+
Index bs = (std::min)(size-k,blockSize); // actual size of the block
|
313
|
+
Index brows = rows - k; // rows of the block
|
314
|
+
Index bcols = cols - k; // columns of the block
|
315
|
+
|
316
|
+
// partition the matrix A:
|
317
|
+
//
|
318
|
+
// | A00 A01 A02 |
|
319
|
+
// | |
|
320
|
+
// A = | A10 A11 A12 |
|
321
|
+
// | |
|
322
|
+
// | A20 A21 A22 |
|
323
|
+
//
|
324
|
+
// where A11 is a bs x bs diagonal block,
|
325
|
+
// and let:
|
326
|
+
// | A11 A12 |
|
327
|
+
// B = | |
|
328
|
+
// | A21 A22 |
|
329
|
+
|
330
|
+
BlockType B = A.block(k,k,brows,bcols);
|
331
|
+
|
332
|
+
// This stage performs the bidiagonalization of A11, A21, A12, and updating of A22.
|
333
|
+
// Finally, the algorithm continue on the updated A22.
|
334
|
+
//
|
335
|
+
// However, if B is too small, or A22 empty, then let's use an unblocked strategy
|
336
|
+
if(k+bs==cols || bcols<48) // somewhat arbitrary threshold
|
337
|
+
{
|
338
|
+
upperbidiagonalization_inplace_unblocked(B,
|
339
|
+
&(bidiagonal.template diagonal<0>().coeffRef(k)),
|
340
|
+
&(bidiagonal.template diagonal<1>().coeffRef(k)),
|
341
|
+
X.data()
|
342
|
+
);
|
343
|
+
break; // We're done
|
344
|
+
}
|
345
|
+
else
|
346
|
+
{
|
347
|
+
upperbidiagonalization_blocked_helper<BlockType>( B,
|
348
|
+
&(bidiagonal.template diagonal<0>().coeffRef(k)),
|
349
|
+
&(bidiagonal.template diagonal<1>().coeffRef(k)),
|
350
|
+
bs,
|
351
|
+
X.topLeftCorner(brows,bs),
|
352
|
+
Y.topLeftCorner(bcols,bs)
|
353
|
+
);
|
354
|
+
}
|
355
|
+
}
|
356
|
+
}
|
357
|
+
|
358
|
+
template<typename _MatrixType>
|
359
|
+
UpperBidiagonalization<_MatrixType>& UpperBidiagonalization<_MatrixType>::computeUnblocked(const _MatrixType& matrix)
|
360
|
+
{
|
361
|
+
Index rows = matrix.rows();
|
362
|
+
Index cols = matrix.cols();
|
363
|
+
EIGEN_ONLY_USED_FOR_DEBUG(cols);
|
364
|
+
|
365
|
+
eigen_assert(rows >= cols && "UpperBidiagonalization is only for Arices satisfying rows>=cols.");
|
366
|
+
|
367
|
+
m_householder = matrix;
|
368
|
+
|
369
|
+
ColVectorType temp(rows);
|
370
|
+
|
371
|
+
upperbidiagonalization_inplace_unblocked(m_householder,
|
372
|
+
&(m_bidiagonal.template diagonal<0>().coeffRef(0)),
|
373
|
+
&(m_bidiagonal.template diagonal<1>().coeffRef(0)),
|
374
|
+
temp.data());
|
375
|
+
|
376
|
+
m_isInitialized = true;
|
377
|
+
return *this;
|
378
|
+
}
|
379
|
+
|
380
|
+
template<typename _MatrixType>
|
381
|
+
UpperBidiagonalization<_MatrixType>& UpperBidiagonalization<_MatrixType>::compute(const _MatrixType& matrix)
|
382
|
+
{
|
383
|
+
Index rows = matrix.rows();
|
384
|
+
Index cols = matrix.cols();
|
385
|
+
EIGEN_ONLY_USED_FOR_DEBUG(rows);
|
386
|
+
EIGEN_ONLY_USED_FOR_DEBUG(cols);
|
387
|
+
|
388
|
+
eigen_assert(rows >= cols && "UpperBidiagonalization is only for Arices satisfying rows>=cols.");
|
389
|
+
|
390
|
+
m_householder = matrix;
|
391
|
+
upperbidiagonalization_inplace_blocked(m_householder, m_bidiagonal);
|
392
|
+
|
393
|
+
m_isInitialized = true;
|
394
|
+
return *this;
|
395
|
+
}
|
396
|
+
|
397
|
+
#if 0
|
398
|
+
/** \return the Householder QR decomposition of \c *this.
|
399
|
+
*
|
400
|
+
* \sa class Bidiagonalization
|
401
|
+
*/
|
402
|
+
template<typename Derived>
|
403
|
+
const UpperBidiagonalization<typename MatrixBase<Derived>::PlainObject>
|
404
|
+
MatrixBase<Derived>::bidiagonalization() const
|
405
|
+
{
|
406
|
+
return UpperBidiagonalization<PlainObject>(eval());
|
407
|
+
}
|
408
|
+
#endif
|
409
|
+
|
410
|
+
} // end namespace internal
|
411
|
+
|
412
|
+
} // end namespace Eigen
|
413
|
+
|
414
|
+
#endif // EIGEN_BIDIAGONALIZATION_H
|