| /external/eigen/test/ |
| sparse_product.cpp | 167 VERIFY_IS_APPROX(x=mUp.template selfadjointView<Upper>()*b, refX=refS*b);
169 VERIFY_IS_APPROX(x=mS.template selfadjointView<Upper|Lower>()*b, refX=refS*b);
|
| lu.cpp | 70 u = lu.matrixLU().template triangularView<Upper>();
|
| product_trmm.cpp | 91 CALL_ALL_ORDERS(EIGEN_CAT(1,NB),SCALAR,Upper) \
|
| qr.cpp | 30 MatrixType r = qrOfA.matrixQR().template triangularView<Upper>();
|
| sparse_basic.cpp | 343 refMat3 = refMat2.template triangularView<Upper>();
344 m3 = m2.template triangularView<Upper>();
|
| /external/llvm/lib/IR/ |
| Instructions.cpp | [all...] |
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointProduct.h | 45 selfadjoint_rank1_update<Scalar,Index,ColMajor,UpLo==Lower?Upper:Lower,ConjRhs,ConjLhs>::run(size,mat,stride,vec,alpha);
|
| TriangularMatrixMatrix.h | 67 (Mode&(UnitDiag|ZeroDiag)) | ((Mode&Upper) ? Lower : Upper),
151 // 3 - the dense panel below (lower case) or above (upper case) the diagonal block => GEPP
191 // the part below (lower case) or above (upper case) the diagonal => GEPP
|
| TriangularSolverMatrix.h | 29 (Mode&UnitDiag) | ((Mode&Upper) ? Lower : Upper),
|
| TriangularMatrixVector.h | 194 typedef TriangularProduct<(Mode & (UnitDiag|ZeroDiag)) | ((Mode & Lower) ? Upper : Lower),true,Transpose<const Rhs>,false,Transpose<const Lhs>,true> TriangularProductTranspose;
|
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 29 * \param UpLo the triangular part that will be used for the decompositon: Lower (default) or Upper.
109 /** \returns a view of the upper triangular matrix U */
231 * The strict upper part is used during the decomposition, the strict lower
390 template<> struct ldlt_inplace<Upper>
415 template<typename MatrixType> struct LDLT_Traits<MatrixType,Upper>
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| HybridNonLinearSolver.h | 258 wa3 = R.template triangularView<Upper>()*wa1 + qtf;
498 wa3 = R.template triangularView<Upper>()*wa1 + qtf;
|
| lmpar.h | 89 /* calculate an upper bound, paru, for the zero of the function. */
198 qr.matrixQR().topLeftCorner(rank, rank).template triangularView<Upper>().solveInPlace(wa1.head(rank));
225 /* calculate an upper bound, paru, for the zero of the function. */
|
| LevenbergMarquardt.h | 289 wa3 = fjac.template triangularView<Upper>() * (qrfac.colsPermutation().inverse() *wa1);
536 wa3 = fjac.topLeftCorner(n,n).template triangularView<Upper>() * (permutation.inverse() * wa1);
|
| /external/ceres-solver/internal/ceres/ |
| schur_complement_solver.cc | 136 .selfadjointView<Eigen::Upper>()
284 // one corresponding to upper triangular matrices.
286 // Create a upper triangular symmetric matrix.
299 // Create a upper triangular symmetric matrix.
|
| /external/eigen/Eigen/src/QR/ |
| HouseholderQR.h | 31 * by using Householder transformations. Here, \b Q a unitary matrix and \b R an upper triangular matrix.
302 .template triangularView<Upper>()
|
| FullPivHouseholderQR.h | 42 * upper triangular matrix.
504 .template triangularView<Upper>()
|
| /external/eigen/bench/btl/libs/eigen3/ |
| eigen3_interface.hh | 198 X = L.template triangularView<Upper>().solve(B);
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| GMRES.h | 144 // insert coefficients into upper matrix triangle
151 // solve upper triangular system
153 H.topLeftCorner(k, k).template triangularView < Eigen::Upper > ().solveInPlace(y);
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 72 * or Upper. Default is Lower.
261 ap.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>().twistedBy(m_P);
318 typedef SparseTriangularView<typename CholMatrixType::AdjointReturnType, Eigen::Upper> MatrixU;
357 * or Upper. Default is Lower.
445 * or Upper. Default is Lower.
693 ap.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>().twistedBy(m_P);
|
| /external/eigen/Eigen/src/SuperLUSupport/ |
| SuperLUSupport.h | 194 if (MatrixType::Flags & Upper)
253 if (MatrixType::Flags & Upper)
491 typedef TriangularView<LUMatrixType, Upper> UMatrixType;
694 int upper; local
724 upper = 1;
739 for (int i = 0; i < upper; ++i)
741 /* upper triangle in the supernode */
751 Lrow[lastl++] = L_SUB(istart + upper - 1);
752 for (int i = upper; i < nsupr; ++i)
761 ++upper;
[all...] |
| /external/llvm/lib/Analysis/ |
| InstructionSimplify.cpp | [all...] |
| /external/eigen/Eigen/src/CholmodSupport/ |
| CholmodSupport.h | 107 if(UpLo==Upper) res.stype = 1;
349 * or Upper. Default is Lower.
351 * This class supports all kind of SparseMatrix<>: row or column major; upper, lower, or both; compressed or non compressed.
396 * or Upper. Default is Lower.
398 * This class supports all kind of SparseMatrix<>: row or column major; upper, lower, or both; compressed or non compressed.
441 * or Upper. Default is Lower.
443 * This class supports all kind of SparseMatrix<>: row or column major; upper, lower, or both; compressed or non compressed.
488 * or Upper. Default is Lower.
490 * This class supports all kind of SparseMatrix<>: row or column major; upper, lower, or both; compressed or non compressed.
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteLUT.h | 114 x = m_lu.template triangularView<Upper>().solve(x);
276 // 1 - copy the lower and the upper part of the row i of mat in the working vector u
278 int sizeu = 1; // number of nonzero elements in the upper part of the current row
303 // copy the upper part
366 if (j >= ii) // dealing with the upper part
393 // reset the upper part of the pointer jr to zero
|
| /external/llvm/include/llvm/Analysis/ |
| DependenceAnalysis.h | 363 const SCEV *Upper[8];
562 /// If no upper bound is available, return NULL.
[all...] |
