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,279 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2012 Gael Guennebaud <gael.guennebaud@inria.fr>
|
5
|
+
//
|
6
|
+
// This Source Code Form is subject to the terms of the Mozilla
|
7
|
+
// Public License v. 2.0. If a copy of the MPL was not distributed
|
8
|
+
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
9
|
+
|
10
|
+
#ifndef EIGEN_SPARSELU_GEMM_KERNEL_H
|
11
|
+
#define EIGEN_SPARSELU_GEMM_KERNEL_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
namespace internal {
|
16
|
+
|
17
|
+
|
18
|
+
/** \internal
|
19
|
+
* A general matrix-matrix product kernel optimized for the SparseLU factorization.
|
20
|
+
* - A, B, and C must be column major
|
21
|
+
* - lda and ldc must be multiples of the respective packet size
|
22
|
+
* - C must have the same alignment as A
|
23
|
+
*/
|
24
|
+
template<typename Scalar,typename Index>
|
25
|
+
EIGEN_DONT_INLINE
|
26
|
+
void sparselu_gemm(Index m, Index n, Index d, const Scalar* A, Index lda, const Scalar* B, Index ldb, Scalar* C, Index ldc)
|
27
|
+
{
|
28
|
+
using namespace Eigen::internal;
|
29
|
+
|
30
|
+
typedef typename packet_traits<Scalar>::type Packet;
|
31
|
+
enum {
|
32
|
+
NumberOfRegisters = EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS,
|
33
|
+
PacketSize = packet_traits<Scalar>::size,
|
34
|
+
PM = 8, // peeling in M
|
35
|
+
RN = 2, // register blocking
|
36
|
+
RK = NumberOfRegisters>=16 ? 4 : 2, // register blocking
|
37
|
+
BM = 4096/sizeof(Scalar), // number of rows of A-C per chunk
|
38
|
+
SM = PM*PacketSize // step along M
|
39
|
+
};
|
40
|
+
Index d_end = (d/RK)*RK; // number of columns of A (rows of B) suitable for full register blocking
|
41
|
+
Index n_end = (n/RN)*RN; // number of columns of B-C suitable for processing RN columns at once
|
42
|
+
Index i0 = internal::first_aligned(A,m);
|
43
|
+
|
44
|
+
eigen_internal_assert(((lda%PacketSize)==0) && ((ldc%PacketSize)==0) && (i0==internal::first_aligned(C,m)));
|
45
|
+
|
46
|
+
// handle the non aligned rows of A and C without any optimization:
|
47
|
+
for(Index i=0; i<i0; ++i)
|
48
|
+
{
|
49
|
+
for(Index j=0; j<n; ++j)
|
50
|
+
{
|
51
|
+
Scalar c = C[i+j*ldc];
|
52
|
+
for(Index k=0; k<d; ++k)
|
53
|
+
c += B[k+j*ldb] * A[i+k*lda];
|
54
|
+
C[i+j*ldc] = c;
|
55
|
+
}
|
56
|
+
}
|
57
|
+
// process the remaining rows per chunk of BM rows
|
58
|
+
for(Index ib=i0; ib<m; ib+=BM)
|
59
|
+
{
|
60
|
+
Index actual_b = std::min<Index>(BM, m-ib); // actual number of rows
|
61
|
+
Index actual_b_end1 = (actual_b/SM)*SM; // actual number of rows suitable for peeling
|
62
|
+
Index actual_b_end2 = (actual_b/PacketSize)*PacketSize; // actual number of rows suitable for vectorization
|
63
|
+
|
64
|
+
// Let's process two columns of B-C at once
|
65
|
+
for(Index j=0; j<n_end; j+=RN)
|
66
|
+
{
|
67
|
+
const Scalar* Bc0 = B+(j+0)*ldb;
|
68
|
+
const Scalar* Bc1 = B+(j+1)*ldb;
|
69
|
+
|
70
|
+
for(Index k=0; k<d_end; k+=RK)
|
71
|
+
{
|
72
|
+
|
73
|
+
// load and expand a RN x RK block of B
|
74
|
+
Packet b00, b10, b20, b30, b01, b11, b21, b31;
|
75
|
+
b00 = pset1<Packet>(Bc0[0]);
|
76
|
+
b10 = pset1<Packet>(Bc0[1]);
|
77
|
+
if(RK==4) b20 = pset1<Packet>(Bc0[2]);
|
78
|
+
if(RK==4) b30 = pset1<Packet>(Bc0[3]);
|
79
|
+
b01 = pset1<Packet>(Bc1[0]);
|
80
|
+
b11 = pset1<Packet>(Bc1[1]);
|
81
|
+
if(RK==4) b21 = pset1<Packet>(Bc1[2]);
|
82
|
+
if(RK==4) b31 = pset1<Packet>(Bc1[3]);
|
83
|
+
|
84
|
+
Packet a0, a1, a2, a3, c0, c1, t0, t1;
|
85
|
+
|
86
|
+
const Scalar* A0 = A+ib+(k+0)*lda;
|
87
|
+
const Scalar* A1 = A+ib+(k+1)*lda;
|
88
|
+
const Scalar* A2 = A+ib+(k+2)*lda;
|
89
|
+
const Scalar* A3 = A+ib+(k+3)*lda;
|
90
|
+
|
91
|
+
Scalar* C0 = C+ib+(j+0)*ldc;
|
92
|
+
Scalar* C1 = C+ib+(j+1)*ldc;
|
93
|
+
|
94
|
+
a0 = pload<Packet>(A0);
|
95
|
+
a1 = pload<Packet>(A1);
|
96
|
+
if(RK==4)
|
97
|
+
{
|
98
|
+
a2 = pload<Packet>(A2);
|
99
|
+
a3 = pload<Packet>(A3);
|
100
|
+
}
|
101
|
+
else
|
102
|
+
{
|
103
|
+
// workaround "may be used uninitialized in this function" warning
|
104
|
+
a2 = a3 = a0;
|
105
|
+
}
|
106
|
+
|
107
|
+
#define KMADD(c, a, b, tmp) {tmp = b; tmp = pmul(a,tmp); c = padd(c,tmp);}
|
108
|
+
#define WORK(I) \
|
109
|
+
c0 = pload<Packet>(C0+i+(I)*PacketSize); \
|
110
|
+
c1 = pload<Packet>(C1+i+(I)*PacketSize); \
|
111
|
+
KMADD(c0, a0, b00, t0) \
|
112
|
+
KMADD(c1, a0, b01, t1) \
|
113
|
+
a0 = pload<Packet>(A0+i+(I+1)*PacketSize); \
|
114
|
+
KMADD(c0, a1, b10, t0) \
|
115
|
+
KMADD(c1, a1, b11, t1) \
|
116
|
+
a1 = pload<Packet>(A1+i+(I+1)*PacketSize); \
|
117
|
+
if(RK==4) KMADD(c0, a2, b20, t0) \
|
118
|
+
if(RK==4) KMADD(c1, a2, b21, t1) \
|
119
|
+
if(RK==4) a2 = pload<Packet>(A2+i+(I+1)*PacketSize); \
|
120
|
+
if(RK==4) KMADD(c0, a3, b30, t0) \
|
121
|
+
if(RK==4) KMADD(c1, a3, b31, t1) \
|
122
|
+
if(RK==4) a3 = pload<Packet>(A3+i+(I+1)*PacketSize); \
|
123
|
+
pstore(C0+i+(I)*PacketSize, c0); \
|
124
|
+
pstore(C1+i+(I)*PacketSize, c1)
|
125
|
+
|
126
|
+
// process rows of A' - C' with aggressive vectorization and peeling
|
127
|
+
for(Index i=0; i<actual_b_end1; i+=PacketSize*8)
|
128
|
+
{
|
129
|
+
EIGEN_ASM_COMMENT("SPARSELU_GEMML_KERNEL1");
|
130
|
+
prefetch((A0+i+(5)*PacketSize));
|
131
|
+
prefetch((A1+i+(5)*PacketSize));
|
132
|
+
if(RK==4) prefetch((A2+i+(5)*PacketSize));
|
133
|
+
if(RK==4) prefetch((A3+i+(5)*PacketSize));
|
134
|
+
WORK(0);
|
135
|
+
WORK(1);
|
136
|
+
WORK(2);
|
137
|
+
WORK(3);
|
138
|
+
WORK(4);
|
139
|
+
WORK(5);
|
140
|
+
WORK(6);
|
141
|
+
WORK(7);
|
142
|
+
}
|
143
|
+
// process the remaining rows with vectorization only
|
144
|
+
for(Index i=actual_b_end1; i<actual_b_end2; i+=PacketSize)
|
145
|
+
{
|
146
|
+
WORK(0);
|
147
|
+
}
|
148
|
+
#undef WORK
|
149
|
+
// process the remaining rows without vectorization
|
150
|
+
for(Index i=actual_b_end2; i<actual_b; ++i)
|
151
|
+
{
|
152
|
+
if(RK==4)
|
153
|
+
{
|
154
|
+
C0[i] += A0[i]*Bc0[0]+A1[i]*Bc0[1]+A2[i]*Bc0[2]+A3[i]*Bc0[3];
|
155
|
+
C1[i] += A0[i]*Bc1[0]+A1[i]*Bc1[1]+A2[i]*Bc1[2]+A3[i]*Bc1[3];
|
156
|
+
}
|
157
|
+
else
|
158
|
+
{
|
159
|
+
C0[i] += A0[i]*Bc0[0]+A1[i]*Bc0[1];
|
160
|
+
C1[i] += A0[i]*Bc1[0]+A1[i]*Bc1[1];
|
161
|
+
}
|
162
|
+
}
|
163
|
+
|
164
|
+
Bc0 += RK;
|
165
|
+
Bc1 += RK;
|
166
|
+
} // peeled loop on k
|
167
|
+
} // peeled loop on the columns j
|
168
|
+
// process the last column (we now perform a matrux-vector product)
|
169
|
+
if((n-n_end)>0)
|
170
|
+
{
|
171
|
+
const Scalar* Bc0 = B+(n-1)*ldb;
|
172
|
+
|
173
|
+
for(Index k=0; k<d_end; k+=RK)
|
174
|
+
{
|
175
|
+
|
176
|
+
// load and expand a 1 x RK block of B
|
177
|
+
Packet b00, b10, b20, b30;
|
178
|
+
b00 = pset1<Packet>(Bc0[0]);
|
179
|
+
b10 = pset1<Packet>(Bc0[1]);
|
180
|
+
if(RK==4) b20 = pset1<Packet>(Bc0[2]);
|
181
|
+
if(RK==4) b30 = pset1<Packet>(Bc0[3]);
|
182
|
+
|
183
|
+
Packet a0, a1, a2, a3, c0, t0/*, t1*/;
|
184
|
+
|
185
|
+
const Scalar* A0 = A+ib+(k+0)*lda;
|
186
|
+
const Scalar* A1 = A+ib+(k+1)*lda;
|
187
|
+
const Scalar* A2 = A+ib+(k+2)*lda;
|
188
|
+
const Scalar* A3 = A+ib+(k+3)*lda;
|
189
|
+
|
190
|
+
Scalar* C0 = C+ib+(n_end)*ldc;
|
191
|
+
|
192
|
+
a0 = pload<Packet>(A0);
|
193
|
+
a1 = pload<Packet>(A1);
|
194
|
+
if(RK==4)
|
195
|
+
{
|
196
|
+
a2 = pload<Packet>(A2);
|
197
|
+
a3 = pload<Packet>(A3);
|
198
|
+
}
|
199
|
+
else
|
200
|
+
{
|
201
|
+
// workaround "may be used uninitialized in this function" warning
|
202
|
+
a2 = a3 = a0;
|
203
|
+
}
|
204
|
+
|
205
|
+
#define WORK(I) \
|
206
|
+
c0 = pload<Packet>(C0+i+(I)*PacketSize); \
|
207
|
+
KMADD(c0, a0, b00, t0) \
|
208
|
+
a0 = pload<Packet>(A0+i+(I+1)*PacketSize); \
|
209
|
+
KMADD(c0, a1, b10, t0) \
|
210
|
+
a1 = pload<Packet>(A1+i+(I+1)*PacketSize); \
|
211
|
+
if(RK==4) KMADD(c0, a2, b20, t0) \
|
212
|
+
if(RK==4) a2 = pload<Packet>(A2+i+(I+1)*PacketSize); \
|
213
|
+
if(RK==4) KMADD(c0, a3, b30, t0) \
|
214
|
+
if(RK==4) a3 = pload<Packet>(A3+i+(I+1)*PacketSize); \
|
215
|
+
pstore(C0+i+(I)*PacketSize, c0);
|
216
|
+
|
217
|
+
// agressive vectorization and peeling
|
218
|
+
for(Index i=0; i<actual_b_end1; i+=PacketSize*8)
|
219
|
+
{
|
220
|
+
EIGEN_ASM_COMMENT("SPARSELU_GEMML_KERNEL2");
|
221
|
+
WORK(0);
|
222
|
+
WORK(1);
|
223
|
+
WORK(2);
|
224
|
+
WORK(3);
|
225
|
+
WORK(4);
|
226
|
+
WORK(5);
|
227
|
+
WORK(6);
|
228
|
+
WORK(7);
|
229
|
+
}
|
230
|
+
// vectorization only
|
231
|
+
for(Index i=actual_b_end1; i<actual_b_end2; i+=PacketSize)
|
232
|
+
{
|
233
|
+
WORK(0);
|
234
|
+
}
|
235
|
+
// remaining scalars
|
236
|
+
for(Index i=actual_b_end2; i<actual_b; ++i)
|
237
|
+
{
|
238
|
+
if(RK==4)
|
239
|
+
C0[i] += A0[i]*Bc0[0]+A1[i]*Bc0[1]+A2[i]*Bc0[2]+A3[i]*Bc0[3];
|
240
|
+
else
|
241
|
+
C0[i] += A0[i]*Bc0[0]+A1[i]*Bc0[1];
|
242
|
+
}
|
243
|
+
|
244
|
+
Bc0 += RK;
|
245
|
+
#undef WORK
|
246
|
+
}
|
247
|
+
}
|
248
|
+
|
249
|
+
// process the last columns of A, corresponding to the last rows of B
|
250
|
+
Index rd = d-d_end;
|
251
|
+
if(rd>0)
|
252
|
+
{
|
253
|
+
for(Index j=0; j<n; ++j)
|
254
|
+
{
|
255
|
+
enum {
|
256
|
+
Alignment = PacketSize>1 ? Aligned : 0
|
257
|
+
};
|
258
|
+
typedef Map<Matrix<Scalar,Dynamic,1>, Alignment > MapVector;
|
259
|
+
typedef Map<const Matrix<Scalar,Dynamic,1>, Alignment > ConstMapVector;
|
260
|
+
if(rd==1) MapVector(C+j*ldc+ib,actual_b) += B[0+d_end+j*ldb] * ConstMapVector(A+(d_end+0)*lda+ib, actual_b);
|
261
|
+
|
262
|
+
else if(rd==2) MapVector(C+j*ldc+ib,actual_b) += B[0+d_end+j*ldb] * ConstMapVector(A+(d_end+0)*lda+ib, actual_b)
|
263
|
+
+ B[1+d_end+j*ldb] * ConstMapVector(A+(d_end+1)*lda+ib, actual_b);
|
264
|
+
|
265
|
+
else MapVector(C+j*ldc+ib,actual_b) += B[0+d_end+j*ldb] * ConstMapVector(A+(d_end+0)*lda+ib, actual_b)
|
266
|
+
+ B[1+d_end+j*ldb] * ConstMapVector(A+(d_end+1)*lda+ib, actual_b)
|
267
|
+
+ B[2+d_end+j*ldb] * ConstMapVector(A+(d_end+2)*lda+ib, actual_b);
|
268
|
+
}
|
269
|
+
}
|
270
|
+
|
271
|
+
} // blocking on the rows of A and C
|
272
|
+
}
|
273
|
+
#undef KMADD
|
274
|
+
|
275
|
+
} // namespace internal
|
276
|
+
|
277
|
+
} // namespace Eigen
|
278
|
+
|
279
|
+
#endif // EIGEN_SPARSELU_GEMM_KERNEL_H
|
@@ -0,0 +1,127 @@
|
|
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
|
+
|
10
|
+
/* This file is a modified version of heap_relax_snode.c file in SuperLU
|
11
|
+
* -- SuperLU routine (version 3.0) --
|
12
|
+
* Univ. of California Berkeley, Xerox Palo Alto Research Center,
|
13
|
+
* and Lawrence Berkeley National Lab.
|
14
|
+
* October 15, 2003
|
15
|
+
*
|
16
|
+
* Copyright (c) 1994 by Xerox Corporation. All rights reserved.
|
17
|
+
*
|
18
|
+
* THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY
|
19
|
+
* EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK.
|
20
|
+
*
|
21
|
+
* Permission is hereby granted to use or copy this program for any
|
22
|
+
* purpose, provided the above notices are retained on all copies.
|
23
|
+
* Permission to modify the code and to distribute modified code is
|
24
|
+
* granted, provided the above notices are retained, and a notice that
|
25
|
+
* the code was modified is included with the above copyright notice.
|
26
|
+
*/
|
27
|
+
|
28
|
+
#ifndef SPARSELU_HEAP_RELAX_SNODE_H
|
29
|
+
#define SPARSELU_HEAP_RELAX_SNODE_H
|
30
|
+
|
31
|
+
namespace Eigen {
|
32
|
+
namespace internal {
|
33
|
+
|
34
|
+
/**
|
35
|
+
* \brief Identify the initial relaxed supernodes
|
36
|
+
*
|
37
|
+
* This routine applied to a symmetric elimination tree.
|
38
|
+
* It assumes that the matrix has been reordered according to the postorder of the etree
|
39
|
+
* \param n The number of columns
|
40
|
+
* \param et elimination tree
|
41
|
+
* \param relax_columns Maximum number of columns allowed in a relaxed snode
|
42
|
+
* \param descendants Number of descendants of each node in the etree
|
43
|
+
* \param relax_end last column in a supernode
|
44
|
+
*/
|
45
|
+
template <typename Scalar, typename Index>
|
46
|
+
void SparseLUImpl<Scalar,Index>::heap_relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& descendants, IndexVector& relax_end)
|
47
|
+
{
|
48
|
+
|
49
|
+
// The etree may not be postordered, but its heap ordered
|
50
|
+
IndexVector post;
|
51
|
+
internal::treePostorder(n, et, post); // Post order etree
|
52
|
+
IndexVector inv_post(n+1);
|
53
|
+
Index i;
|
54
|
+
for (i = 0; i < n+1; ++i) inv_post(post(i)) = i; // inv_post = post.inverse()???
|
55
|
+
|
56
|
+
// Renumber etree in postorder
|
57
|
+
IndexVector iwork(n);
|
58
|
+
IndexVector et_save(n+1);
|
59
|
+
for (i = 0; i < n; ++i)
|
60
|
+
{
|
61
|
+
iwork(post(i)) = post(et(i));
|
62
|
+
}
|
63
|
+
et_save = et; // Save the original etree
|
64
|
+
et = iwork;
|
65
|
+
|
66
|
+
// compute the number of descendants of each node in the etree
|
67
|
+
relax_end.setConstant(emptyIdxLU);
|
68
|
+
Index j, parent;
|
69
|
+
descendants.setZero();
|
70
|
+
for (j = 0; j < n; j++)
|
71
|
+
{
|
72
|
+
parent = et(j);
|
73
|
+
if (parent != n) // not the dummy root
|
74
|
+
descendants(parent) += descendants(j) + 1;
|
75
|
+
}
|
76
|
+
// Identify the relaxed supernodes by postorder traversal of the etree
|
77
|
+
Index snode_start; // beginning of a snode
|
78
|
+
Index k;
|
79
|
+
Index nsuper_et_post = 0; // Number of relaxed snodes in postordered etree
|
80
|
+
Index nsuper_et = 0; // Number of relaxed snodes in the original etree
|
81
|
+
Index l;
|
82
|
+
for (j = 0; j < n; )
|
83
|
+
{
|
84
|
+
parent = et(j);
|
85
|
+
snode_start = j;
|
86
|
+
while ( parent != n && descendants(parent) < relax_columns )
|
87
|
+
{
|
88
|
+
j = parent;
|
89
|
+
parent = et(j);
|
90
|
+
}
|
91
|
+
// Found a supernode in postordered etree, j is the last column
|
92
|
+
++nsuper_et_post;
|
93
|
+
k = n;
|
94
|
+
for (i = snode_start; i <= j; ++i)
|
95
|
+
k = (std::min)(k, inv_post(i));
|
96
|
+
l = inv_post(j);
|
97
|
+
if ( (l - k) == (j - snode_start) ) // Same number of columns in the snode
|
98
|
+
{
|
99
|
+
// This is also a supernode in the original etree
|
100
|
+
relax_end(k) = l; // Record last column
|
101
|
+
++nsuper_et;
|
102
|
+
}
|
103
|
+
else
|
104
|
+
{
|
105
|
+
for (i = snode_start; i <= j; ++i)
|
106
|
+
{
|
107
|
+
l = inv_post(i);
|
108
|
+
if (descendants(i) == 0)
|
109
|
+
{
|
110
|
+
relax_end(l) = l;
|
111
|
+
++nsuper_et;
|
112
|
+
}
|
113
|
+
}
|
114
|
+
}
|
115
|
+
j++;
|
116
|
+
// Search for a new leaf
|
117
|
+
while (descendants(j) != 0 && j < n) j++;
|
118
|
+
} // End postorder traversal of the etree
|
119
|
+
|
120
|
+
// Recover the original etree
|
121
|
+
et = et_save;
|
122
|
+
}
|
123
|
+
|
124
|
+
} // end namespace internal
|
125
|
+
|
126
|
+
} // end namespace Eigen
|
127
|
+
#endif // SPARSELU_HEAP_RELAX_SNODE_H
|
@@ -0,0 +1,130 @@
|
|
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
|
+
// Copyright (C) 2012 Gael Guennebaud <gael.guennebaud@inria.fr>
|
6
|
+
//
|
7
|
+
// This Source Code Form is subject to the terms of the Mozilla
|
8
|
+
// Public License v. 2.0. If a copy of the MPL was not distributed
|
9
|
+
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
10
|
+
|
11
|
+
#ifndef SPARSELU_KERNEL_BMOD_H
|
12
|
+
#define SPARSELU_KERNEL_BMOD_H
|
13
|
+
|
14
|
+
namespace Eigen {
|
15
|
+
namespace internal {
|
16
|
+
|
17
|
+
/**
|
18
|
+
* \brief Performs numeric block updates from a given supernode to a single column
|
19
|
+
*
|
20
|
+
* \param segsize Size of the segment (and blocks ) to use for updates
|
21
|
+
* \param[in,out] dense Packed values of the original matrix
|
22
|
+
* \param tempv temporary vector to use for updates
|
23
|
+
* \param lusup array containing the supernodes
|
24
|
+
* \param lda Leading dimension in the supernode
|
25
|
+
* \param nrow Number of rows in the rectangular part of the supernode
|
26
|
+
* \param lsub compressed row subscripts of supernodes
|
27
|
+
* \param lptr pointer to the first column of the current supernode in lsub
|
28
|
+
* \param no_zeros Number of nonzeros elements before the diagonal part of the supernode
|
29
|
+
* \return 0 on success
|
30
|
+
*/
|
31
|
+
template <int SegSizeAtCompileTime> struct LU_kernel_bmod
|
32
|
+
{
|
33
|
+
template <typename BlockScalarVector, typename ScalarVector, typename IndexVector, typename Index>
|
34
|
+
static EIGEN_DONT_INLINE void run(const int segsize, BlockScalarVector& dense, ScalarVector& tempv, ScalarVector& lusup, Index& luptr, const Index lda,
|
35
|
+
const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros);
|
36
|
+
};
|
37
|
+
|
38
|
+
template <int SegSizeAtCompileTime>
|
39
|
+
template <typename BlockScalarVector, typename ScalarVector, typename IndexVector, typename Index>
|
40
|
+
EIGEN_DONT_INLINE void LU_kernel_bmod<SegSizeAtCompileTime>::run(const int segsize, BlockScalarVector& dense, ScalarVector& tempv, ScalarVector& lusup, Index& luptr, const Index lda,
|
41
|
+
const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros)
|
42
|
+
{
|
43
|
+
typedef typename ScalarVector::Scalar Scalar;
|
44
|
+
// First, copy U[*,j] segment from dense(*) to tempv(*)
|
45
|
+
// The result of triangular solve is in tempv[*];
|
46
|
+
// The result of matric-vector update is in dense[*]
|
47
|
+
Index isub = lptr + no_zeros;
|
48
|
+
int i;
|
49
|
+
Index irow;
|
50
|
+
for (i = 0; i < ((SegSizeAtCompileTime==Dynamic)?segsize:SegSizeAtCompileTime); i++)
|
51
|
+
{
|
52
|
+
irow = lsub(isub);
|
53
|
+
tempv(i) = dense(irow);
|
54
|
+
++isub;
|
55
|
+
}
|
56
|
+
// Dense triangular solve -- start effective triangle
|
57
|
+
luptr += lda * no_zeros + no_zeros;
|
58
|
+
// Form Eigen matrix and vector
|
59
|
+
Map<Matrix<Scalar,SegSizeAtCompileTime,SegSizeAtCompileTime, ColMajor>, 0, OuterStride<> > A( &(lusup.data()[luptr]), segsize, segsize, OuterStride<>(lda) );
|
60
|
+
Map<Matrix<Scalar,SegSizeAtCompileTime,1> > u(tempv.data(), segsize);
|
61
|
+
|
62
|
+
u = A.template triangularView<UnitLower>().solve(u);
|
63
|
+
|
64
|
+
// Dense matrix-vector product y <-- B*x
|
65
|
+
luptr += segsize;
|
66
|
+
const Index PacketSize = internal::packet_traits<Scalar>::size;
|
67
|
+
Index ldl = internal::first_multiple(nrow, PacketSize);
|
68
|
+
Map<Matrix<Scalar,Dynamic,SegSizeAtCompileTime, ColMajor>, 0, OuterStride<> > B( &(lusup.data()[luptr]), nrow, segsize, OuterStride<>(lda) );
|
69
|
+
Index aligned_offset = internal::first_aligned(tempv.data()+segsize, PacketSize);
|
70
|
+
Index aligned_with_B_offset = (PacketSize-internal::first_aligned(B.data(), PacketSize))%PacketSize;
|
71
|
+
Map<Matrix<Scalar,Dynamic,1>, 0, OuterStride<> > l(tempv.data()+segsize+aligned_offset+aligned_with_B_offset, nrow, OuterStride<>(ldl) );
|
72
|
+
|
73
|
+
l.setZero();
|
74
|
+
internal::sparselu_gemm<Scalar>(l.rows(), l.cols(), B.cols(), B.data(), B.outerStride(), u.data(), u.outerStride(), l.data(), l.outerStride());
|
75
|
+
|
76
|
+
// Scatter tempv[] into SPA dense[] as a temporary storage
|
77
|
+
isub = lptr + no_zeros;
|
78
|
+
for (i = 0; i < ((SegSizeAtCompileTime==Dynamic)?segsize:SegSizeAtCompileTime); i++)
|
79
|
+
{
|
80
|
+
irow = lsub(isub++);
|
81
|
+
dense(irow) = tempv(i);
|
82
|
+
}
|
83
|
+
|
84
|
+
// Scatter l into SPA dense[]
|
85
|
+
for (i = 0; i < nrow; i++)
|
86
|
+
{
|
87
|
+
irow = lsub(isub++);
|
88
|
+
dense(irow) -= l(i);
|
89
|
+
}
|
90
|
+
}
|
91
|
+
|
92
|
+
template <> struct LU_kernel_bmod<1>
|
93
|
+
{
|
94
|
+
template <typename BlockScalarVector, typename ScalarVector, typename IndexVector, typename Index>
|
95
|
+
static EIGEN_DONT_INLINE void run(const int /*segsize*/, BlockScalarVector& dense, ScalarVector& /*tempv*/, ScalarVector& lusup, Index& luptr,
|
96
|
+
const Index lda, const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros);
|
97
|
+
};
|
98
|
+
|
99
|
+
|
100
|
+
template <typename BlockScalarVector, typename ScalarVector, typename IndexVector, typename Index>
|
101
|
+
EIGEN_DONT_INLINE void LU_kernel_bmod<1>::run(const int /*segsize*/, BlockScalarVector& dense, ScalarVector& /*tempv*/, ScalarVector& lusup, Index& luptr,
|
102
|
+
const Index lda, const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros)
|
103
|
+
{
|
104
|
+
typedef typename ScalarVector::Scalar Scalar;
|
105
|
+
Scalar f = dense(lsub(lptr + no_zeros));
|
106
|
+
luptr += lda * no_zeros + no_zeros + 1;
|
107
|
+
const Scalar* a(lusup.data() + luptr);
|
108
|
+
const /*typename IndexVector::Scalar*/Index* irow(lsub.data()+lptr + no_zeros + 1);
|
109
|
+
Index i = 0;
|
110
|
+
for (; i+1 < nrow; i+=2)
|
111
|
+
{
|
112
|
+
Index i0 = *(irow++);
|
113
|
+
Index i1 = *(irow++);
|
114
|
+
Scalar a0 = *(a++);
|
115
|
+
Scalar a1 = *(a++);
|
116
|
+
Scalar d0 = dense.coeff(i0);
|
117
|
+
Scalar d1 = dense.coeff(i1);
|
118
|
+
d0 -= f*a0;
|
119
|
+
d1 -= f*a1;
|
120
|
+
dense.coeffRef(i0) = d0;
|
121
|
+
dense.coeffRef(i1) = d1;
|
122
|
+
}
|
123
|
+
if(i<nrow)
|
124
|
+
dense.coeffRef(*(irow++)) -= f * *(a++);
|
125
|
+
}
|
126
|
+
|
127
|
+
} // end namespace internal
|
128
|
+
|
129
|
+
} // end namespace Eigen
|
130
|
+
#endif // SPARSELU_KERNEL_BMOD_H
|