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,444 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2011-2014 Gael Guennebaud <gael.guennebaud@inria.fr>
|
5
|
+
//
|
6
|
+
// This Source Code Form is subject to the terms of the Mozilla
|
7
|
+
// Public License v. 2.0. If a copy of the MPL was not distributed
|
8
|
+
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
9
|
+
|
10
|
+
#ifndef EIGEN_ITERATIVE_SOLVER_BASE_H
|
11
|
+
#define EIGEN_ITERATIVE_SOLVER_BASE_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
namespace internal {
|
16
|
+
|
17
|
+
template<typename MatrixType>
|
18
|
+
struct is_ref_compatible_impl
|
19
|
+
{
|
20
|
+
private:
|
21
|
+
template <typename T0>
|
22
|
+
struct any_conversion
|
23
|
+
{
|
24
|
+
template <typename T> any_conversion(const volatile T&);
|
25
|
+
template <typename T> any_conversion(T&);
|
26
|
+
};
|
27
|
+
struct yes {int a[1];};
|
28
|
+
struct no {int a[2];};
|
29
|
+
|
30
|
+
template<typename T>
|
31
|
+
static yes test(const Ref<const T>&, int);
|
32
|
+
template<typename T>
|
33
|
+
static no test(any_conversion<T>, ...);
|
34
|
+
|
35
|
+
public:
|
36
|
+
static MatrixType ms_from;
|
37
|
+
enum { value = sizeof(test<MatrixType>(ms_from, 0))==sizeof(yes) };
|
38
|
+
};
|
39
|
+
|
40
|
+
template<typename MatrixType>
|
41
|
+
struct is_ref_compatible
|
42
|
+
{
|
43
|
+
enum { value = is_ref_compatible_impl<typename remove_all<MatrixType>::type>::value };
|
44
|
+
};
|
45
|
+
|
46
|
+
template<typename MatrixType, bool MatrixFree = !internal::is_ref_compatible<MatrixType>::value>
|
47
|
+
class generic_matrix_wrapper;
|
48
|
+
|
49
|
+
// We have an explicit matrix at hand, compatible with Ref<>
|
50
|
+
template<typename MatrixType>
|
51
|
+
class generic_matrix_wrapper<MatrixType,false>
|
52
|
+
{
|
53
|
+
public:
|
54
|
+
typedef Ref<const MatrixType> ActualMatrixType;
|
55
|
+
template<int UpLo> struct ConstSelfAdjointViewReturnType {
|
56
|
+
typedef typename ActualMatrixType::template ConstSelfAdjointViewReturnType<UpLo>::Type Type;
|
57
|
+
};
|
58
|
+
|
59
|
+
enum {
|
60
|
+
MatrixFree = false
|
61
|
+
};
|
62
|
+
|
63
|
+
generic_matrix_wrapper()
|
64
|
+
: m_dummy(0,0), m_matrix(m_dummy)
|
65
|
+
{}
|
66
|
+
|
67
|
+
template<typename InputType>
|
68
|
+
generic_matrix_wrapper(const InputType &mat)
|
69
|
+
: m_matrix(mat)
|
70
|
+
{}
|
71
|
+
|
72
|
+
const ActualMatrixType& matrix() const
|
73
|
+
{
|
74
|
+
return m_matrix;
|
75
|
+
}
|
76
|
+
|
77
|
+
template<typename MatrixDerived>
|
78
|
+
void grab(const EigenBase<MatrixDerived> &mat)
|
79
|
+
{
|
80
|
+
m_matrix.~Ref<const MatrixType>();
|
81
|
+
::new (&m_matrix) Ref<const MatrixType>(mat.derived());
|
82
|
+
}
|
83
|
+
|
84
|
+
void grab(const Ref<const MatrixType> &mat)
|
85
|
+
{
|
86
|
+
if(&(mat.derived()) != &m_matrix)
|
87
|
+
{
|
88
|
+
m_matrix.~Ref<const MatrixType>();
|
89
|
+
::new (&m_matrix) Ref<const MatrixType>(mat);
|
90
|
+
}
|
91
|
+
}
|
92
|
+
|
93
|
+
protected:
|
94
|
+
MatrixType m_dummy; // used to default initialize the Ref<> object
|
95
|
+
ActualMatrixType m_matrix;
|
96
|
+
};
|
97
|
+
|
98
|
+
// MatrixType is not compatible with Ref<> -> matrix-free wrapper
|
99
|
+
template<typename MatrixType>
|
100
|
+
class generic_matrix_wrapper<MatrixType,true>
|
101
|
+
{
|
102
|
+
public:
|
103
|
+
typedef MatrixType ActualMatrixType;
|
104
|
+
template<int UpLo> struct ConstSelfAdjointViewReturnType
|
105
|
+
{
|
106
|
+
typedef ActualMatrixType Type;
|
107
|
+
};
|
108
|
+
|
109
|
+
enum {
|
110
|
+
MatrixFree = true
|
111
|
+
};
|
112
|
+
|
113
|
+
generic_matrix_wrapper()
|
114
|
+
: mp_matrix(0)
|
115
|
+
{}
|
116
|
+
|
117
|
+
generic_matrix_wrapper(const MatrixType &mat)
|
118
|
+
: mp_matrix(&mat)
|
119
|
+
{}
|
120
|
+
|
121
|
+
const ActualMatrixType& matrix() const
|
122
|
+
{
|
123
|
+
return *mp_matrix;
|
124
|
+
}
|
125
|
+
|
126
|
+
void grab(const MatrixType &mat)
|
127
|
+
{
|
128
|
+
mp_matrix = &mat;
|
129
|
+
}
|
130
|
+
|
131
|
+
protected:
|
132
|
+
const ActualMatrixType *mp_matrix;
|
133
|
+
};
|
134
|
+
|
135
|
+
}
|
136
|
+
|
137
|
+
/** \ingroup IterativeLinearSolvers_Module
|
138
|
+
* \brief Base class for linear iterative solvers
|
139
|
+
*
|
140
|
+
* \sa class SimplicialCholesky, DiagonalPreconditioner, IdentityPreconditioner
|
141
|
+
*/
|
142
|
+
template< typename Derived>
|
143
|
+
class IterativeSolverBase : public SparseSolverBase<Derived>
|
144
|
+
{
|
145
|
+
protected:
|
146
|
+
typedef SparseSolverBase<Derived> Base;
|
147
|
+
using Base::m_isInitialized;
|
148
|
+
|
149
|
+
public:
|
150
|
+
typedef typename internal::traits<Derived>::MatrixType MatrixType;
|
151
|
+
typedef typename internal::traits<Derived>::Preconditioner Preconditioner;
|
152
|
+
typedef typename MatrixType::Scalar Scalar;
|
153
|
+
typedef typename MatrixType::StorageIndex StorageIndex;
|
154
|
+
typedef typename MatrixType::RealScalar RealScalar;
|
155
|
+
|
156
|
+
enum {
|
157
|
+
ColsAtCompileTime = MatrixType::ColsAtCompileTime,
|
158
|
+
MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime
|
159
|
+
};
|
160
|
+
|
161
|
+
public:
|
162
|
+
|
163
|
+
using Base::derived;
|
164
|
+
|
165
|
+
/** Default constructor. */
|
166
|
+
IterativeSolverBase()
|
167
|
+
{
|
168
|
+
init();
|
169
|
+
}
|
170
|
+
|
171
|
+
/** Initialize the solver with matrix \a A for further \c Ax=b solving.
|
172
|
+
*
|
173
|
+
* This constructor is a shortcut for the default constructor followed
|
174
|
+
* by a call to compute().
|
175
|
+
*
|
176
|
+
* \warning this class stores a reference to the matrix A as well as some
|
177
|
+
* precomputed values that depend on it. Therefore, if \a A is changed
|
178
|
+
* this class becomes invalid. Call compute() to update it with the new
|
179
|
+
* matrix A, or modify a copy of A.
|
180
|
+
*/
|
181
|
+
template<typename MatrixDerived>
|
182
|
+
explicit IterativeSolverBase(const EigenBase<MatrixDerived>& A)
|
183
|
+
: m_matrixWrapper(A.derived())
|
184
|
+
{
|
185
|
+
init();
|
186
|
+
compute(matrix());
|
187
|
+
}
|
188
|
+
|
189
|
+
~IterativeSolverBase() {}
|
190
|
+
|
191
|
+
/** Initializes the iterative solver for the sparsity pattern of the matrix \a A for further solving \c Ax=b problems.
|
192
|
+
*
|
193
|
+
* Currently, this function mostly calls analyzePattern on the preconditioner. In the future
|
194
|
+
* we might, for instance, implement column reordering for faster matrix vector products.
|
195
|
+
*/
|
196
|
+
template<typename MatrixDerived>
|
197
|
+
Derived& analyzePattern(const EigenBase<MatrixDerived>& A)
|
198
|
+
{
|
199
|
+
grab(A.derived());
|
200
|
+
m_preconditioner.analyzePattern(matrix());
|
201
|
+
m_isInitialized = true;
|
202
|
+
m_analysisIsOk = true;
|
203
|
+
m_info = m_preconditioner.info();
|
204
|
+
return derived();
|
205
|
+
}
|
206
|
+
|
207
|
+
/** Initializes the iterative solver with the numerical values of the matrix \a A for further solving \c Ax=b problems.
|
208
|
+
*
|
209
|
+
* Currently, this function mostly calls factorize on the preconditioner.
|
210
|
+
*
|
211
|
+
* \warning this class stores a reference to the matrix A as well as some
|
212
|
+
* precomputed values that depend on it. Therefore, if \a A is changed
|
213
|
+
* this class becomes invalid. Call compute() to update it with the new
|
214
|
+
* matrix A, or modify a copy of A.
|
215
|
+
*/
|
216
|
+
template<typename MatrixDerived>
|
217
|
+
Derived& factorize(const EigenBase<MatrixDerived>& A)
|
218
|
+
{
|
219
|
+
eigen_assert(m_analysisIsOk && "You must first call analyzePattern()");
|
220
|
+
grab(A.derived());
|
221
|
+
m_preconditioner.factorize(matrix());
|
222
|
+
m_factorizationIsOk = true;
|
223
|
+
m_info = m_preconditioner.info();
|
224
|
+
return derived();
|
225
|
+
}
|
226
|
+
|
227
|
+
/** Initializes the iterative solver with the matrix \a A for further solving \c Ax=b problems.
|
228
|
+
*
|
229
|
+
* Currently, this function mostly initializes/computes the preconditioner. In the future
|
230
|
+
* we might, for instance, implement column reordering for faster matrix vector products.
|
231
|
+
*
|
232
|
+
* \warning this class stores a reference to the matrix A as well as some
|
233
|
+
* precomputed values that depend on it. Therefore, if \a A is changed
|
234
|
+
* this class becomes invalid. Call compute() to update it with the new
|
235
|
+
* matrix A, or modify a copy of A.
|
236
|
+
*/
|
237
|
+
template<typename MatrixDerived>
|
238
|
+
Derived& compute(const EigenBase<MatrixDerived>& A)
|
239
|
+
{
|
240
|
+
grab(A.derived());
|
241
|
+
m_preconditioner.compute(matrix());
|
242
|
+
m_isInitialized = true;
|
243
|
+
m_analysisIsOk = true;
|
244
|
+
m_factorizationIsOk = true;
|
245
|
+
m_info = m_preconditioner.info();
|
246
|
+
return derived();
|
247
|
+
}
|
248
|
+
|
249
|
+
/** \internal */
|
250
|
+
EIGEN_CONSTEXPR Index rows() const EIGEN_NOEXCEPT { return matrix().rows(); }
|
251
|
+
|
252
|
+
/** \internal */
|
253
|
+
EIGEN_CONSTEXPR Index cols() const EIGEN_NOEXCEPT { return matrix().cols(); }
|
254
|
+
|
255
|
+
/** \returns the tolerance threshold used by the stopping criteria.
|
256
|
+
* \sa setTolerance()
|
257
|
+
*/
|
258
|
+
RealScalar tolerance() const { return m_tolerance; }
|
259
|
+
|
260
|
+
/** Sets the tolerance threshold used by the stopping criteria.
|
261
|
+
*
|
262
|
+
* This value is used as an upper bound to the relative residual error: |Ax-b|/|b|.
|
263
|
+
* The default value is the machine precision given by NumTraits<Scalar>::epsilon()
|
264
|
+
*/
|
265
|
+
Derived& setTolerance(const RealScalar& tolerance)
|
266
|
+
{
|
267
|
+
m_tolerance = tolerance;
|
268
|
+
return derived();
|
269
|
+
}
|
270
|
+
|
271
|
+
/** \returns a read-write reference to the preconditioner for custom configuration. */
|
272
|
+
Preconditioner& preconditioner() { return m_preconditioner; }
|
273
|
+
|
274
|
+
/** \returns a read-only reference to the preconditioner. */
|
275
|
+
const Preconditioner& preconditioner() const { return m_preconditioner; }
|
276
|
+
|
277
|
+
/** \returns the max number of iterations.
|
278
|
+
* It is either the value set by setMaxIterations or, by default,
|
279
|
+
* twice the number of columns of the matrix.
|
280
|
+
*/
|
281
|
+
Index maxIterations() const
|
282
|
+
{
|
283
|
+
return (m_maxIterations<0) ? 2*matrix().cols() : m_maxIterations;
|
284
|
+
}
|
285
|
+
|
286
|
+
/** Sets the max number of iterations.
|
287
|
+
* Default is twice the number of columns of the matrix.
|
288
|
+
*/
|
289
|
+
Derived& setMaxIterations(Index maxIters)
|
290
|
+
{
|
291
|
+
m_maxIterations = maxIters;
|
292
|
+
return derived();
|
293
|
+
}
|
294
|
+
|
295
|
+
/** \returns the number of iterations performed during the last solve */
|
296
|
+
Index iterations() const
|
297
|
+
{
|
298
|
+
eigen_assert(m_isInitialized && "ConjugateGradient is not initialized.");
|
299
|
+
return m_iterations;
|
300
|
+
}
|
301
|
+
|
302
|
+
/** \returns the tolerance error reached during the last solve.
|
303
|
+
* It is a close approximation of the true relative residual error |Ax-b|/|b|.
|
304
|
+
*/
|
305
|
+
RealScalar error() const
|
306
|
+
{
|
307
|
+
eigen_assert(m_isInitialized && "ConjugateGradient is not initialized.");
|
308
|
+
return m_error;
|
309
|
+
}
|
310
|
+
|
311
|
+
/** \returns the solution x of \f$ A x = b \f$ using the current decomposition of A
|
312
|
+
* and \a x0 as an initial solution.
|
313
|
+
*
|
314
|
+
* \sa solve(), compute()
|
315
|
+
*/
|
316
|
+
template<typename Rhs,typename Guess>
|
317
|
+
inline const SolveWithGuess<Derived, Rhs, Guess>
|
318
|
+
solveWithGuess(const MatrixBase<Rhs>& b, const Guess& x0) const
|
319
|
+
{
|
320
|
+
eigen_assert(m_isInitialized && "Solver is not initialized.");
|
321
|
+
eigen_assert(derived().rows()==b.rows() && "solve(): invalid number of rows of the right hand side matrix b");
|
322
|
+
return SolveWithGuess<Derived, Rhs, Guess>(derived(), b.derived(), x0);
|
323
|
+
}
|
324
|
+
|
325
|
+
/** \returns Success if the iterations converged, and NoConvergence otherwise. */
|
326
|
+
ComputationInfo info() const
|
327
|
+
{
|
328
|
+
eigen_assert(m_isInitialized && "IterativeSolverBase is not initialized.");
|
329
|
+
return m_info;
|
330
|
+
}
|
331
|
+
|
332
|
+
/** \internal */
|
333
|
+
template<typename Rhs, typename DestDerived>
|
334
|
+
void _solve_with_guess_impl(const Rhs& b, SparseMatrixBase<DestDerived> &aDest) const
|
335
|
+
{
|
336
|
+
eigen_assert(rows()==b.rows());
|
337
|
+
|
338
|
+
Index rhsCols = b.cols();
|
339
|
+
Index size = b.rows();
|
340
|
+
DestDerived& dest(aDest.derived());
|
341
|
+
typedef typename DestDerived::Scalar DestScalar;
|
342
|
+
Eigen::Matrix<DestScalar,Dynamic,1> tb(size);
|
343
|
+
Eigen::Matrix<DestScalar,Dynamic,1> tx(cols());
|
344
|
+
// We do not directly fill dest because sparse expressions have to be free of aliasing issue.
|
345
|
+
// For non square least-square problems, b and dest might not have the same size whereas they might alias each-other.
|
346
|
+
typename DestDerived::PlainObject tmp(cols(),rhsCols);
|
347
|
+
ComputationInfo global_info = Success;
|
348
|
+
for(Index k=0; k<rhsCols; ++k)
|
349
|
+
{
|
350
|
+
tb = b.col(k);
|
351
|
+
tx = dest.col(k);
|
352
|
+
derived()._solve_vector_with_guess_impl(tb,tx);
|
353
|
+
tmp.col(k) = tx.sparseView(0);
|
354
|
+
|
355
|
+
// The call to _solve_vector_with_guess_impl updates m_info, so if it failed for a previous column
|
356
|
+
// we need to restore it to the worst value.
|
357
|
+
if(m_info==NumericalIssue)
|
358
|
+
global_info = NumericalIssue;
|
359
|
+
else if(m_info==NoConvergence)
|
360
|
+
global_info = NoConvergence;
|
361
|
+
}
|
362
|
+
m_info = global_info;
|
363
|
+
dest.swap(tmp);
|
364
|
+
}
|
365
|
+
|
366
|
+
template<typename Rhs, typename DestDerived>
|
367
|
+
typename internal::enable_if<Rhs::ColsAtCompileTime!=1 && DestDerived::ColsAtCompileTime!=1>::type
|
368
|
+
_solve_with_guess_impl(const Rhs& b, MatrixBase<DestDerived> &aDest) const
|
369
|
+
{
|
370
|
+
eigen_assert(rows()==b.rows());
|
371
|
+
|
372
|
+
Index rhsCols = b.cols();
|
373
|
+
DestDerived& dest(aDest.derived());
|
374
|
+
ComputationInfo global_info = Success;
|
375
|
+
for(Index k=0; k<rhsCols; ++k)
|
376
|
+
{
|
377
|
+
typename DestDerived::ColXpr xk(dest,k);
|
378
|
+
typename Rhs::ConstColXpr bk(b,k);
|
379
|
+
derived()._solve_vector_with_guess_impl(bk,xk);
|
380
|
+
|
381
|
+
// The call to _solve_vector_with_guess updates m_info, so if it failed for a previous column
|
382
|
+
// we need to restore it to the worst value.
|
383
|
+
if(m_info==NumericalIssue)
|
384
|
+
global_info = NumericalIssue;
|
385
|
+
else if(m_info==NoConvergence)
|
386
|
+
global_info = NoConvergence;
|
387
|
+
}
|
388
|
+
m_info = global_info;
|
389
|
+
}
|
390
|
+
|
391
|
+
template<typename Rhs, typename DestDerived>
|
392
|
+
typename internal::enable_if<Rhs::ColsAtCompileTime==1 || DestDerived::ColsAtCompileTime==1>::type
|
393
|
+
_solve_with_guess_impl(const Rhs& b, MatrixBase<DestDerived> &dest) const
|
394
|
+
{
|
395
|
+
derived()._solve_vector_with_guess_impl(b,dest.derived());
|
396
|
+
}
|
397
|
+
|
398
|
+
/** \internal default initial guess = 0 */
|
399
|
+
template<typename Rhs,typename Dest>
|
400
|
+
void _solve_impl(const Rhs& b, Dest& x) const
|
401
|
+
{
|
402
|
+
x.setZero();
|
403
|
+
derived()._solve_with_guess_impl(b,x);
|
404
|
+
}
|
405
|
+
|
406
|
+
protected:
|
407
|
+
void init()
|
408
|
+
{
|
409
|
+
m_isInitialized = false;
|
410
|
+
m_analysisIsOk = false;
|
411
|
+
m_factorizationIsOk = false;
|
412
|
+
m_maxIterations = -1;
|
413
|
+
m_tolerance = NumTraits<Scalar>::epsilon();
|
414
|
+
}
|
415
|
+
|
416
|
+
typedef internal::generic_matrix_wrapper<MatrixType> MatrixWrapper;
|
417
|
+
typedef typename MatrixWrapper::ActualMatrixType ActualMatrixType;
|
418
|
+
|
419
|
+
const ActualMatrixType& matrix() const
|
420
|
+
{
|
421
|
+
return m_matrixWrapper.matrix();
|
422
|
+
}
|
423
|
+
|
424
|
+
template<typename InputType>
|
425
|
+
void grab(const InputType &A)
|
426
|
+
{
|
427
|
+
m_matrixWrapper.grab(A);
|
428
|
+
}
|
429
|
+
|
430
|
+
MatrixWrapper m_matrixWrapper;
|
431
|
+
Preconditioner m_preconditioner;
|
432
|
+
|
433
|
+
Index m_maxIterations;
|
434
|
+
RealScalar m_tolerance;
|
435
|
+
|
436
|
+
mutable RealScalar m_error;
|
437
|
+
mutable Index m_iterations;
|
438
|
+
mutable ComputationInfo m_info;
|
439
|
+
mutable bool m_analysisIsOk, m_factorizationIsOk;
|
440
|
+
};
|
441
|
+
|
442
|
+
} // end namespace Eigen
|
443
|
+
|
444
|
+
#endif // EIGEN_ITERATIVE_SOLVER_BASE_H
|
@@ -0,0 +1,198 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2015 Gael Guennebaud <gael.guennebaud@inria.fr>
|
5
|
+
//
|
6
|
+
// This Source Code Form is subject to the terms of the Mozilla
|
7
|
+
// Public License v. 2.0. If a copy of the MPL was not distributed
|
8
|
+
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
9
|
+
|
10
|
+
#ifndef EIGEN_LEAST_SQUARE_CONJUGATE_GRADIENT_H
|
11
|
+
#define EIGEN_LEAST_SQUARE_CONJUGATE_GRADIENT_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
namespace internal {
|
16
|
+
|
17
|
+
/** \internal Low-level conjugate gradient algorithm for least-square problems
|
18
|
+
* \param mat The matrix A
|
19
|
+
* \param rhs The right hand side vector b
|
20
|
+
* \param x On input and initial solution, on output the computed solution.
|
21
|
+
* \param precond A preconditioner being able to efficiently solve for an
|
22
|
+
* approximation of A'Ax=b (regardless of b)
|
23
|
+
* \param iters On input the max number of iteration, on output the number of performed iterations.
|
24
|
+
* \param tol_error On input the tolerance error, on output an estimation of the relative error.
|
25
|
+
*/
|
26
|
+
template<typename MatrixType, typename Rhs, typename Dest, typename Preconditioner>
|
27
|
+
EIGEN_DONT_INLINE
|
28
|
+
void least_square_conjugate_gradient(const MatrixType& mat, const Rhs& rhs, Dest& x,
|
29
|
+
const Preconditioner& precond, Index& iters,
|
30
|
+
typename Dest::RealScalar& tol_error)
|
31
|
+
{
|
32
|
+
using std::sqrt;
|
33
|
+
using std::abs;
|
34
|
+
typedef typename Dest::RealScalar RealScalar;
|
35
|
+
typedef typename Dest::Scalar Scalar;
|
36
|
+
typedef Matrix<Scalar,Dynamic,1> VectorType;
|
37
|
+
|
38
|
+
RealScalar tol = tol_error;
|
39
|
+
Index maxIters = iters;
|
40
|
+
|
41
|
+
Index m = mat.rows(), n = mat.cols();
|
42
|
+
|
43
|
+
VectorType residual = rhs - mat * x;
|
44
|
+
VectorType normal_residual = mat.adjoint() * residual;
|
45
|
+
|
46
|
+
RealScalar rhsNorm2 = (mat.adjoint()*rhs).squaredNorm();
|
47
|
+
if(rhsNorm2 == 0)
|
48
|
+
{
|
49
|
+
x.setZero();
|
50
|
+
iters = 0;
|
51
|
+
tol_error = 0;
|
52
|
+
return;
|
53
|
+
}
|
54
|
+
RealScalar threshold = tol*tol*rhsNorm2;
|
55
|
+
RealScalar residualNorm2 = normal_residual.squaredNorm();
|
56
|
+
if (residualNorm2 < threshold)
|
57
|
+
{
|
58
|
+
iters = 0;
|
59
|
+
tol_error = sqrt(residualNorm2 / rhsNorm2);
|
60
|
+
return;
|
61
|
+
}
|
62
|
+
|
63
|
+
VectorType p(n);
|
64
|
+
p = precond.solve(normal_residual); // initial search direction
|
65
|
+
|
66
|
+
VectorType z(n), tmp(m);
|
67
|
+
RealScalar absNew = numext::real(normal_residual.dot(p)); // the square of the absolute value of r scaled by invM
|
68
|
+
Index i = 0;
|
69
|
+
while(i < maxIters)
|
70
|
+
{
|
71
|
+
tmp.noalias() = mat * p;
|
72
|
+
|
73
|
+
Scalar alpha = absNew / tmp.squaredNorm(); // the amount we travel on dir
|
74
|
+
x += alpha * p; // update solution
|
75
|
+
residual -= alpha * tmp; // update residual
|
76
|
+
normal_residual = mat.adjoint() * residual; // update residual of the normal equation
|
77
|
+
|
78
|
+
residualNorm2 = normal_residual.squaredNorm();
|
79
|
+
if(residualNorm2 < threshold)
|
80
|
+
break;
|
81
|
+
|
82
|
+
z = precond.solve(normal_residual); // approximately solve for "A'A z = normal_residual"
|
83
|
+
|
84
|
+
RealScalar absOld = absNew;
|
85
|
+
absNew = numext::real(normal_residual.dot(z)); // update the absolute value of r
|
86
|
+
RealScalar beta = absNew / absOld; // calculate the Gram-Schmidt value used to create the new search direction
|
87
|
+
p = z + beta * p; // update search direction
|
88
|
+
i++;
|
89
|
+
}
|
90
|
+
tol_error = sqrt(residualNorm2 / rhsNorm2);
|
91
|
+
iters = i;
|
92
|
+
}
|
93
|
+
|
94
|
+
}
|
95
|
+
|
96
|
+
template< typename _MatrixType,
|
97
|
+
typename _Preconditioner = LeastSquareDiagonalPreconditioner<typename _MatrixType::Scalar> >
|
98
|
+
class LeastSquaresConjugateGradient;
|
99
|
+
|
100
|
+
namespace internal {
|
101
|
+
|
102
|
+
template< typename _MatrixType, typename _Preconditioner>
|
103
|
+
struct traits<LeastSquaresConjugateGradient<_MatrixType,_Preconditioner> >
|
104
|
+
{
|
105
|
+
typedef _MatrixType MatrixType;
|
106
|
+
typedef _Preconditioner Preconditioner;
|
107
|
+
};
|
108
|
+
|
109
|
+
}
|
110
|
+
|
111
|
+
/** \ingroup IterativeLinearSolvers_Module
|
112
|
+
* \brief A conjugate gradient solver for sparse (or dense) least-square problems
|
113
|
+
*
|
114
|
+
* This class allows to solve for A x = b linear problems using an iterative conjugate gradient algorithm.
|
115
|
+
* The matrix A can be non symmetric and rectangular, but the matrix A' A should be positive-definite to guaranty stability.
|
116
|
+
* Otherwise, the SparseLU or SparseQR classes might be preferable.
|
117
|
+
* The matrix A and the vectors x and b can be either dense or sparse.
|
118
|
+
*
|
119
|
+
* \tparam _MatrixType the type of the matrix A, can be a dense or a sparse matrix.
|
120
|
+
* \tparam _Preconditioner the type of the preconditioner. Default is LeastSquareDiagonalPreconditioner
|
121
|
+
*
|
122
|
+
* \implsparsesolverconcept
|
123
|
+
*
|
124
|
+
* The maximal number of iterations and tolerance value can be controlled via the setMaxIterations()
|
125
|
+
* and setTolerance() methods. The defaults are the size of the problem for the maximal number of iterations
|
126
|
+
* and NumTraits<Scalar>::epsilon() for the tolerance.
|
127
|
+
*
|
128
|
+
* This class can be used as the direct solver classes. Here is a typical usage example:
|
129
|
+
\code
|
130
|
+
int m=1000000, n = 10000;
|
131
|
+
VectorXd x(n), b(m);
|
132
|
+
SparseMatrix<double> A(m,n);
|
133
|
+
// fill A and b
|
134
|
+
LeastSquaresConjugateGradient<SparseMatrix<double> > lscg;
|
135
|
+
lscg.compute(A);
|
136
|
+
x = lscg.solve(b);
|
137
|
+
std::cout << "#iterations: " << lscg.iterations() << std::endl;
|
138
|
+
std::cout << "estimated error: " << lscg.error() << std::endl;
|
139
|
+
// update b, and solve again
|
140
|
+
x = lscg.solve(b);
|
141
|
+
\endcode
|
142
|
+
*
|
143
|
+
* By default the iterations start with x=0 as an initial guess of the solution.
|
144
|
+
* One can control the start using the solveWithGuess() method.
|
145
|
+
*
|
146
|
+
* \sa class ConjugateGradient, SparseLU, SparseQR
|
147
|
+
*/
|
148
|
+
template< typename _MatrixType, typename _Preconditioner>
|
149
|
+
class LeastSquaresConjugateGradient : public IterativeSolverBase<LeastSquaresConjugateGradient<_MatrixType,_Preconditioner> >
|
150
|
+
{
|
151
|
+
typedef IterativeSolverBase<LeastSquaresConjugateGradient> Base;
|
152
|
+
using Base::matrix;
|
153
|
+
using Base::m_error;
|
154
|
+
using Base::m_iterations;
|
155
|
+
using Base::m_info;
|
156
|
+
using Base::m_isInitialized;
|
157
|
+
public:
|
158
|
+
typedef _MatrixType MatrixType;
|
159
|
+
typedef typename MatrixType::Scalar Scalar;
|
160
|
+
typedef typename MatrixType::RealScalar RealScalar;
|
161
|
+
typedef _Preconditioner Preconditioner;
|
162
|
+
|
163
|
+
public:
|
164
|
+
|
165
|
+
/** Default constructor. */
|
166
|
+
LeastSquaresConjugateGradient() : Base() {}
|
167
|
+
|
168
|
+
/** Initialize the solver with matrix \a A for further \c Ax=b solving.
|
169
|
+
*
|
170
|
+
* This constructor is a shortcut for the default constructor followed
|
171
|
+
* by a call to compute().
|
172
|
+
*
|
173
|
+
* \warning this class stores a reference to the matrix A as well as some
|
174
|
+
* precomputed values that depend on it. Therefore, if \a A is changed
|
175
|
+
* this class becomes invalid. Call compute() to update it with the new
|
176
|
+
* matrix A, or modify a copy of A.
|
177
|
+
*/
|
178
|
+
template<typename MatrixDerived>
|
179
|
+
explicit LeastSquaresConjugateGradient(const EigenBase<MatrixDerived>& A) : Base(A.derived()) {}
|
180
|
+
|
181
|
+
~LeastSquaresConjugateGradient() {}
|
182
|
+
|
183
|
+
/** \internal */
|
184
|
+
template<typename Rhs,typename Dest>
|
185
|
+
void _solve_vector_with_guess_impl(const Rhs& b, Dest& x) const
|
186
|
+
{
|
187
|
+
m_iterations = Base::maxIterations();
|
188
|
+
m_error = Base::m_tolerance;
|
189
|
+
|
190
|
+
internal::least_square_conjugate_gradient(matrix(), b, x, Base::m_preconditioner, m_iterations, m_error);
|
191
|
+
m_info = m_error <= Base::m_tolerance ? Success : NoConvergence;
|
192
|
+
}
|
193
|
+
|
194
|
+
};
|
195
|
+
|
196
|
+
} // end namespace Eigen
|
197
|
+
|
198
|
+
#endif // EIGEN_LEAST_SQUARE_CONJUGATE_GRADIENT_H
|