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,877 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2006-2009 Benoit Jacob <jacob.benoit.1@gmail.com>
|
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_LU_H
|
11
|
+
#define EIGEN_LU_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
namespace internal {
|
16
|
+
template<typename _MatrixType> struct traits<FullPivLU<_MatrixType> >
|
17
|
+
: traits<_MatrixType>
|
18
|
+
{
|
19
|
+
typedef MatrixXpr XprKind;
|
20
|
+
typedef SolverStorage StorageKind;
|
21
|
+
typedef int StorageIndex;
|
22
|
+
enum { Flags = 0 };
|
23
|
+
};
|
24
|
+
|
25
|
+
} // end namespace internal
|
26
|
+
|
27
|
+
/** \ingroup LU_Module
|
28
|
+
*
|
29
|
+
* \class FullPivLU
|
30
|
+
*
|
31
|
+
* \brief LU decomposition of a matrix with complete pivoting, and related features
|
32
|
+
*
|
33
|
+
* \tparam _MatrixType the type of the matrix of which we are computing the LU decomposition
|
34
|
+
*
|
35
|
+
* This class represents a LU decomposition of any matrix, with complete pivoting: the matrix A is
|
36
|
+
* decomposed as \f$ A = P^{-1} L U Q^{-1} \f$ where L is unit-lower-triangular, U is
|
37
|
+
* upper-triangular, and P and Q are permutation matrices. This is a rank-revealing LU
|
38
|
+
* decomposition. The eigenvalues (diagonal coefficients) of U are sorted in such a way that any
|
39
|
+
* zeros are at the end.
|
40
|
+
*
|
41
|
+
* This decomposition provides the generic approach to solving systems of linear equations, computing
|
42
|
+
* the rank, invertibility, inverse, kernel, and determinant.
|
43
|
+
*
|
44
|
+
* This LU decomposition is very stable and well tested with large matrices. However there are use cases where the SVD
|
45
|
+
* decomposition is inherently more stable and/or flexible. For example, when computing the kernel of a matrix,
|
46
|
+
* working with the SVD allows to select the smallest singular values of the matrix, something that
|
47
|
+
* the LU decomposition doesn't see.
|
48
|
+
*
|
49
|
+
* The data of the LU decomposition can be directly accessed through the methods matrixLU(),
|
50
|
+
* permutationP(), permutationQ().
|
51
|
+
*
|
52
|
+
* As an example, here is how the original matrix can be retrieved:
|
53
|
+
* \include class_FullPivLU.cpp
|
54
|
+
* Output: \verbinclude class_FullPivLU.out
|
55
|
+
*
|
56
|
+
* This class supports the \link InplaceDecomposition inplace decomposition \endlink mechanism.
|
57
|
+
*
|
58
|
+
* \sa MatrixBase::fullPivLu(), MatrixBase::determinant(), MatrixBase::inverse()
|
59
|
+
*/
|
60
|
+
template<typename _MatrixType> class FullPivLU
|
61
|
+
: public SolverBase<FullPivLU<_MatrixType> >
|
62
|
+
{
|
63
|
+
public:
|
64
|
+
typedef _MatrixType MatrixType;
|
65
|
+
typedef SolverBase<FullPivLU> Base;
|
66
|
+
friend class SolverBase<FullPivLU>;
|
67
|
+
|
68
|
+
EIGEN_GENERIC_PUBLIC_INTERFACE(FullPivLU)
|
69
|
+
enum {
|
70
|
+
MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime,
|
71
|
+
MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime
|
72
|
+
};
|
73
|
+
typedef typename internal::plain_row_type<MatrixType, StorageIndex>::type IntRowVectorType;
|
74
|
+
typedef typename internal::plain_col_type<MatrixType, StorageIndex>::type IntColVectorType;
|
75
|
+
typedef PermutationMatrix<ColsAtCompileTime, MaxColsAtCompileTime> PermutationQType;
|
76
|
+
typedef PermutationMatrix<RowsAtCompileTime, MaxRowsAtCompileTime> PermutationPType;
|
77
|
+
typedef typename MatrixType::PlainObject PlainObject;
|
78
|
+
|
79
|
+
/**
|
80
|
+
* \brief Default Constructor.
|
81
|
+
*
|
82
|
+
* The default constructor is useful in cases in which the user intends to
|
83
|
+
* perform decompositions via LU::compute(const MatrixType&).
|
84
|
+
*/
|
85
|
+
FullPivLU();
|
86
|
+
|
87
|
+
/** \brief Default Constructor with memory preallocation
|
88
|
+
*
|
89
|
+
* Like the default constructor but with preallocation of the internal data
|
90
|
+
* according to the specified problem \a size.
|
91
|
+
* \sa FullPivLU()
|
92
|
+
*/
|
93
|
+
FullPivLU(Index rows, Index cols);
|
94
|
+
|
95
|
+
/** Constructor.
|
96
|
+
*
|
97
|
+
* \param matrix the matrix of which to compute the LU decomposition.
|
98
|
+
* It is required to be nonzero.
|
99
|
+
*/
|
100
|
+
template<typename InputType>
|
101
|
+
explicit FullPivLU(const EigenBase<InputType>& matrix);
|
102
|
+
|
103
|
+
/** \brief Constructs a LU factorization from a given matrix
|
104
|
+
*
|
105
|
+
* This overloaded constructor is provided for \link InplaceDecomposition inplace decomposition \endlink when \c MatrixType is a Eigen::Ref.
|
106
|
+
*
|
107
|
+
* \sa FullPivLU(const EigenBase&)
|
108
|
+
*/
|
109
|
+
template<typename InputType>
|
110
|
+
explicit FullPivLU(EigenBase<InputType>& matrix);
|
111
|
+
|
112
|
+
/** Computes the LU decomposition of the given matrix.
|
113
|
+
*
|
114
|
+
* \param matrix the matrix of which to compute the LU decomposition.
|
115
|
+
* It is required to be nonzero.
|
116
|
+
*
|
117
|
+
* \returns a reference to *this
|
118
|
+
*/
|
119
|
+
template<typename InputType>
|
120
|
+
FullPivLU& compute(const EigenBase<InputType>& matrix) {
|
121
|
+
m_lu = matrix.derived();
|
122
|
+
computeInPlace();
|
123
|
+
return *this;
|
124
|
+
}
|
125
|
+
|
126
|
+
/** \returns the LU decomposition matrix: the upper-triangular part is U, the
|
127
|
+
* unit-lower-triangular part is L (at least for square matrices; in the non-square
|
128
|
+
* case, special care is needed, see the documentation of class FullPivLU).
|
129
|
+
*
|
130
|
+
* \sa matrixL(), matrixU()
|
131
|
+
*/
|
132
|
+
inline const MatrixType& matrixLU() const
|
133
|
+
{
|
134
|
+
eigen_assert(m_isInitialized && "LU is not initialized.");
|
135
|
+
return m_lu;
|
136
|
+
}
|
137
|
+
|
138
|
+
/** \returns the number of nonzero pivots in the LU decomposition.
|
139
|
+
* Here nonzero is meant in the exact sense, not in a fuzzy sense.
|
140
|
+
* So that notion isn't really intrinsically interesting, but it is
|
141
|
+
* still useful when implementing algorithms.
|
142
|
+
*
|
143
|
+
* \sa rank()
|
144
|
+
*/
|
145
|
+
inline Index nonzeroPivots() const
|
146
|
+
{
|
147
|
+
eigen_assert(m_isInitialized && "LU is not initialized.");
|
148
|
+
return m_nonzero_pivots;
|
149
|
+
}
|
150
|
+
|
151
|
+
/** \returns the absolute value of the biggest pivot, i.e. the biggest
|
152
|
+
* diagonal coefficient of U.
|
153
|
+
*/
|
154
|
+
RealScalar maxPivot() const { return m_maxpivot; }
|
155
|
+
|
156
|
+
/** \returns the permutation matrix P
|
157
|
+
*
|
158
|
+
* \sa permutationQ()
|
159
|
+
*/
|
160
|
+
EIGEN_DEVICE_FUNC inline const PermutationPType& permutationP() const
|
161
|
+
{
|
162
|
+
eigen_assert(m_isInitialized && "LU is not initialized.");
|
163
|
+
return m_p;
|
164
|
+
}
|
165
|
+
|
166
|
+
/** \returns the permutation matrix Q
|
167
|
+
*
|
168
|
+
* \sa permutationP()
|
169
|
+
*/
|
170
|
+
inline const PermutationQType& permutationQ() const
|
171
|
+
{
|
172
|
+
eigen_assert(m_isInitialized && "LU is not initialized.");
|
173
|
+
return m_q;
|
174
|
+
}
|
175
|
+
|
176
|
+
/** \returns the kernel of the matrix, also called its null-space. The columns of the returned matrix
|
177
|
+
* will form a basis of the kernel.
|
178
|
+
*
|
179
|
+
* \note If the kernel has dimension zero, then the returned matrix is a column-vector filled with zeros.
|
180
|
+
*
|
181
|
+
* \note This method has to determine which pivots should be considered nonzero.
|
182
|
+
* For that, it uses the threshold value that you can control by calling
|
183
|
+
* setThreshold(const RealScalar&).
|
184
|
+
*
|
185
|
+
* Example: \include FullPivLU_kernel.cpp
|
186
|
+
* Output: \verbinclude FullPivLU_kernel.out
|
187
|
+
*
|
188
|
+
* \sa image()
|
189
|
+
*/
|
190
|
+
inline const internal::kernel_retval<FullPivLU> kernel() const
|
191
|
+
{
|
192
|
+
eigen_assert(m_isInitialized && "LU is not initialized.");
|
193
|
+
return internal::kernel_retval<FullPivLU>(*this);
|
194
|
+
}
|
195
|
+
|
196
|
+
/** \returns the image of the matrix, also called its column-space. The columns of the returned matrix
|
197
|
+
* will form a basis of the image (column-space).
|
198
|
+
*
|
199
|
+
* \param originalMatrix the original matrix, of which *this is the LU decomposition.
|
200
|
+
* The reason why it is needed to pass it here, is that this allows
|
201
|
+
* a large optimization, as otherwise this method would need to reconstruct it
|
202
|
+
* from the LU decomposition.
|
203
|
+
*
|
204
|
+
* \note If the image has dimension zero, then the returned matrix is a column-vector filled with zeros.
|
205
|
+
*
|
206
|
+
* \note This method has to determine which pivots should be considered nonzero.
|
207
|
+
* For that, it uses the threshold value that you can control by calling
|
208
|
+
* setThreshold(const RealScalar&).
|
209
|
+
*
|
210
|
+
* Example: \include FullPivLU_image.cpp
|
211
|
+
* Output: \verbinclude FullPivLU_image.out
|
212
|
+
*
|
213
|
+
* \sa kernel()
|
214
|
+
*/
|
215
|
+
inline const internal::image_retval<FullPivLU>
|
216
|
+
image(const MatrixType& originalMatrix) const
|
217
|
+
{
|
218
|
+
eigen_assert(m_isInitialized && "LU is not initialized.");
|
219
|
+
return internal::image_retval<FullPivLU>(*this, originalMatrix);
|
220
|
+
}
|
221
|
+
|
222
|
+
#ifdef EIGEN_PARSED_BY_DOXYGEN
|
223
|
+
/** \return a solution x to the equation Ax=b, where A is the matrix of which
|
224
|
+
* *this is the LU decomposition.
|
225
|
+
*
|
226
|
+
* \param b the right-hand-side of the equation to solve. Can be a vector or a matrix,
|
227
|
+
* the only requirement in order for the equation to make sense is that
|
228
|
+
* b.rows()==A.rows(), where A is the matrix of which *this is the LU decomposition.
|
229
|
+
*
|
230
|
+
* \returns a solution.
|
231
|
+
*
|
232
|
+
* \note_about_checking_solutions
|
233
|
+
*
|
234
|
+
* \note_about_arbitrary_choice_of_solution
|
235
|
+
* \note_about_using_kernel_to_study_multiple_solutions
|
236
|
+
*
|
237
|
+
* Example: \include FullPivLU_solve.cpp
|
238
|
+
* Output: \verbinclude FullPivLU_solve.out
|
239
|
+
*
|
240
|
+
* \sa TriangularView::solve(), kernel(), inverse()
|
241
|
+
*/
|
242
|
+
template<typename Rhs>
|
243
|
+
inline const Solve<FullPivLU, Rhs>
|
244
|
+
solve(const MatrixBase<Rhs>& b) const;
|
245
|
+
#endif
|
246
|
+
|
247
|
+
/** \returns an estimate of the reciprocal condition number of the matrix of which \c *this is
|
248
|
+
the LU decomposition.
|
249
|
+
*/
|
250
|
+
inline RealScalar rcond() const
|
251
|
+
{
|
252
|
+
eigen_assert(m_isInitialized && "PartialPivLU is not initialized.");
|
253
|
+
return internal::rcond_estimate_helper(m_l1_norm, *this);
|
254
|
+
}
|
255
|
+
|
256
|
+
/** \returns the determinant of the matrix of which
|
257
|
+
* *this is the LU decomposition. It has only linear complexity
|
258
|
+
* (that is, O(n) where n is the dimension of the square matrix)
|
259
|
+
* as the LU decomposition has already been computed.
|
260
|
+
*
|
261
|
+
* \note This is only for square matrices.
|
262
|
+
*
|
263
|
+
* \note For fixed-size matrices of size up to 4, MatrixBase::determinant() offers
|
264
|
+
* optimized paths.
|
265
|
+
*
|
266
|
+
* \warning a determinant can be very big or small, so for matrices
|
267
|
+
* of large enough dimension, there is a risk of overflow/underflow.
|
268
|
+
*
|
269
|
+
* \sa MatrixBase::determinant()
|
270
|
+
*/
|
271
|
+
typename internal::traits<MatrixType>::Scalar determinant() const;
|
272
|
+
|
273
|
+
/** Allows to prescribe a threshold to be used by certain methods, such as rank(),
|
274
|
+
* who need to determine when pivots are to be considered nonzero. This is not used for the
|
275
|
+
* LU decomposition itself.
|
276
|
+
*
|
277
|
+
* When it needs to get the threshold value, Eigen calls threshold(). By default, this
|
278
|
+
* uses a formula to automatically determine a reasonable threshold.
|
279
|
+
* Once you have called the present method setThreshold(const RealScalar&),
|
280
|
+
* your value is used instead.
|
281
|
+
*
|
282
|
+
* \param threshold The new value to use as the threshold.
|
283
|
+
*
|
284
|
+
* A pivot will be considered nonzero if its absolute value is strictly greater than
|
285
|
+
* \f$ \vert pivot \vert \leqslant threshold \times \vert maxpivot \vert \f$
|
286
|
+
* where maxpivot is the biggest pivot.
|
287
|
+
*
|
288
|
+
* If you want to come back to the default behavior, call setThreshold(Default_t)
|
289
|
+
*/
|
290
|
+
FullPivLU& setThreshold(const RealScalar& threshold)
|
291
|
+
{
|
292
|
+
m_usePrescribedThreshold = true;
|
293
|
+
m_prescribedThreshold = threshold;
|
294
|
+
return *this;
|
295
|
+
}
|
296
|
+
|
297
|
+
/** Allows to come back to the default behavior, letting Eigen use its default formula for
|
298
|
+
* determining the threshold.
|
299
|
+
*
|
300
|
+
* You should pass the special object Eigen::Default as parameter here.
|
301
|
+
* \code lu.setThreshold(Eigen::Default); \endcode
|
302
|
+
*
|
303
|
+
* See the documentation of setThreshold(const RealScalar&).
|
304
|
+
*/
|
305
|
+
FullPivLU& setThreshold(Default_t)
|
306
|
+
{
|
307
|
+
m_usePrescribedThreshold = false;
|
308
|
+
return *this;
|
309
|
+
}
|
310
|
+
|
311
|
+
/** Returns the threshold that will be used by certain methods such as rank().
|
312
|
+
*
|
313
|
+
* See the documentation of setThreshold(const RealScalar&).
|
314
|
+
*/
|
315
|
+
RealScalar threshold() const
|
316
|
+
{
|
317
|
+
eigen_assert(m_isInitialized || m_usePrescribedThreshold);
|
318
|
+
return m_usePrescribedThreshold ? m_prescribedThreshold
|
319
|
+
// this formula comes from experimenting (see "LU precision tuning" thread on the list)
|
320
|
+
// and turns out to be identical to Higham's formula used already in LDLt.
|
321
|
+
: NumTraits<Scalar>::epsilon() * RealScalar(m_lu.diagonalSize());
|
322
|
+
}
|
323
|
+
|
324
|
+
/** \returns the rank of the matrix of which *this is the LU decomposition.
|
325
|
+
*
|
326
|
+
* \note This method has to determine which pivots should be considered nonzero.
|
327
|
+
* For that, it uses the threshold value that you can control by calling
|
328
|
+
* setThreshold(const RealScalar&).
|
329
|
+
*/
|
330
|
+
inline Index rank() const
|
331
|
+
{
|
332
|
+
using std::abs;
|
333
|
+
eigen_assert(m_isInitialized && "LU is not initialized.");
|
334
|
+
RealScalar premultiplied_threshold = abs(m_maxpivot) * threshold();
|
335
|
+
Index result = 0;
|
336
|
+
for(Index i = 0; i < m_nonzero_pivots; ++i)
|
337
|
+
result += (abs(m_lu.coeff(i,i)) > premultiplied_threshold);
|
338
|
+
return result;
|
339
|
+
}
|
340
|
+
|
341
|
+
/** \returns the dimension of the kernel of the matrix of which *this is the LU decomposition.
|
342
|
+
*
|
343
|
+
* \note This method has to determine which pivots should be considered nonzero.
|
344
|
+
* For that, it uses the threshold value that you can control by calling
|
345
|
+
* setThreshold(const RealScalar&).
|
346
|
+
*/
|
347
|
+
inline Index dimensionOfKernel() const
|
348
|
+
{
|
349
|
+
eigen_assert(m_isInitialized && "LU is not initialized.");
|
350
|
+
return cols() - rank();
|
351
|
+
}
|
352
|
+
|
353
|
+
/** \returns true if the matrix of which *this is the LU decomposition represents an injective
|
354
|
+
* linear map, i.e. has trivial kernel; false otherwise.
|
355
|
+
*
|
356
|
+
* \note This method has to determine which pivots should be considered nonzero.
|
357
|
+
* For that, it uses the threshold value that you can control by calling
|
358
|
+
* setThreshold(const RealScalar&).
|
359
|
+
*/
|
360
|
+
inline bool isInjective() const
|
361
|
+
{
|
362
|
+
eigen_assert(m_isInitialized && "LU is not initialized.");
|
363
|
+
return rank() == cols();
|
364
|
+
}
|
365
|
+
|
366
|
+
/** \returns true if the matrix of which *this is the LU decomposition represents a surjective
|
367
|
+
* linear map; false otherwise.
|
368
|
+
*
|
369
|
+
* \note This method has to determine which pivots should be considered nonzero.
|
370
|
+
* For that, it uses the threshold value that you can control by calling
|
371
|
+
* setThreshold(const RealScalar&).
|
372
|
+
*/
|
373
|
+
inline bool isSurjective() const
|
374
|
+
{
|
375
|
+
eigen_assert(m_isInitialized && "LU is not initialized.");
|
376
|
+
return rank() == rows();
|
377
|
+
}
|
378
|
+
|
379
|
+
/** \returns true if the matrix of which *this is the LU decomposition is invertible.
|
380
|
+
*
|
381
|
+
* \note This method has to determine which pivots should be considered nonzero.
|
382
|
+
* For that, it uses the threshold value that you can control by calling
|
383
|
+
* setThreshold(const RealScalar&).
|
384
|
+
*/
|
385
|
+
inline bool isInvertible() const
|
386
|
+
{
|
387
|
+
eigen_assert(m_isInitialized && "LU is not initialized.");
|
388
|
+
return isInjective() && (m_lu.rows() == m_lu.cols());
|
389
|
+
}
|
390
|
+
|
391
|
+
/** \returns the inverse of the matrix of which *this is the LU decomposition.
|
392
|
+
*
|
393
|
+
* \note If this matrix is not invertible, the returned matrix has undefined coefficients.
|
394
|
+
* Use isInvertible() to first determine whether this matrix is invertible.
|
395
|
+
*
|
396
|
+
* \sa MatrixBase::inverse()
|
397
|
+
*/
|
398
|
+
inline const Inverse<FullPivLU> inverse() const
|
399
|
+
{
|
400
|
+
eigen_assert(m_isInitialized && "LU is not initialized.");
|
401
|
+
eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the inverse of a non-square matrix!");
|
402
|
+
return Inverse<FullPivLU>(*this);
|
403
|
+
}
|
404
|
+
|
405
|
+
MatrixType reconstructedMatrix() const;
|
406
|
+
|
407
|
+
EIGEN_DEVICE_FUNC EIGEN_CONSTEXPR
|
408
|
+
inline Index rows() const EIGEN_NOEXCEPT { return m_lu.rows(); }
|
409
|
+
EIGEN_DEVICE_FUNC EIGEN_CONSTEXPR
|
410
|
+
inline Index cols() const EIGEN_NOEXCEPT { return m_lu.cols(); }
|
411
|
+
|
412
|
+
#ifndef EIGEN_PARSED_BY_DOXYGEN
|
413
|
+
template<typename RhsType, typename DstType>
|
414
|
+
void _solve_impl(const RhsType &rhs, DstType &dst) const;
|
415
|
+
|
416
|
+
template<bool Conjugate, typename RhsType, typename DstType>
|
417
|
+
void _solve_impl_transposed(const RhsType &rhs, DstType &dst) const;
|
418
|
+
#endif
|
419
|
+
|
420
|
+
protected:
|
421
|
+
|
422
|
+
static void check_template_parameters()
|
423
|
+
{
|
424
|
+
EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar);
|
425
|
+
}
|
426
|
+
|
427
|
+
void computeInPlace();
|
428
|
+
|
429
|
+
MatrixType m_lu;
|
430
|
+
PermutationPType m_p;
|
431
|
+
PermutationQType m_q;
|
432
|
+
IntColVectorType m_rowsTranspositions;
|
433
|
+
IntRowVectorType m_colsTranspositions;
|
434
|
+
Index m_nonzero_pivots;
|
435
|
+
RealScalar m_l1_norm;
|
436
|
+
RealScalar m_maxpivot, m_prescribedThreshold;
|
437
|
+
signed char m_det_pq;
|
438
|
+
bool m_isInitialized, m_usePrescribedThreshold;
|
439
|
+
};
|
440
|
+
|
441
|
+
template<typename MatrixType>
|
442
|
+
FullPivLU<MatrixType>::FullPivLU()
|
443
|
+
: m_isInitialized(false), m_usePrescribedThreshold(false)
|
444
|
+
{
|
445
|
+
}
|
446
|
+
|
447
|
+
template<typename MatrixType>
|
448
|
+
FullPivLU<MatrixType>::FullPivLU(Index rows, Index cols)
|
449
|
+
: m_lu(rows, cols),
|
450
|
+
m_p(rows),
|
451
|
+
m_q(cols),
|
452
|
+
m_rowsTranspositions(rows),
|
453
|
+
m_colsTranspositions(cols),
|
454
|
+
m_isInitialized(false),
|
455
|
+
m_usePrescribedThreshold(false)
|
456
|
+
{
|
457
|
+
}
|
458
|
+
|
459
|
+
template<typename MatrixType>
|
460
|
+
template<typename InputType>
|
461
|
+
FullPivLU<MatrixType>::FullPivLU(const EigenBase<InputType>& matrix)
|
462
|
+
: m_lu(matrix.rows(), matrix.cols()),
|
463
|
+
m_p(matrix.rows()),
|
464
|
+
m_q(matrix.cols()),
|
465
|
+
m_rowsTranspositions(matrix.rows()),
|
466
|
+
m_colsTranspositions(matrix.cols()),
|
467
|
+
m_isInitialized(false),
|
468
|
+
m_usePrescribedThreshold(false)
|
469
|
+
{
|
470
|
+
compute(matrix.derived());
|
471
|
+
}
|
472
|
+
|
473
|
+
template<typename MatrixType>
|
474
|
+
template<typename InputType>
|
475
|
+
FullPivLU<MatrixType>::FullPivLU(EigenBase<InputType>& matrix)
|
476
|
+
: m_lu(matrix.derived()),
|
477
|
+
m_p(matrix.rows()),
|
478
|
+
m_q(matrix.cols()),
|
479
|
+
m_rowsTranspositions(matrix.rows()),
|
480
|
+
m_colsTranspositions(matrix.cols()),
|
481
|
+
m_isInitialized(false),
|
482
|
+
m_usePrescribedThreshold(false)
|
483
|
+
{
|
484
|
+
computeInPlace();
|
485
|
+
}
|
486
|
+
|
487
|
+
template<typename MatrixType>
|
488
|
+
void FullPivLU<MatrixType>::computeInPlace()
|
489
|
+
{
|
490
|
+
check_template_parameters();
|
491
|
+
|
492
|
+
// the permutations are stored as int indices, so just to be sure:
|
493
|
+
eigen_assert(m_lu.rows()<=NumTraits<int>::highest() && m_lu.cols()<=NumTraits<int>::highest());
|
494
|
+
|
495
|
+
m_l1_norm = m_lu.cwiseAbs().colwise().sum().maxCoeff();
|
496
|
+
|
497
|
+
const Index size = m_lu.diagonalSize();
|
498
|
+
const Index rows = m_lu.rows();
|
499
|
+
const Index cols = m_lu.cols();
|
500
|
+
|
501
|
+
// will store the transpositions, before we accumulate them at the end.
|
502
|
+
// can't accumulate on-the-fly because that will be done in reverse order for the rows.
|
503
|
+
m_rowsTranspositions.resize(m_lu.rows());
|
504
|
+
m_colsTranspositions.resize(m_lu.cols());
|
505
|
+
Index number_of_transpositions = 0; // number of NONTRIVIAL transpositions, i.e. m_rowsTranspositions[i]!=i
|
506
|
+
|
507
|
+
m_nonzero_pivots = size; // the generic case is that in which all pivots are nonzero (invertible case)
|
508
|
+
m_maxpivot = RealScalar(0);
|
509
|
+
|
510
|
+
for(Index k = 0; k < size; ++k)
|
511
|
+
{
|
512
|
+
// First, we need to find the pivot.
|
513
|
+
|
514
|
+
// biggest coefficient in the remaining bottom-right corner (starting at row k, col k)
|
515
|
+
Index row_of_biggest_in_corner, col_of_biggest_in_corner;
|
516
|
+
typedef internal::scalar_score_coeff_op<Scalar> Scoring;
|
517
|
+
typedef typename Scoring::result_type Score;
|
518
|
+
Score biggest_in_corner;
|
519
|
+
biggest_in_corner = m_lu.bottomRightCorner(rows-k, cols-k)
|
520
|
+
.unaryExpr(Scoring())
|
521
|
+
.maxCoeff(&row_of_biggest_in_corner, &col_of_biggest_in_corner);
|
522
|
+
row_of_biggest_in_corner += k; // correct the values! since they were computed in the corner,
|
523
|
+
col_of_biggest_in_corner += k; // need to add k to them.
|
524
|
+
|
525
|
+
if(biggest_in_corner==Score(0))
|
526
|
+
{
|
527
|
+
// before exiting, make sure to initialize the still uninitialized transpositions
|
528
|
+
// in a sane state without destroying what we already have.
|
529
|
+
m_nonzero_pivots = k;
|
530
|
+
for(Index i = k; i < size; ++i)
|
531
|
+
{
|
532
|
+
m_rowsTranspositions.coeffRef(i) = internal::convert_index<StorageIndex>(i);
|
533
|
+
m_colsTranspositions.coeffRef(i) = internal::convert_index<StorageIndex>(i);
|
534
|
+
}
|
535
|
+
break;
|
536
|
+
}
|
537
|
+
|
538
|
+
RealScalar abs_pivot = internal::abs_knowing_score<Scalar>()(m_lu(row_of_biggest_in_corner, col_of_biggest_in_corner), biggest_in_corner);
|
539
|
+
if(abs_pivot > m_maxpivot) m_maxpivot = abs_pivot;
|
540
|
+
|
541
|
+
// Now that we've found the pivot, we need to apply the row/col swaps to
|
542
|
+
// bring it to the location (k,k).
|
543
|
+
|
544
|
+
m_rowsTranspositions.coeffRef(k) = internal::convert_index<StorageIndex>(row_of_biggest_in_corner);
|
545
|
+
m_colsTranspositions.coeffRef(k) = internal::convert_index<StorageIndex>(col_of_biggest_in_corner);
|
546
|
+
if(k != row_of_biggest_in_corner) {
|
547
|
+
m_lu.row(k).swap(m_lu.row(row_of_biggest_in_corner));
|
548
|
+
++number_of_transpositions;
|
549
|
+
}
|
550
|
+
if(k != col_of_biggest_in_corner) {
|
551
|
+
m_lu.col(k).swap(m_lu.col(col_of_biggest_in_corner));
|
552
|
+
++number_of_transpositions;
|
553
|
+
}
|
554
|
+
|
555
|
+
// Now that the pivot is at the right location, we update the remaining
|
556
|
+
// bottom-right corner by Gaussian elimination.
|
557
|
+
|
558
|
+
if(k<rows-1)
|
559
|
+
m_lu.col(k).tail(rows-k-1) /= m_lu.coeff(k,k);
|
560
|
+
if(k<size-1)
|
561
|
+
m_lu.block(k+1,k+1,rows-k-1,cols-k-1).noalias() -= m_lu.col(k).tail(rows-k-1) * m_lu.row(k).tail(cols-k-1);
|
562
|
+
}
|
563
|
+
|
564
|
+
// the main loop is over, we still have to accumulate the transpositions to find the
|
565
|
+
// permutations P and Q
|
566
|
+
|
567
|
+
m_p.setIdentity(rows);
|
568
|
+
for(Index k = size-1; k >= 0; --k)
|
569
|
+
m_p.applyTranspositionOnTheRight(k, m_rowsTranspositions.coeff(k));
|
570
|
+
|
571
|
+
m_q.setIdentity(cols);
|
572
|
+
for(Index k = 0; k < size; ++k)
|
573
|
+
m_q.applyTranspositionOnTheRight(k, m_colsTranspositions.coeff(k));
|
574
|
+
|
575
|
+
m_det_pq = (number_of_transpositions%2) ? -1 : 1;
|
576
|
+
|
577
|
+
m_isInitialized = true;
|
578
|
+
}
|
579
|
+
|
580
|
+
template<typename MatrixType>
|
581
|
+
typename internal::traits<MatrixType>::Scalar FullPivLU<MatrixType>::determinant() const
|
582
|
+
{
|
583
|
+
eigen_assert(m_isInitialized && "LU is not initialized.");
|
584
|
+
eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the determinant of a non-square matrix!");
|
585
|
+
return Scalar(m_det_pq) * Scalar(m_lu.diagonal().prod());
|
586
|
+
}
|
587
|
+
|
588
|
+
/** \returns the matrix represented by the decomposition,
|
589
|
+
* i.e., it returns the product: \f$ P^{-1} L U Q^{-1} \f$.
|
590
|
+
* This function is provided for debug purposes. */
|
591
|
+
template<typename MatrixType>
|
592
|
+
MatrixType FullPivLU<MatrixType>::reconstructedMatrix() const
|
593
|
+
{
|
594
|
+
eigen_assert(m_isInitialized && "LU is not initialized.");
|
595
|
+
const Index smalldim = (std::min)(m_lu.rows(), m_lu.cols());
|
596
|
+
// LU
|
597
|
+
MatrixType res(m_lu.rows(),m_lu.cols());
|
598
|
+
// FIXME the .toDenseMatrix() should not be needed...
|
599
|
+
res = m_lu.leftCols(smalldim)
|
600
|
+
.template triangularView<UnitLower>().toDenseMatrix()
|
601
|
+
* m_lu.topRows(smalldim)
|
602
|
+
.template triangularView<Upper>().toDenseMatrix();
|
603
|
+
|
604
|
+
// P^{-1}(LU)
|
605
|
+
res = m_p.inverse() * res;
|
606
|
+
|
607
|
+
// (P^{-1}LU)Q^{-1}
|
608
|
+
res = res * m_q.inverse();
|
609
|
+
|
610
|
+
return res;
|
611
|
+
}
|
612
|
+
|
613
|
+
/********* Implementation of kernel() **************************************************/
|
614
|
+
|
615
|
+
namespace internal {
|
616
|
+
template<typename _MatrixType>
|
617
|
+
struct kernel_retval<FullPivLU<_MatrixType> >
|
618
|
+
: kernel_retval_base<FullPivLU<_MatrixType> >
|
619
|
+
{
|
620
|
+
EIGEN_MAKE_KERNEL_HELPERS(FullPivLU<_MatrixType>)
|
621
|
+
|
622
|
+
enum { MaxSmallDimAtCompileTime = EIGEN_SIZE_MIN_PREFER_FIXED(
|
623
|
+
MatrixType::MaxColsAtCompileTime,
|
624
|
+
MatrixType::MaxRowsAtCompileTime)
|
625
|
+
};
|
626
|
+
|
627
|
+
template<typename Dest> void evalTo(Dest& dst) const
|
628
|
+
{
|
629
|
+
using std::abs;
|
630
|
+
const Index cols = dec().matrixLU().cols(), dimker = cols - rank();
|
631
|
+
if(dimker == 0)
|
632
|
+
{
|
633
|
+
// The Kernel is just {0}, so it doesn't have a basis properly speaking, but let's
|
634
|
+
// avoid crashing/asserting as that depends on floating point calculations. Let's
|
635
|
+
// just return a single column vector filled with zeros.
|
636
|
+
dst.setZero();
|
637
|
+
return;
|
638
|
+
}
|
639
|
+
|
640
|
+
/* Let us use the following lemma:
|
641
|
+
*
|
642
|
+
* Lemma: If the matrix A has the LU decomposition PAQ = LU,
|
643
|
+
* then Ker A = Q(Ker U).
|
644
|
+
*
|
645
|
+
* Proof: trivial: just keep in mind that P, Q, L are invertible.
|
646
|
+
*/
|
647
|
+
|
648
|
+
/* Thus, all we need to do is to compute Ker U, and then apply Q.
|
649
|
+
*
|
650
|
+
* U is upper triangular, with eigenvalues sorted so that any zeros appear at the end.
|
651
|
+
* Thus, the diagonal of U ends with exactly
|
652
|
+
* dimKer zero's. Let us use that to construct dimKer linearly
|
653
|
+
* independent vectors in Ker U.
|
654
|
+
*/
|
655
|
+
|
656
|
+
Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 1> pivots(rank());
|
657
|
+
RealScalar premultiplied_threshold = dec().maxPivot() * dec().threshold();
|
658
|
+
Index p = 0;
|
659
|
+
for(Index i = 0; i < dec().nonzeroPivots(); ++i)
|
660
|
+
if(abs(dec().matrixLU().coeff(i,i)) > premultiplied_threshold)
|
661
|
+
pivots.coeffRef(p++) = i;
|
662
|
+
eigen_internal_assert(p == rank());
|
663
|
+
|
664
|
+
// we construct a temporaty trapezoid matrix m, by taking the U matrix and
|
665
|
+
// permuting the rows and cols to bring the nonnegligible pivots to the top of
|
666
|
+
// the main diagonal. We need that to be able to apply our triangular solvers.
|
667
|
+
// FIXME when we get triangularView-for-rectangular-matrices, this can be simplified
|
668
|
+
Matrix<typename MatrixType::Scalar, Dynamic, Dynamic, MatrixType::Options,
|
669
|
+
MaxSmallDimAtCompileTime, MatrixType::MaxColsAtCompileTime>
|
670
|
+
m(dec().matrixLU().block(0, 0, rank(), cols));
|
671
|
+
for(Index i = 0; i < rank(); ++i)
|
672
|
+
{
|
673
|
+
if(i) m.row(i).head(i).setZero();
|
674
|
+
m.row(i).tail(cols-i) = dec().matrixLU().row(pivots.coeff(i)).tail(cols-i);
|
675
|
+
}
|
676
|
+
m.block(0, 0, rank(), rank());
|
677
|
+
m.block(0, 0, rank(), rank()).template triangularView<StrictlyLower>().setZero();
|
678
|
+
for(Index i = 0; i < rank(); ++i)
|
679
|
+
m.col(i).swap(m.col(pivots.coeff(i)));
|
680
|
+
|
681
|
+
// ok, we have our trapezoid matrix, we can apply the triangular solver.
|
682
|
+
// notice that the math behind this suggests that we should apply this to the
|
683
|
+
// negative of the RHS, but for performance we just put the negative sign elsewhere, see below.
|
684
|
+
m.topLeftCorner(rank(), rank())
|
685
|
+
.template triangularView<Upper>().solveInPlace(
|
686
|
+
m.topRightCorner(rank(), dimker)
|
687
|
+
);
|
688
|
+
|
689
|
+
// now we must undo the column permutation that we had applied!
|
690
|
+
for(Index i = rank()-1; i >= 0; --i)
|
691
|
+
m.col(i).swap(m.col(pivots.coeff(i)));
|
692
|
+
|
693
|
+
// see the negative sign in the next line, that's what we were talking about above.
|
694
|
+
for(Index i = 0; i < rank(); ++i) dst.row(dec().permutationQ().indices().coeff(i)) = -m.row(i).tail(dimker);
|
695
|
+
for(Index i = rank(); i < cols; ++i) dst.row(dec().permutationQ().indices().coeff(i)).setZero();
|
696
|
+
for(Index k = 0; k < dimker; ++k) dst.coeffRef(dec().permutationQ().indices().coeff(rank()+k), k) = Scalar(1);
|
697
|
+
}
|
698
|
+
};
|
699
|
+
|
700
|
+
/***** Implementation of image() *****************************************************/
|
701
|
+
|
702
|
+
template<typename _MatrixType>
|
703
|
+
struct image_retval<FullPivLU<_MatrixType> >
|
704
|
+
: image_retval_base<FullPivLU<_MatrixType> >
|
705
|
+
{
|
706
|
+
EIGEN_MAKE_IMAGE_HELPERS(FullPivLU<_MatrixType>)
|
707
|
+
|
708
|
+
enum { MaxSmallDimAtCompileTime = EIGEN_SIZE_MIN_PREFER_FIXED(
|
709
|
+
MatrixType::MaxColsAtCompileTime,
|
710
|
+
MatrixType::MaxRowsAtCompileTime)
|
711
|
+
};
|
712
|
+
|
713
|
+
template<typename Dest> void evalTo(Dest& dst) const
|
714
|
+
{
|
715
|
+
using std::abs;
|
716
|
+
if(rank() == 0)
|
717
|
+
{
|
718
|
+
// The Image is just {0}, so it doesn't have a basis properly speaking, but let's
|
719
|
+
// avoid crashing/asserting as that depends on floating point calculations. Let's
|
720
|
+
// just return a single column vector filled with zeros.
|
721
|
+
dst.setZero();
|
722
|
+
return;
|
723
|
+
}
|
724
|
+
|
725
|
+
Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 1> pivots(rank());
|
726
|
+
RealScalar premultiplied_threshold = dec().maxPivot() * dec().threshold();
|
727
|
+
Index p = 0;
|
728
|
+
for(Index i = 0; i < dec().nonzeroPivots(); ++i)
|
729
|
+
if(abs(dec().matrixLU().coeff(i,i)) > premultiplied_threshold)
|
730
|
+
pivots.coeffRef(p++) = i;
|
731
|
+
eigen_internal_assert(p == rank());
|
732
|
+
|
733
|
+
for(Index i = 0; i < rank(); ++i)
|
734
|
+
dst.col(i) = originalMatrix().col(dec().permutationQ().indices().coeff(pivots.coeff(i)));
|
735
|
+
}
|
736
|
+
};
|
737
|
+
|
738
|
+
/***** Implementation of solve() *****************************************************/
|
739
|
+
|
740
|
+
} // end namespace internal
|
741
|
+
|
742
|
+
#ifndef EIGEN_PARSED_BY_DOXYGEN
|
743
|
+
template<typename _MatrixType>
|
744
|
+
template<typename RhsType, typename DstType>
|
745
|
+
void FullPivLU<_MatrixType>::_solve_impl(const RhsType &rhs, DstType &dst) const
|
746
|
+
{
|
747
|
+
/* The decomposition PAQ = LU can be rewritten as A = P^{-1} L U Q^{-1}.
|
748
|
+
* So we proceed as follows:
|
749
|
+
* Step 1: compute c = P * rhs.
|
750
|
+
* Step 2: replace c by the solution x to Lx = c. Exists because L is invertible.
|
751
|
+
* Step 3: replace c by the solution x to Ux = c. May or may not exist.
|
752
|
+
* Step 4: result = Q * c;
|
753
|
+
*/
|
754
|
+
|
755
|
+
const Index rows = this->rows(),
|
756
|
+
cols = this->cols(),
|
757
|
+
nonzero_pivots = this->rank();
|
758
|
+
const Index smalldim = (std::min)(rows, cols);
|
759
|
+
|
760
|
+
if(nonzero_pivots == 0)
|
761
|
+
{
|
762
|
+
dst.setZero();
|
763
|
+
return;
|
764
|
+
}
|
765
|
+
|
766
|
+
typename RhsType::PlainObject c(rhs.rows(), rhs.cols());
|
767
|
+
|
768
|
+
// Step 1
|
769
|
+
c = permutationP() * rhs;
|
770
|
+
|
771
|
+
// Step 2
|
772
|
+
m_lu.topLeftCorner(smalldim,smalldim)
|
773
|
+
.template triangularView<UnitLower>()
|
774
|
+
.solveInPlace(c.topRows(smalldim));
|
775
|
+
if(rows>cols)
|
776
|
+
c.bottomRows(rows-cols) -= m_lu.bottomRows(rows-cols) * c.topRows(cols);
|
777
|
+
|
778
|
+
// Step 3
|
779
|
+
m_lu.topLeftCorner(nonzero_pivots, nonzero_pivots)
|
780
|
+
.template triangularView<Upper>()
|
781
|
+
.solveInPlace(c.topRows(nonzero_pivots));
|
782
|
+
|
783
|
+
// Step 4
|
784
|
+
for(Index i = 0; i < nonzero_pivots; ++i)
|
785
|
+
dst.row(permutationQ().indices().coeff(i)) = c.row(i);
|
786
|
+
for(Index i = nonzero_pivots; i < m_lu.cols(); ++i)
|
787
|
+
dst.row(permutationQ().indices().coeff(i)).setZero();
|
788
|
+
}
|
789
|
+
|
790
|
+
template<typename _MatrixType>
|
791
|
+
template<bool Conjugate, typename RhsType, typename DstType>
|
792
|
+
void FullPivLU<_MatrixType>::_solve_impl_transposed(const RhsType &rhs, DstType &dst) const
|
793
|
+
{
|
794
|
+
/* The decomposition PAQ = LU can be rewritten as A = P^{-1} L U Q^{-1},
|
795
|
+
* and since permutations are real and unitary, we can write this
|
796
|
+
* as A^T = Q U^T L^T P,
|
797
|
+
* So we proceed as follows:
|
798
|
+
* Step 1: compute c = Q^T rhs.
|
799
|
+
* Step 2: replace c by the solution x to U^T x = c. May or may not exist.
|
800
|
+
* Step 3: replace c by the solution x to L^T x = c.
|
801
|
+
* Step 4: result = P^T c.
|
802
|
+
* If Conjugate is true, replace "^T" by "^*" above.
|
803
|
+
*/
|
804
|
+
|
805
|
+
const Index rows = this->rows(), cols = this->cols(),
|
806
|
+
nonzero_pivots = this->rank();
|
807
|
+
const Index smalldim = (std::min)(rows, cols);
|
808
|
+
|
809
|
+
if(nonzero_pivots == 0)
|
810
|
+
{
|
811
|
+
dst.setZero();
|
812
|
+
return;
|
813
|
+
}
|
814
|
+
|
815
|
+
typename RhsType::PlainObject c(rhs.rows(), rhs.cols());
|
816
|
+
|
817
|
+
// Step 1
|
818
|
+
c = permutationQ().inverse() * rhs;
|
819
|
+
|
820
|
+
// Step 2
|
821
|
+
m_lu.topLeftCorner(nonzero_pivots, nonzero_pivots)
|
822
|
+
.template triangularView<Upper>()
|
823
|
+
.transpose()
|
824
|
+
.template conjugateIf<Conjugate>()
|
825
|
+
.solveInPlace(c.topRows(nonzero_pivots));
|
826
|
+
|
827
|
+
// Step 3
|
828
|
+
m_lu.topLeftCorner(smalldim, smalldim)
|
829
|
+
.template triangularView<UnitLower>()
|
830
|
+
.transpose()
|
831
|
+
.template conjugateIf<Conjugate>()
|
832
|
+
.solveInPlace(c.topRows(smalldim));
|
833
|
+
|
834
|
+
// Step 4
|
835
|
+
PermutationPType invp = permutationP().inverse().eval();
|
836
|
+
for(Index i = 0; i < smalldim; ++i)
|
837
|
+
dst.row(invp.indices().coeff(i)) = c.row(i);
|
838
|
+
for(Index i = smalldim; i < rows; ++i)
|
839
|
+
dst.row(invp.indices().coeff(i)).setZero();
|
840
|
+
}
|
841
|
+
|
842
|
+
#endif
|
843
|
+
|
844
|
+
namespace internal {
|
845
|
+
|
846
|
+
|
847
|
+
/***** Implementation of inverse() *****************************************************/
|
848
|
+
template<typename DstXprType, typename MatrixType>
|
849
|
+
struct Assignment<DstXprType, Inverse<FullPivLU<MatrixType> >, internal::assign_op<typename DstXprType::Scalar,typename FullPivLU<MatrixType>::Scalar>, Dense2Dense>
|
850
|
+
{
|
851
|
+
typedef FullPivLU<MatrixType> LuType;
|
852
|
+
typedef Inverse<LuType> SrcXprType;
|
853
|
+
static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op<typename DstXprType::Scalar,typename MatrixType::Scalar> &)
|
854
|
+
{
|
855
|
+
dst = src.nestedExpression().solve(MatrixType::Identity(src.rows(), src.cols()));
|
856
|
+
}
|
857
|
+
};
|
858
|
+
} // end namespace internal
|
859
|
+
|
860
|
+
/******* MatrixBase methods *****************************************************************/
|
861
|
+
|
862
|
+
/** \lu_module
|
863
|
+
*
|
864
|
+
* \return the full-pivoting LU decomposition of \c *this.
|
865
|
+
*
|
866
|
+
* \sa class FullPivLU
|
867
|
+
*/
|
868
|
+
template<typename Derived>
|
869
|
+
inline const FullPivLU<typename MatrixBase<Derived>::PlainObject>
|
870
|
+
MatrixBase<Derived>::fullPivLu() const
|
871
|
+
{
|
872
|
+
return FullPivLU<PlainObject>(eval());
|
873
|
+
}
|
874
|
+
|
875
|
+
} // end namespace Eigen
|
876
|
+
|
877
|
+
#endif // EIGEN_LU_H
|