ruby-eigen 0.0.9 → 0.0.10.pre1
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/LICENSE +22 -0
- data/README.md +21 -0
- data/ext/eigen/eigen3/COPYING.BSD +26 -0
- data/ext/eigen/eigen3/COPYING.MPL2 +373 -0
- data/ext/eigen/eigen3/COPYING.README +18 -0
- data/ext/eigen/eigen3/Eigen/Array +11 -0
- data/ext/eigen/eigen3/Eigen/Cholesky +32 -0
- data/ext/eigen/eigen3/Eigen/CholmodSupport +45 -0
- data/ext/eigen/eigen3/Eigen/Core +376 -0
- data/ext/eigen/eigen3/Eigen/Dense +7 -0
- data/ext/eigen/eigen3/Eigen/Eigen +2 -0
- data/ext/eigen/eigen3/Eigen/Eigen2Support +95 -0
- data/ext/eigen/eigen3/Eigen/Eigenvalues +48 -0
- data/ext/eigen/eigen3/Eigen/Geometry +63 -0
- data/ext/eigen/eigen3/Eigen/Householder +23 -0
- data/ext/eigen/eigen3/Eigen/IterativeLinearSolvers +40 -0
- data/ext/eigen/eigen3/Eigen/Jacobi +26 -0
- data/ext/eigen/eigen3/Eigen/LU +41 -0
- data/ext/eigen/eigen3/Eigen/LeastSquares +32 -0
- data/ext/eigen/eigen3/Eigen/MetisSupport +28 -0
- data/ext/eigen/eigen3/Eigen/PaStiXSupport +46 -0
- data/ext/eigen/eigen3/Eigen/PardisoSupport +30 -0
- data/ext/eigen/eigen3/Eigen/QR +45 -0
- data/ext/eigen/eigen3/Eigen/QtAlignedMalloc +34 -0
- data/ext/eigen/eigen3/Eigen/SPQRSupport +29 -0
- data/ext/eigen/eigen3/Eigen/SVD +37 -0
- data/ext/eigen/eigen3/Eigen/Sparse +27 -0
- data/ext/eigen/eigen3/Eigen/SparseCore +64 -0
- data/ext/eigen/eigen3/Eigen/SparseLU +49 -0
- data/ext/eigen/eigen3/Eigen/SparseQR +33 -0
- data/ext/eigen/eigen3/Eigen/StdDeque +27 -0
- data/ext/eigen/eigen3/Eigen/StdList +26 -0
- data/ext/eigen/eigen3/Eigen/StdVector +27 -0
- data/ext/eigen/eigen3/Eigen/SuperLUSupport +59 -0
- data/ext/eigen/eigen3/Eigen/UmfPackSupport +36 -0
- data/ext/eigen/eigen3/Eigen/src/Cholesky/LDLT.h +611 -0
- data/ext/eigen/eigen3/Eigen/src/Cholesky/LLT.h +498 -0
- data/ext/eigen/eigen3/Eigen/src/Cholesky/LLT_MKL.h +102 -0
- data/ext/eigen/eigen3/Eigen/src/CholmodSupport/CholmodSupport.h +607 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Array.h +323 -0
- data/ext/eigen/eigen3/Eigen/src/Core/ArrayBase.h +226 -0
- data/ext/eigen/eigen3/Eigen/src/Core/ArrayWrapper.h +264 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Assign.h +590 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Assign_MKL.h +224 -0
- data/ext/eigen/eigen3/Eigen/src/Core/BandMatrix.h +334 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Block.h +406 -0
- data/ext/eigen/eigen3/Eigen/src/Core/BooleanRedux.h +154 -0
- data/ext/eigen/eigen3/Eigen/src/Core/CommaInitializer.h +154 -0
- data/ext/eigen/eigen3/Eigen/src/Core/CoreIterators.h +61 -0
- data/ext/eigen/eigen3/Eigen/src/Core/CwiseBinaryOp.h +230 -0
- data/ext/eigen/eigen3/Eigen/src/Core/CwiseNullaryOp.h +864 -0
- data/ext/eigen/eigen3/Eigen/src/Core/CwiseUnaryOp.h +126 -0
- data/ext/eigen/eigen3/Eigen/src/Core/CwiseUnaryView.h +139 -0
- data/ext/eigen/eigen3/Eigen/src/Core/DenseBase.h +521 -0
- data/ext/eigen/eigen3/Eigen/src/Core/DenseCoeffsBase.h +754 -0
- data/ext/eigen/eigen3/Eigen/src/Core/DenseStorage.h +434 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Diagonal.h +237 -0
- data/ext/eigen/eigen3/Eigen/src/Core/DiagonalMatrix.h +313 -0
- data/ext/eigen/eigen3/Eigen/src/Core/DiagonalProduct.h +131 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Dot.h +263 -0
- data/ext/eigen/eigen3/Eigen/src/Core/EigenBase.h +131 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Flagged.h +140 -0
- data/ext/eigen/eigen3/Eigen/src/Core/ForceAlignedAccess.h +146 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Functors.h +1026 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Fuzzy.h +150 -0
- data/ext/eigen/eigen3/Eigen/src/Core/GeneralProduct.h +635 -0
- data/ext/eigen/eigen3/Eigen/src/Core/GenericPacketMath.h +350 -0
- data/ext/eigen/eigen3/Eigen/src/Core/GlobalFunctions.h +92 -0
- data/ext/eigen/eigen3/Eigen/src/Core/IO.h +250 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Map.h +192 -0
- data/ext/eigen/eigen3/Eigen/src/Core/MapBase.h +247 -0
- data/ext/eigen/eigen3/Eigen/src/Core/MathFunctions.h +768 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Matrix.h +420 -0
- data/ext/eigen/eigen3/Eigen/src/Core/MatrixBase.h +563 -0
- data/ext/eigen/eigen3/Eigen/src/Core/NestByValue.h +111 -0
- data/ext/eigen/eigen3/Eigen/src/Core/NoAlias.h +134 -0
- data/ext/eigen/eigen3/Eigen/src/Core/NumTraits.h +150 -0
- data/ext/eigen/eigen3/Eigen/src/Core/PermutationMatrix.h +721 -0
- data/ext/eigen/eigen3/Eigen/src/Core/PlainObjectBase.h +822 -0
- data/ext/eigen/eigen3/Eigen/src/Core/ProductBase.h +290 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Random.h +152 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Redux.h +409 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Ref.h +278 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Replicate.h +177 -0
- data/ext/eigen/eigen3/Eigen/src/Core/ReturnByValue.h +99 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Reverse.h +224 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Select.h +162 -0
- data/ext/eigen/eigen3/Eigen/src/Core/SelfAdjointView.h +314 -0
- data/ext/eigen/eigen3/Eigen/src/Core/SelfCwiseBinaryOp.h +191 -0
- data/ext/eigen/eigen3/Eigen/src/Core/SolveTriangular.h +260 -0
- data/ext/eigen/eigen3/Eigen/src/Core/StableNorm.h +203 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Stride.h +108 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Swap.h +126 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Transpose.h +419 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Transpositions.h +436 -0
- data/ext/eigen/eigen3/Eigen/src/Core/TriangularMatrix.h +839 -0
- data/ext/eigen/eigen3/Eigen/src/Core/VectorBlock.h +95 -0
- data/ext/eigen/eigen3/Eigen/src/Core/VectorwiseOp.h +642 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Visitor.h +237 -0
- data/ext/eigen/eigen3/Eigen/src/Core/arch/AltiVec/Complex.h +217 -0
- data/ext/eigen/eigen3/Eigen/src/Core/arch/AltiVec/PacketMath.h +501 -0
- data/ext/eigen/eigen3/Eigen/src/Core/arch/Default/Settings.h +49 -0
- data/ext/eigen/eigen3/Eigen/src/Core/arch/NEON/Complex.h +253 -0
- data/ext/eigen/eigen3/Eigen/src/Core/arch/NEON/PacketMath.h +420 -0
- data/ext/eigen/eigen3/Eigen/src/Core/arch/SSE/Complex.h +442 -0
- data/ext/eigen/eigen3/Eigen/src/Core/arch/SSE/MathFunctions.h +475 -0
- data/ext/eigen/eigen3/Eigen/src/Core/arch/SSE/PacketMath.h +649 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/CoeffBasedProduct.h +476 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/GeneralBlockPanelKernel.h +1341 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/GeneralMatrixMatrix.h +427 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/GeneralMatrixMatrixTriangular.h +278 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/GeneralMatrixMatrixTriangular_MKL.h +146 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/GeneralMatrixMatrix_MKL.h +118 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/GeneralMatrixVector.h +566 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/GeneralMatrixVector_MKL.h +131 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/Parallelizer.h +162 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/SelfadjointMatrixMatrix.h +436 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/SelfadjointMatrixMatrix_MKL.h +295 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/SelfadjointMatrixVector.h +281 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/SelfadjointMatrixVector_MKL.h +114 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/SelfadjointProduct.h +123 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/SelfadjointRank2Update.h +93 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/TriangularMatrixMatrix.h +427 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/TriangularMatrixMatrix_MKL.h +309 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/TriangularMatrixVector.h +348 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/TriangularMatrixVector_MKL.h +247 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/TriangularSolverMatrix.h +332 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/TriangularSolverMatrix_MKL.h +155 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/TriangularSolverVector.h +139 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/BlasUtil.h +264 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/Constants.h +451 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/DisableStupidWarnings.h +40 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/ForwardDeclarations.h +302 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/MKL_support.h +158 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/Macros.h +451 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/Memory.h +977 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/Meta.h +243 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/NonMPL2.h +3 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/ReenableStupidWarnings.h +14 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/StaticAssert.h +208 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/XprHelper.h +469 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Block.h +126 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Cwise.h +192 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/CwiseOperators.h +298 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/AlignedBox.h +159 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/All.h +115 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/AngleAxis.h +214 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/Hyperplane.h +254 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/ParametrizedLine.h +141 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/Quaternion.h +495 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/Rotation2D.h +145 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/RotationBase.h +123 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/Scaling.h +167 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/Transform.h +786 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/Translation.h +184 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/LU.h +120 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Lazy.h +71 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/LeastSquares.h +169 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Macros.h +20 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/MathFunctions.h +57 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Memory.h +45 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Meta.h +75 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Minor.h +117 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/QR.h +67 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/SVD.h +637 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/TriangularSolver.h +42 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/VectorBlock.h +94 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/ComplexEigenSolver.h +341 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/ComplexSchur.h +456 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/ComplexSchur_MKL.h +94 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/EigenSolver.h +607 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/GeneralizedEigenSolver.h +350 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/GeneralizedSelfAdjointEigenSolver.h +227 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/HessenbergDecomposition.h +373 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/MatrixBaseEigenvalues.h +160 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/RealQZ.h +624 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/RealSchur.h +525 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/RealSchur_MKL.h +83 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h +801 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/SelfAdjointEigenSolver_MKL.h +92 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/Tridiagonalization.h +557 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/AlignedBox.h +392 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/AngleAxis.h +233 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/EulerAngles.h +104 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/Homogeneous.h +307 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/Hyperplane.h +280 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/OrthoMethods.h +218 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/ParametrizedLine.h +195 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/Quaternion.h +776 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/Rotation2D.h +160 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/RotationBase.h +206 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/Scaling.h +166 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/Transform.h +1455 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/Translation.h +206 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/Umeyama.h +177 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/arch/Geometry_SSE.h +115 -0
- data/ext/eigen/eigen3/Eigen/src/Householder/BlockHouseholder.h +68 -0
- data/ext/eigen/eigen3/Eigen/src/Householder/Householder.h +171 -0
- data/ext/eigen/eigen3/Eigen/src/Householder/HouseholderSequence.h +441 -0
- data/ext/eigen/eigen3/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h +149 -0
- data/ext/eigen/eigen3/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h +263 -0
- data/ext/eigen/eigen3/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h +256 -0
- data/ext/eigen/eigen3/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h +282 -0
- data/ext/eigen/eigen3/Eigen/src/Jacobi/Jacobi.h +433 -0
- data/ext/eigen/eigen3/Eigen/src/LU/Determinant.h +101 -0
- data/ext/eigen/eigen3/Eigen/src/LU/FullPivLU.h +751 -0
- data/ext/eigen/eigen3/Eigen/src/LU/Inverse.h +400 -0
- data/ext/eigen/eigen3/Eigen/src/LU/PartialPivLU.h +509 -0
- data/ext/eigen/eigen3/Eigen/src/LU/PartialPivLU_MKL.h +85 -0
- data/ext/eigen/eigen3/Eigen/src/LU/arch/Inverse_SSE.h +329 -0
- data/ext/eigen/eigen3/Eigen/src/MetisSupport/MetisSupport.h +137 -0
- data/ext/eigen/eigen3/Eigen/src/OrderingMethods/Amd.h +444 -0
- data/ext/eigen/eigen3/Eigen/src/OrderingMethods/Eigen_Colamd.h +1850 -0
- data/ext/eigen/eigen3/Eigen/src/PaStiXSupport/PaStiXSupport.h +721 -0
- data/ext/eigen/eigen3/Eigen/src/PardisoSupport/PardisoSupport.h +592 -0
- data/ext/eigen/eigen3/Eigen/src/QR/ColPivHouseholderQR.h +580 -0
- data/ext/eigen/eigen3/Eigen/src/QR/ColPivHouseholderQR_MKL.h +99 -0
- data/ext/eigen/eigen3/Eigen/src/QR/FullPivHouseholderQR.h +622 -0
- data/ext/eigen/eigen3/Eigen/src/QR/HouseholderQR.h +388 -0
- data/ext/eigen/eigen3/Eigen/src/QR/HouseholderQR_MKL.h +71 -0
- data/ext/eigen/eigen3/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h +338 -0
- data/ext/eigen/eigen3/Eigen/src/SVD/JacobiSVD.h +976 -0
- data/ext/eigen/eigen3/Eigen/src/SVD/JacobiSVD_MKL.h +92 -0
- data/ext/eigen/eigen3/Eigen/src/SVD/UpperBidiagonalization.h +148 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCholesky/SimplicialCholesky.h +671 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h +199 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/AmbiVector.h +373 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/CompressedStorage.h +233 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/ConservativeSparseSparseProduct.h +245 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/MappedSparseMatrix.h +181 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseBlock.h +537 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseColEtree.h +206 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseCwiseBinaryOp.h +325 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseCwiseUnaryOp.h +163 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseDenseProduct.h +311 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseDiagonalProduct.h +196 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseDot.h +101 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseFuzzy.h +26 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseMatrix.h +1262 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseMatrixBase.h +461 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparsePermutation.h +148 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseProduct.h +188 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseRedux.h +45 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseSelfAdjointView.h +507 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseSparseProductWithPruning.h +150 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseTranspose.h +63 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseTriangularView.h +179 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseUtil.h +172 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseVector.h +448 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseView.h +99 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/TriangularSolver.h +334 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU.h +806 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLUImpl.h +66 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_Memory.h +227 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_Structs.h +111 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_SupernodalMatrix.h +298 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_Utils.h +80 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_column_bmod.h +180 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_column_dfs.h +177 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_copy_to_ucol.h +106 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_gemm_kernel.h +279 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_heap_relax_snode.h +127 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_kernel_bmod.h +130 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_panel_bmod.h +223 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_panel_dfs.h +258 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_pivotL.h +137 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_pruneL.h +135 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_relax_snode.h +83 -0
- data/ext/eigen/eigen3/Eigen/src/SparseQR/SparseQR.h +714 -0
- data/ext/eigen/eigen3/Eigen/src/StlSupport/StdDeque.h +134 -0
- data/ext/eigen/eigen3/Eigen/src/StlSupport/StdList.h +114 -0
- data/ext/eigen/eigen3/Eigen/src/StlSupport/StdVector.h +126 -0
- data/ext/eigen/eigen3/Eigen/src/StlSupport/details.h +84 -0
- data/ext/eigen/eigen3/Eigen/src/SuperLUSupport/SuperLUSupport.h +1026 -0
- data/ext/eigen/eigen3/Eigen/src/UmfPackSupport/UmfPackSupport.h +474 -0
- data/ext/eigen/eigen3/Eigen/src/misc/Image.h +84 -0
- data/ext/eigen/eigen3/Eigen/src/misc/Kernel.h +81 -0
- data/ext/eigen/eigen3/Eigen/src/misc/Solve.h +76 -0
- data/ext/eigen/eigen3/Eigen/src/misc/SparseSolve.h +128 -0
- data/ext/eigen/eigen3/Eigen/src/misc/blas.h +658 -0
- data/ext/eigen/eigen3/Eigen/src/plugins/ArrayCwiseBinaryOps.h +253 -0
- data/ext/eigen/eigen3/Eigen/src/plugins/ArrayCwiseUnaryOps.h +187 -0
- data/ext/eigen/eigen3/Eigen/src/plugins/BlockMethods.h +935 -0
- data/ext/eigen/eigen3/Eigen/src/plugins/CommonCwiseBinaryOps.h +46 -0
- data/ext/eigen/eigen3/Eigen/src/plugins/CommonCwiseUnaryOps.h +172 -0
- data/ext/eigen/eigen3/Eigen/src/plugins/MatrixCwiseBinaryOps.h +143 -0
- data/ext/eigen/eigen3/Eigen/src/plugins/MatrixCwiseUnaryOps.h +52 -0
- data/ext/eigen/eigen3/signature_of_eigen3_matrix_library +1 -0
- data/ext/eigen/eigen_wrap.cxx +19420 -10396
- data/ext/eigen/extconf.rb +37 -2
- data/lib/eigen.rb +146 -3
- metadata +294 -7
@@ -0,0 +1,85 @@
|
|
1
|
+
/*
|
2
|
+
Copyright (c) 2011, Intel Corporation. All rights reserved.
|
3
|
+
|
4
|
+
Redistribution and use in source and binary forms, with or without modification,
|
5
|
+
are permitted provided that the following conditions are met:
|
6
|
+
|
7
|
+
* Redistributions of source code must retain the above copyright notice, this
|
8
|
+
list of conditions and the following disclaimer.
|
9
|
+
* Redistributions in binary form must reproduce the above copyright notice,
|
10
|
+
this list of conditions and the following disclaimer in the documentation
|
11
|
+
and/or other materials provided with the distribution.
|
12
|
+
* Neither the name of Intel Corporation nor the names of its contributors may
|
13
|
+
be used to endorse or promote products derived from this software without
|
14
|
+
specific prior written permission.
|
15
|
+
|
16
|
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
17
|
+
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
18
|
+
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
19
|
+
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
|
20
|
+
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
21
|
+
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
22
|
+
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
23
|
+
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
24
|
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
25
|
+
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
26
|
+
|
27
|
+
********************************************************************************
|
28
|
+
* Content : Eigen bindings to Intel(R) MKL
|
29
|
+
* LU decomposition with partial pivoting based on LAPACKE_?getrf function.
|
30
|
+
********************************************************************************
|
31
|
+
*/
|
32
|
+
|
33
|
+
#ifndef EIGEN_PARTIALLU_LAPACK_H
|
34
|
+
#define EIGEN_PARTIALLU_LAPACK_H
|
35
|
+
|
36
|
+
#include "Eigen/src/Core/util/MKL_support.h"
|
37
|
+
|
38
|
+
namespace Eigen {
|
39
|
+
|
40
|
+
namespace internal {
|
41
|
+
|
42
|
+
/** \internal Specialization for the data types supported by MKL */
|
43
|
+
|
44
|
+
#define EIGEN_MKL_LU_PARTPIV(EIGTYPE, MKLTYPE, MKLPREFIX) \
|
45
|
+
template<int StorageOrder> \
|
46
|
+
struct partial_lu_impl<EIGTYPE, StorageOrder, lapack_int> \
|
47
|
+
{ \
|
48
|
+
/* \internal performs the LU decomposition in-place of the matrix represented */ \
|
49
|
+
static lapack_int blocked_lu(lapack_int rows, lapack_int cols, EIGTYPE* lu_data, lapack_int luStride, lapack_int* row_transpositions, lapack_int& nb_transpositions, lapack_int maxBlockSize=256) \
|
50
|
+
{ \
|
51
|
+
EIGEN_UNUSED_VARIABLE(maxBlockSize);\
|
52
|
+
lapack_int matrix_order, first_zero_pivot; \
|
53
|
+
lapack_int m, n, lda, *ipiv, info; \
|
54
|
+
EIGTYPE* a; \
|
55
|
+
/* Set up parameters for ?getrf */ \
|
56
|
+
matrix_order = StorageOrder==RowMajor ? LAPACK_ROW_MAJOR : LAPACK_COL_MAJOR; \
|
57
|
+
lda = luStride; \
|
58
|
+
a = lu_data; \
|
59
|
+
ipiv = row_transpositions; \
|
60
|
+
m = rows; \
|
61
|
+
n = cols; \
|
62
|
+
nb_transpositions = 0; \
|
63
|
+
\
|
64
|
+
info = LAPACKE_##MKLPREFIX##getrf( matrix_order, m, n, (MKLTYPE*)a, lda, ipiv ); \
|
65
|
+
\
|
66
|
+
for(int i=0;i<m;i++) { ipiv[i]--; if (ipiv[i]!=i) nb_transpositions++; } \
|
67
|
+
\
|
68
|
+
eigen_assert(info >= 0); \
|
69
|
+
/* something should be done with nb_transpositions */ \
|
70
|
+
\
|
71
|
+
first_zero_pivot = info; \
|
72
|
+
return first_zero_pivot; \
|
73
|
+
} \
|
74
|
+
};
|
75
|
+
|
76
|
+
EIGEN_MKL_LU_PARTPIV(double, double, d)
|
77
|
+
EIGEN_MKL_LU_PARTPIV(float, float, s)
|
78
|
+
EIGEN_MKL_LU_PARTPIV(dcomplex, MKL_Complex16, z)
|
79
|
+
EIGEN_MKL_LU_PARTPIV(scomplex, MKL_Complex8, c)
|
80
|
+
|
81
|
+
} // end namespace internal
|
82
|
+
|
83
|
+
} // end namespace Eigen
|
84
|
+
|
85
|
+
#endif // EIGEN_PARTIALLU_LAPACK_H
|
@@ -0,0 +1,329 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2001 Intel Corporation
|
5
|
+
// Copyright (C) 2010 Gael Guennebaud <gael.guennebaud@inria.fr>
|
6
|
+
// Copyright (C) 2009 Benoit Jacob <jacob.benoit.1@gmail.com>
|
7
|
+
//
|
8
|
+
// This Source Code Form is subject to the terms of the Mozilla
|
9
|
+
// Public License v. 2.0. If a copy of the MPL was not distributed
|
10
|
+
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
11
|
+
|
12
|
+
// The SSE code for the 4x4 float and double matrix inverse in this file
|
13
|
+
// comes from the following Intel's library:
|
14
|
+
// http://software.intel.com/en-us/articles/optimized-matrix-library-for-use-with-the-intel-pentiumr-4-processors-sse2-instructions/
|
15
|
+
//
|
16
|
+
// Here is the respective copyright and license statement:
|
17
|
+
//
|
18
|
+
// Copyright (c) 2001 Intel Corporation.
|
19
|
+
//
|
20
|
+
// Permition is granted to use, copy, distribute and prepare derivative works
|
21
|
+
// of this library for any purpose and without fee, provided, that the above
|
22
|
+
// copyright notice and this statement appear in all copies.
|
23
|
+
// Intel makes no representations about the suitability of this software for
|
24
|
+
// any purpose, and specifically disclaims all warranties.
|
25
|
+
// See LEGAL.TXT for all the legal information.
|
26
|
+
|
27
|
+
#ifndef EIGEN_INVERSE_SSE_H
|
28
|
+
#define EIGEN_INVERSE_SSE_H
|
29
|
+
|
30
|
+
namespace Eigen {
|
31
|
+
|
32
|
+
namespace internal {
|
33
|
+
|
34
|
+
template<typename MatrixType, typename ResultType>
|
35
|
+
struct compute_inverse_size4<Architecture::SSE, float, MatrixType, ResultType>
|
36
|
+
{
|
37
|
+
enum {
|
38
|
+
MatrixAlignment = bool(MatrixType::Flags&AlignedBit),
|
39
|
+
ResultAlignment = bool(ResultType::Flags&AlignedBit),
|
40
|
+
StorageOrdersMatch = (MatrixType::Flags&RowMajorBit) == (ResultType::Flags&RowMajorBit)
|
41
|
+
};
|
42
|
+
|
43
|
+
static void run(const MatrixType& matrix, ResultType& result)
|
44
|
+
{
|
45
|
+
EIGEN_ALIGN16 const unsigned int _Sign_PNNP[4] = { 0x00000000, 0x80000000, 0x80000000, 0x00000000 };
|
46
|
+
|
47
|
+
// Load the full matrix into registers
|
48
|
+
__m128 _L1 = matrix.template packet<MatrixAlignment>( 0);
|
49
|
+
__m128 _L2 = matrix.template packet<MatrixAlignment>( 4);
|
50
|
+
__m128 _L3 = matrix.template packet<MatrixAlignment>( 8);
|
51
|
+
__m128 _L4 = matrix.template packet<MatrixAlignment>(12);
|
52
|
+
|
53
|
+
// The inverse is calculated using "Divide and Conquer" technique. The
|
54
|
+
// original matrix is divide into four 2x2 sub-matrices. Since each
|
55
|
+
// register holds four matrix element, the smaller matrices are
|
56
|
+
// represented as a registers. Hence we get a better locality of the
|
57
|
+
// calculations.
|
58
|
+
|
59
|
+
__m128 A, B, C, D; // the four sub-matrices
|
60
|
+
if(!StorageOrdersMatch)
|
61
|
+
{
|
62
|
+
A = _mm_unpacklo_ps(_L1, _L2);
|
63
|
+
B = _mm_unpacklo_ps(_L3, _L4);
|
64
|
+
C = _mm_unpackhi_ps(_L1, _L2);
|
65
|
+
D = _mm_unpackhi_ps(_L3, _L4);
|
66
|
+
}
|
67
|
+
else
|
68
|
+
{
|
69
|
+
A = _mm_movelh_ps(_L1, _L2);
|
70
|
+
B = _mm_movehl_ps(_L2, _L1);
|
71
|
+
C = _mm_movelh_ps(_L3, _L4);
|
72
|
+
D = _mm_movehl_ps(_L4, _L3);
|
73
|
+
}
|
74
|
+
|
75
|
+
__m128 iA, iB, iC, iD, // partial inverse of the sub-matrices
|
76
|
+
DC, AB;
|
77
|
+
__m128 dA, dB, dC, dD; // determinant of the sub-matrices
|
78
|
+
__m128 det, d, d1, d2;
|
79
|
+
__m128 rd; // reciprocal of the determinant
|
80
|
+
|
81
|
+
// AB = A# * B
|
82
|
+
AB = _mm_mul_ps(_mm_shuffle_ps(A,A,0x0F), B);
|
83
|
+
AB = _mm_sub_ps(AB,_mm_mul_ps(_mm_shuffle_ps(A,A,0xA5), _mm_shuffle_ps(B,B,0x4E)));
|
84
|
+
// DC = D# * C
|
85
|
+
DC = _mm_mul_ps(_mm_shuffle_ps(D,D,0x0F), C);
|
86
|
+
DC = _mm_sub_ps(DC,_mm_mul_ps(_mm_shuffle_ps(D,D,0xA5), _mm_shuffle_ps(C,C,0x4E)));
|
87
|
+
|
88
|
+
// dA = |A|
|
89
|
+
dA = _mm_mul_ps(_mm_shuffle_ps(A, A, 0x5F),A);
|
90
|
+
dA = _mm_sub_ss(dA, _mm_movehl_ps(dA,dA));
|
91
|
+
// dB = |B|
|
92
|
+
dB = _mm_mul_ps(_mm_shuffle_ps(B, B, 0x5F),B);
|
93
|
+
dB = _mm_sub_ss(dB, _mm_movehl_ps(dB,dB));
|
94
|
+
|
95
|
+
// dC = |C|
|
96
|
+
dC = _mm_mul_ps(_mm_shuffle_ps(C, C, 0x5F),C);
|
97
|
+
dC = _mm_sub_ss(dC, _mm_movehl_ps(dC,dC));
|
98
|
+
// dD = |D|
|
99
|
+
dD = _mm_mul_ps(_mm_shuffle_ps(D, D, 0x5F),D);
|
100
|
+
dD = _mm_sub_ss(dD, _mm_movehl_ps(dD,dD));
|
101
|
+
|
102
|
+
// d = trace(AB*DC) = trace(A#*B*D#*C)
|
103
|
+
d = _mm_mul_ps(_mm_shuffle_ps(DC,DC,0xD8),AB);
|
104
|
+
|
105
|
+
// iD = C*A#*B
|
106
|
+
iD = _mm_mul_ps(_mm_shuffle_ps(C,C,0xA0), _mm_movelh_ps(AB,AB));
|
107
|
+
iD = _mm_add_ps(iD,_mm_mul_ps(_mm_shuffle_ps(C,C,0xF5), _mm_movehl_ps(AB,AB)));
|
108
|
+
// iA = B*D#*C
|
109
|
+
iA = _mm_mul_ps(_mm_shuffle_ps(B,B,0xA0), _mm_movelh_ps(DC,DC));
|
110
|
+
iA = _mm_add_ps(iA,_mm_mul_ps(_mm_shuffle_ps(B,B,0xF5), _mm_movehl_ps(DC,DC)));
|
111
|
+
|
112
|
+
// d = trace(AB*DC) = trace(A#*B*D#*C) [continue]
|
113
|
+
d = _mm_add_ps(d, _mm_movehl_ps(d, d));
|
114
|
+
d = _mm_add_ss(d, _mm_shuffle_ps(d, d, 1));
|
115
|
+
d1 = _mm_mul_ss(dA,dD);
|
116
|
+
d2 = _mm_mul_ss(dB,dC);
|
117
|
+
|
118
|
+
// iD = D*|A| - C*A#*B
|
119
|
+
iD = _mm_sub_ps(_mm_mul_ps(D,_mm_shuffle_ps(dA,dA,0)), iD);
|
120
|
+
|
121
|
+
// iA = A*|D| - B*D#*C;
|
122
|
+
iA = _mm_sub_ps(_mm_mul_ps(A,_mm_shuffle_ps(dD,dD,0)), iA);
|
123
|
+
|
124
|
+
// det = |A|*|D| + |B|*|C| - trace(A#*B*D#*C)
|
125
|
+
det = _mm_sub_ss(_mm_add_ss(d1,d2),d);
|
126
|
+
rd = _mm_div_ss(_mm_set_ss(1.0f), det);
|
127
|
+
|
128
|
+
// #ifdef ZERO_SINGULAR
|
129
|
+
// rd = _mm_and_ps(_mm_cmpneq_ss(det,_mm_setzero_ps()), rd);
|
130
|
+
// #endif
|
131
|
+
|
132
|
+
// iB = D * (A#B)# = D*B#*A
|
133
|
+
iB = _mm_mul_ps(D, _mm_shuffle_ps(AB,AB,0x33));
|
134
|
+
iB = _mm_sub_ps(iB, _mm_mul_ps(_mm_shuffle_ps(D,D,0xB1), _mm_shuffle_ps(AB,AB,0x66)));
|
135
|
+
// iC = A * (D#C)# = A*C#*D
|
136
|
+
iC = _mm_mul_ps(A, _mm_shuffle_ps(DC,DC,0x33));
|
137
|
+
iC = _mm_sub_ps(iC, _mm_mul_ps(_mm_shuffle_ps(A,A,0xB1), _mm_shuffle_ps(DC,DC,0x66)));
|
138
|
+
|
139
|
+
rd = _mm_shuffle_ps(rd,rd,0);
|
140
|
+
rd = _mm_xor_ps(rd, _mm_load_ps((float*)_Sign_PNNP));
|
141
|
+
|
142
|
+
// iB = C*|B| - D*B#*A
|
143
|
+
iB = _mm_sub_ps(_mm_mul_ps(C,_mm_shuffle_ps(dB,dB,0)), iB);
|
144
|
+
|
145
|
+
// iC = B*|C| - A*C#*D;
|
146
|
+
iC = _mm_sub_ps(_mm_mul_ps(B,_mm_shuffle_ps(dC,dC,0)), iC);
|
147
|
+
|
148
|
+
// iX = iX / det
|
149
|
+
iA = _mm_mul_ps(rd,iA);
|
150
|
+
iB = _mm_mul_ps(rd,iB);
|
151
|
+
iC = _mm_mul_ps(rd,iC);
|
152
|
+
iD = _mm_mul_ps(rd,iD);
|
153
|
+
|
154
|
+
result.template writePacket<ResultAlignment>( 0, _mm_shuffle_ps(iA,iB,0x77));
|
155
|
+
result.template writePacket<ResultAlignment>( 4, _mm_shuffle_ps(iA,iB,0x22));
|
156
|
+
result.template writePacket<ResultAlignment>( 8, _mm_shuffle_ps(iC,iD,0x77));
|
157
|
+
result.template writePacket<ResultAlignment>(12, _mm_shuffle_ps(iC,iD,0x22));
|
158
|
+
}
|
159
|
+
|
160
|
+
};
|
161
|
+
|
162
|
+
template<typename MatrixType, typename ResultType>
|
163
|
+
struct compute_inverse_size4<Architecture::SSE, double, MatrixType, ResultType>
|
164
|
+
{
|
165
|
+
enum {
|
166
|
+
MatrixAlignment = bool(MatrixType::Flags&AlignedBit),
|
167
|
+
ResultAlignment = bool(ResultType::Flags&AlignedBit),
|
168
|
+
StorageOrdersMatch = (MatrixType::Flags&RowMajorBit) == (ResultType::Flags&RowMajorBit)
|
169
|
+
};
|
170
|
+
static void run(const MatrixType& matrix, ResultType& result)
|
171
|
+
{
|
172
|
+
const __m128d _Sign_NP = _mm_castsi128_pd(_mm_set_epi32(0x0,0x0,0x80000000,0x0));
|
173
|
+
const __m128d _Sign_PN = _mm_castsi128_pd(_mm_set_epi32(0x80000000,0x0,0x0,0x0));
|
174
|
+
|
175
|
+
// The inverse is calculated using "Divide and Conquer" technique. The
|
176
|
+
// original matrix is divide into four 2x2 sub-matrices. Since each
|
177
|
+
// register of the matrix holds two element, the smaller matrices are
|
178
|
+
// consisted of two registers. Hence we get a better locality of the
|
179
|
+
// calculations.
|
180
|
+
|
181
|
+
// the four sub-matrices
|
182
|
+
__m128d A1, A2, B1, B2, C1, C2, D1, D2;
|
183
|
+
|
184
|
+
if(StorageOrdersMatch)
|
185
|
+
{
|
186
|
+
A1 = matrix.template packet<MatrixAlignment>( 0); B1 = matrix.template packet<MatrixAlignment>( 2);
|
187
|
+
A2 = matrix.template packet<MatrixAlignment>( 4); B2 = matrix.template packet<MatrixAlignment>( 6);
|
188
|
+
C1 = matrix.template packet<MatrixAlignment>( 8); D1 = matrix.template packet<MatrixAlignment>(10);
|
189
|
+
C2 = matrix.template packet<MatrixAlignment>(12); D2 = matrix.template packet<MatrixAlignment>(14);
|
190
|
+
}
|
191
|
+
else
|
192
|
+
{
|
193
|
+
__m128d tmp;
|
194
|
+
A1 = matrix.template packet<MatrixAlignment>( 0); C1 = matrix.template packet<MatrixAlignment>( 2);
|
195
|
+
A2 = matrix.template packet<MatrixAlignment>( 4); C2 = matrix.template packet<MatrixAlignment>( 6);
|
196
|
+
tmp = A1;
|
197
|
+
A1 = _mm_unpacklo_pd(A1,A2);
|
198
|
+
A2 = _mm_unpackhi_pd(tmp,A2);
|
199
|
+
tmp = C1;
|
200
|
+
C1 = _mm_unpacklo_pd(C1,C2);
|
201
|
+
C2 = _mm_unpackhi_pd(tmp,C2);
|
202
|
+
|
203
|
+
B1 = matrix.template packet<MatrixAlignment>( 8); D1 = matrix.template packet<MatrixAlignment>(10);
|
204
|
+
B2 = matrix.template packet<MatrixAlignment>(12); D2 = matrix.template packet<MatrixAlignment>(14);
|
205
|
+
tmp = B1;
|
206
|
+
B1 = _mm_unpacklo_pd(B1,B2);
|
207
|
+
B2 = _mm_unpackhi_pd(tmp,B2);
|
208
|
+
tmp = D1;
|
209
|
+
D1 = _mm_unpacklo_pd(D1,D2);
|
210
|
+
D2 = _mm_unpackhi_pd(tmp,D2);
|
211
|
+
}
|
212
|
+
|
213
|
+
__m128d iA1, iA2, iB1, iB2, iC1, iC2, iD1, iD2, // partial invese of the sub-matrices
|
214
|
+
DC1, DC2, AB1, AB2;
|
215
|
+
__m128d dA, dB, dC, dD; // determinant of the sub-matrices
|
216
|
+
__m128d det, d1, d2, rd;
|
217
|
+
|
218
|
+
// dA = |A|
|
219
|
+
dA = _mm_shuffle_pd(A2, A2, 1);
|
220
|
+
dA = _mm_mul_pd(A1, dA);
|
221
|
+
dA = _mm_sub_sd(dA, _mm_shuffle_pd(dA,dA,3));
|
222
|
+
// dB = |B|
|
223
|
+
dB = _mm_shuffle_pd(B2, B2, 1);
|
224
|
+
dB = _mm_mul_pd(B1, dB);
|
225
|
+
dB = _mm_sub_sd(dB, _mm_shuffle_pd(dB,dB,3));
|
226
|
+
|
227
|
+
// AB = A# * B
|
228
|
+
AB1 = _mm_mul_pd(B1, _mm_shuffle_pd(A2,A2,3));
|
229
|
+
AB2 = _mm_mul_pd(B2, _mm_shuffle_pd(A1,A1,0));
|
230
|
+
AB1 = _mm_sub_pd(AB1, _mm_mul_pd(B2, _mm_shuffle_pd(A1,A1,3)));
|
231
|
+
AB2 = _mm_sub_pd(AB2, _mm_mul_pd(B1, _mm_shuffle_pd(A2,A2,0)));
|
232
|
+
|
233
|
+
// dC = |C|
|
234
|
+
dC = _mm_shuffle_pd(C2, C2, 1);
|
235
|
+
dC = _mm_mul_pd(C1, dC);
|
236
|
+
dC = _mm_sub_sd(dC, _mm_shuffle_pd(dC,dC,3));
|
237
|
+
// dD = |D|
|
238
|
+
dD = _mm_shuffle_pd(D2, D2, 1);
|
239
|
+
dD = _mm_mul_pd(D1, dD);
|
240
|
+
dD = _mm_sub_sd(dD, _mm_shuffle_pd(dD,dD,3));
|
241
|
+
|
242
|
+
// DC = D# * C
|
243
|
+
DC1 = _mm_mul_pd(C1, _mm_shuffle_pd(D2,D2,3));
|
244
|
+
DC2 = _mm_mul_pd(C2, _mm_shuffle_pd(D1,D1,0));
|
245
|
+
DC1 = _mm_sub_pd(DC1, _mm_mul_pd(C2, _mm_shuffle_pd(D1,D1,3)));
|
246
|
+
DC2 = _mm_sub_pd(DC2, _mm_mul_pd(C1, _mm_shuffle_pd(D2,D2,0)));
|
247
|
+
|
248
|
+
// rd = trace(AB*DC) = trace(A#*B*D#*C)
|
249
|
+
d1 = _mm_mul_pd(AB1, _mm_shuffle_pd(DC1, DC2, 0));
|
250
|
+
d2 = _mm_mul_pd(AB2, _mm_shuffle_pd(DC1, DC2, 3));
|
251
|
+
rd = _mm_add_pd(d1, d2);
|
252
|
+
rd = _mm_add_sd(rd, _mm_shuffle_pd(rd, rd,3));
|
253
|
+
|
254
|
+
// iD = C*A#*B
|
255
|
+
iD1 = _mm_mul_pd(AB1, _mm_shuffle_pd(C1,C1,0));
|
256
|
+
iD2 = _mm_mul_pd(AB1, _mm_shuffle_pd(C2,C2,0));
|
257
|
+
iD1 = _mm_add_pd(iD1, _mm_mul_pd(AB2, _mm_shuffle_pd(C1,C1,3)));
|
258
|
+
iD2 = _mm_add_pd(iD2, _mm_mul_pd(AB2, _mm_shuffle_pd(C2,C2,3)));
|
259
|
+
|
260
|
+
// iA = B*D#*C
|
261
|
+
iA1 = _mm_mul_pd(DC1, _mm_shuffle_pd(B1,B1,0));
|
262
|
+
iA2 = _mm_mul_pd(DC1, _mm_shuffle_pd(B2,B2,0));
|
263
|
+
iA1 = _mm_add_pd(iA1, _mm_mul_pd(DC2, _mm_shuffle_pd(B1,B1,3)));
|
264
|
+
iA2 = _mm_add_pd(iA2, _mm_mul_pd(DC2, _mm_shuffle_pd(B2,B2,3)));
|
265
|
+
|
266
|
+
// iD = D*|A| - C*A#*B
|
267
|
+
dA = _mm_shuffle_pd(dA,dA,0);
|
268
|
+
iD1 = _mm_sub_pd(_mm_mul_pd(D1, dA), iD1);
|
269
|
+
iD2 = _mm_sub_pd(_mm_mul_pd(D2, dA), iD2);
|
270
|
+
|
271
|
+
// iA = A*|D| - B*D#*C;
|
272
|
+
dD = _mm_shuffle_pd(dD,dD,0);
|
273
|
+
iA1 = _mm_sub_pd(_mm_mul_pd(A1, dD), iA1);
|
274
|
+
iA2 = _mm_sub_pd(_mm_mul_pd(A2, dD), iA2);
|
275
|
+
|
276
|
+
d1 = _mm_mul_sd(dA, dD);
|
277
|
+
d2 = _mm_mul_sd(dB, dC);
|
278
|
+
|
279
|
+
// iB = D * (A#B)# = D*B#*A
|
280
|
+
iB1 = _mm_mul_pd(D1, _mm_shuffle_pd(AB2,AB1,1));
|
281
|
+
iB2 = _mm_mul_pd(D2, _mm_shuffle_pd(AB2,AB1,1));
|
282
|
+
iB1 = _mm_sub_pd(iB1, _mm_mul_pd(_mm_shuffle_pd(D1,D1,1), _mm_shuffle_pd(AB2,AB1,2)));
|
283
|
+
iB2 = _mm_sub_pd(iB2, _mm_mul_pd(_mm_shuffle_pd(D2,D2,1), _mm_shuffle_pd(AB2,AB1,2)));
|
284
|
+
|
285
|
+
// det = |A|*|D| + |B|*|C| - trace(A#*B*D#*C)
|
286
|
+
det = _mm_add_sd(d1, d2);
|
287
|
+
det = _mm_sub_sd(det, rd);
|
288
|
+
|
289
|
+
// iC = A * (D#C)# = A*C#*D
|
290
|
+
iC1 = _mm_mul_pd(A1, _mm_shuffle_pd(DC2,DC1,1));
|
291
|
+
iC2 = _mm_mul_pd(A2, _mm_shuffle_pd(DC2,DC1,1));
|
292
|
+
iC1 = _mm_sub_pd(iC1, _mm_mul_pd(_mm_shuffle_pd(A1,A1,1), _mm_shuffle_pd(DC2,DC1,2)));
|
293
|
+
iC2 = _mm_sub_pd(iC2, _mm_mul_pd(_mm_shuffle_pd(A2,A2,1), _mm_shuffle_pd(DC2,DC1,2)));
|
294
|
+
|
295
|
+
rd = _mm_div_sd(_mm_set_sd(1.0), det);
|
296
|
+
// #ifdef ZERO_SINGULAR
|
297
|
+
// rd = _mm_and_pd(_mm_cmpneq_sd(det,_mm_setzero_pd()), rd);
|
298
|
+
// #endif
|
299
|
+
rd = _mm_shuffle_pd(rd,rd,0);
|
300
|
+
|
301
|
+
// iB = C*|B| - D*B#*A
|
302
|
+
dB = _mm_shuffle_pd(dB,dB,0);
|
303
|
+
iB1 = _mm_sub_pd(_mm_mul_pd(C1, dB), iB1);
|
304
|
+
iB2 = _mm_sub_pd(_mm_mul_pd(C2, dB), iB2);
|
305
|
+
|
306
|
+
d1 = _mm_xor_pd(rd, _Sign_PN);
|
307
|
+
d2 = _mm_xor_pd(rd, _Sign_NP);
|
308
|
+
|
309
|
+
// iC = B*|C| - A*C#*D;
|
310
|
+
dC = _mm_shuffle_pd(dC,dC,0);
|
311
|
+
iC1 = _mm_sub_pd(_mm_mul_pd(B1, dC), iC1);
|
312
|
+
iC2 = _mm_sub_pd(_mm_mul_pd(B2, dC), iC2);
|
313
|
+
|
314
|
+
result.template writePacket<ResultAlignment>( 0, _mm_mul_pd(_mm_shuffle_pd(iA2, iA1, 3), d1)); // iA# / det
|
315
|
+
result.template writePacket<ResultAlignment>( 4, _mm_mul_pd(_mm_shuffle_pd(iA2, iA1, 0), d2));
|
316
|
+
result.template writePacket<ResultAlignment>( 2, _mm_mul_pd(_mm_shuffle_pd(iB2, iB1, 3), d1)); // iB# / det
|
317
|
+
result.template writePacket<ResultAlignment>( 6, _mm_mul_pd(_mm_shuffle_pd(iB2, iB1, 0), d2));
|
318
|
+
result.template writePacket<ResultAlignment>( 8, _mm_mul_pd(_mm_shuffle_pd(iC2, iC1, 3), d1)); // iC# / det
|
319
|
+
result.template writePacket<ResultAlignment>(12, _mm_mul_pd(_mm_shuffle_pd(iC2, iC1, 0), d2));
|
320
|
+
result.template writePacket<ResultAlignment>(10, _mm_mul_pd(_mm_shuffle_pd(iD2, iD1, 3), d1)); // iD# / det
|
321
|
+
result.template writePacket<ResultAlignment>(14, _mm_mul_pd(_mm_shuffle_pd(iD2, iD1, 0), d2));
|
322
|
+
}
|
323
|
+
};
|
324
|
+
|
325
|
+
} // end namespace internal
|
326
|
+
|
327
|
+
} // end namespace Eigen
|
328
|
+
|
329
|
+
#endif // EIGEN_INVERSE_SSE_H
|
@@ -0,0 +1,137 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2012 Désiré Nuentsa-Wakam <desire.nuentsa_wakam@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
|
+
#ifndef METIS_SUPPORT_H
|
10
|
+
#define METIS_SUPPORT_H
|
11
|
+
|
12
|
+
namespace Eigen {
|
13
|
+
/**
|
14
|
+
* Get the fill-reducing ordering from the METIS package
|
15
|
+
*
|
16
|
+
* If A is the original matrix and Ap is the permuted matrix,
|
17
|
+
* the fill-reducing permutation is defined as follows :
|
18
|
+
* Row (column) i of A is the matperm(i) row (column) of Ap.
|
19
|
+
* WARNING: As computed by METIS, this corresponds to the vector iperm (instead of perm)
|
20
|
+
*/
|
21
|
+
template <typename Index>
|
22
|
+
class MetisOrdering
|
23
|
+
{
|
24
|
+
public:
|
25
|
+
typedef PermutationMatrix<Dynamic,Dynamic,Index> PermutationType;
|
26
|
+
typedef Matrix<Index,Dynamic,1> IndexVector;
|
27
|
+
|
28
|
+
template <typename MatrixType>
|
29
|
+
void get_symmetrized_graph(const MatrixType& A)
|
30
|
+
{
|
31
|
+
Index m = A.cols();
|
32
|
+
eigen_assert((A.rows() == A.cols()) && "ONLY FOR SQUARED MATRICES");
|
33
|
+
// Get the transpose of the input matrix
|
34
|
+
MatrixType At = A.transpose();
|
35
|
+
// Get the number of nonzeros elements in each row/col of At+A
|
36
|
+
Index TotNz = 0;
|
37
|
+
IndexVector visited(m);
|
38
|
+
visited.setConstant(-1);
|
39
|
+
for (int j = 0; j < m; j++)
|
40
|
+
{
|
41
|
+
// Compute the union structure of of A(j,:) and At(j,:)
|
42
|
+
visited(j) = j; // Do not include the diagonal element
|
43
|
+
// Get the nonzeros in row/column j of A
|
44
|
+
for (typename MatrixType::InnerIterator it(A, j); it; ++it)
|
45
|
+
{
|
46
|
+
Index idx = it.index(); // Get the row index (for column major) or column index (for row major)
|
47
|
+
if (visited(idx) != j )
|
48
|
+
{
|
49
|
+
visited(idx) = j;
|
50
|
+
++TotNz;
|
51
|
+
}
|
52
|
+
}
|
53
|
+
//Get the nonzeros in row/column j of At
|
54
|
+
for (typename MatrixType::InnerIterator it(At, j); it; ++it)
|
55
|
+
{
|
56
|
+
Index idx = it.index();
|
57
|
+
if(visited(idx) != j)
|
58
|
+
{
|
59
|
+
visited(idx) = j;
|
60
|
+
++TotNz;
|
61
|
+
}
|
62
|
+
}
|
63
|
+
}
|
64
|
+
// Reserve place for A + At
|
65
|
+
m_indexPtr.resize(m+1);
|
66
|
+
m_innerIndices.resize(TotNz);
|
67
|
+
|
68
|
+
// Now compute the real adjacency list of each column/row
|
69
|
+
visited.setConstant(-1);
|
70
|
+
Index CurNz = 0;
|
71
|
+
for (int j = 0; j < m; j++)
|
72
|
+
{
|
73
|
+
m_indexPtr(j) = CurNz;
|
74
|
+
|
75
|
+
visited(j) = j; // Do not include the diagonal element
|
76
|
+
// Add the pattern of row/column j of A to A+At
|
77
|
+
for (typename MatrixType::InnerIterator it(A,j); it; ++it)
|
78
|
+
{
|
79
|
+
Index idx = it.index(); // Get the row index (for column major) or column index (for row major)
|
80
|
+
if (visited(idx) != j )
|
81
|
+
{
|
82
|
+
visited(idx) = j;
|
83
|
+
m_innerIndices(CurNz) = idx;
|
84
|
+
CurNz++;
|
85
|
+
}
|
86
|
+
}
|
87
|
+
//Add the pattern of row/column j of At to A+At
|
88
|
+
for (typename MatrixType::InnerIterator it(At, j); it; ++it)
|
89
|
+
{
|
90
|
+
Index idx = it.index();
|
91
|
+
if(visited(idx) != j)
|
92
|
+
{
|
93
|
+
visited(idx) = j;
|
94
|
+
m_innerIndices(CurNz) = idx;
|
95
|
+
++CurNz;
|
96
|
+
}
|
97
|
+
}
|
98
|
+
}
|
99
|
+
m_indexPtr(m) = CurNz;
|
100
|
+
}
|
101
|
+
|
102
|
+
template <typename MatrixType>
|
103
|
+
void operator() (const MatrixType& A, PermutationType& matperm)
|
104
|
+
{
|
105
|
+
Index m = A.cols();
|
106
|
+
IndexVector perm(m),iperm(m);
|
107
|
+
// First, symmetrize the matrix graph.
|
108
|
+
get_symmetrized_graph(A);
|
109
|
+
int output_error;
|
110
|
+
|
111
|
+
// Call the fill-reducing routine from METIS
|
112
|
+
output_error = METIS_NodeND(&m, m_indexPtr.data(), m_innerIndices.data(), NULL, NULL, perm.data(), iperm.data());
|
113
|
+
|
114
|
+
if(output_error != METIS_OK)
|
115
|
+
{
|
116
|
+
//FIXME The ordering interface should define a class of possible errors
|
117
|
+
std::cerr << "ERROR WHILE CALLING THE METIS PACKAGE \n";
|
118
|
+
return;
|
119
|
+
}
|
120
|
+
|
121
|
+
// Get the fill-reducing permutation
|
122
|
+
//NOTE: If Ap is the permuted matrix then perm and iperm vectors are defined as follows
|
123
|
+
// Row (column) i of Ap is the perm(i) row(column) of A, and row (column) i of A is the iperm(i) row(column) of Ap
|
124
|
+
|
125
|
+
matperm.resize(m);
|
126
|
+
for (int j = 0; j < m; j++)
|
127
|
+
matperm.indices()(iperm(j)) = j;
|
128
|
+
|
129
|
+
}
|
130
|
+
|
131
|
+
protected:
|
132
|
+
IndexVector m_indexPtr; // Pointer to the adjacenccy list of each row/column
|
133
|
+
IndexVector m_innerIndices; // Adjacency list
|
134
|
+
};
|
135
|
+
|
136
|
+
}// end namespace eigen
|
137
|
+
#endif
|