| /external/eigen/test/ |
| bandmatrix.cpp | 52 dm1.block(0,supers+1,cols-supers-1-a,cols-supers-1-a).template triangularView<Upper>().setZero();
|
| qr_colpivoting.cpp | 46 cod.matrixT().topLeftCorner(rank, rank).template triangularView<Upper>();
117 MatrixType r = qr.matrixQR().template triangularView<Upper>();
175 Matrix<Scalar,Rows,Cols> r = qr.matrixQR().template triangularView<Upper>();
232 MatrixType r = qr.matrixQR().template triangularView<Upper>();
|
| eigensolver_selfadjoint.cpp | 153 // FIXME check that upper and lower part are 0:
154 //VERIFY(T.topRightCorner(rows-2, cols-2).template triangularView<Upper>().isZero());
220 m2 = m1.triangularView<Upper>();
222 SelfAdjointEigenSolver<Matrix3d> eig2(m2.selfadjointView<Upper>());
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| qrsolv.h | 79 s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));
|
| /external/pdfium/fxbarcode/oned/ |
| BC_OneDimWriter.h | 83 wchar_t Upper(wchar_t ch);
|
| /external/eigen/Eigen/src/Core/ |
| TriangularMatrix.h | 133 eigen_assert((mode==Upper && col>=row)
156 * \param Mode the kind of triangular matrix expression to construct. Can be #Upper,
158 * This is in fact a bit field; it must have either #Upper or #Lower,
209 TransposeMode = (Mode & Upper ? Lower : 0)
210 | (Mode & Lower ? Upper : 0)
286 /** \returns a selfadjoint view of the referenced triangular part which must be either \c #Upper or \c #Lower.
477 * is an upper (resp. lower) triangular matrix.
617 * The parameter \a Mode can have the following values: \c #Upper, \c #StrictlyUpper, \c #UnitUpper,
642 /** \returns true if *this is approximately equal to an upper triangular matrix,
732 * \tparam UpLo must be either Lower or Upper
[all...] |
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMqrsolv.h | 91 s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));
140 // Browse the nonzero elements of row j of the upper triangular s
178 wa.head(nsing) = R.topLeftCorner(nsing,nsing).template triangularView<Upper>().solve/*InPlace*/(wa.head(nsing));
|
| LMpar.h | 65 wa1.head(rank) = s.topLeftCorner(rank,rank).template triangularView<Upper>().solve(qtb.head(rank));
92 /* calculate an upper bound, paru, for the zero of the function. */
|
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 36 * upper-triangular, and P and Q are permutation matrices. This is a rank-revealing LU
125 /** \returns the LU decomposition matrix: the upper-triangular part is U, the
604 .template triangularView<Upper>().toDenseMatrix();
652 * U is upper triangular, with eigenvalues sorted so that any zeros appear at the end.
687 .template triangularView<Upper>().solveInPlace(
783 .template triangularView<Upper>()
827 .template triangularView<Upper>()
838 .template triangularView<Upper>()
[all...] |
| /external/tensorflow/tensorflow/compiler/xla/tests/ |
| cholesky_test.cc | 65 XLA_TEST_F(CholeskyTest, Upper) {
|
| /external/tensorflow/tensorflow/core/kernels/ |
| cholesky_grad.cc | 109 .template triangularView<Eigen::Upper>()
|
| qr_op_impl.h | 110 outputs->at(1) = qr.matrixQR().template triangularView<Eigen::Upper>();
118 outputs->at(1) = qr_top.template triangularView<Eigen::Upper>();
217 // Generate R. R is equal to the upper triangle of the decomposition
237 // Extract the upper triangle of r (i.e. zero out the strictly lower
|
| /external/eigen/Eigen/src/Core/products/ |
| TriangularMatrixVector_BLAS.h | 82 LowUp = IsLower ? Lower : Upper \
164 LowUp = IsLower ? Lower : Upper \
|
| TriangularMatrixMatrix_BLAS.h | 90 LowUp = IsLower ? Lower : Upper, \
201 LowUp = IsLower ? Lower : Upper, \
|
| /external/cldr/tools/cldr-unittest/src/org/unicode/cldr/unittest/ |
| TestTransforms.java | 495 Upper, Title, Lower
506 Transliterator elUpper = checkString("el", Casing.Upper,
514 Transliterator trUpper = checkString("tr", Casing.Upper, "IS?? ?SII",
520 Transliterator azUpper = checkString("az", Casing.Upper, "IS?? ?SII",
539 Casing.Upper,
548 // Transliterator nlUpper = checkString("tr", Casing.Upper, "IS?? ?SII",
565 case Upper:
|
| /external/eigen/Eigen/src/SVD/ |
| JacobiSVD.h | 91 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.cols(),matrix.cols()).template triangularView<Upper>();
139 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint();
175 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.cols(),matrix.cols()).template triangularView<Upper>();
232 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint();
274 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.cols(),matrix.cols()).template triangularView<Upper>();
328 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint();
[all...] |
| /external/syzkaller/vendor/golang.org/x/net/trace/ |
| histogram.go | 254 Lower, Upper int64
306 Upper: upperBound,
353 <td style="text-align:right;padding:0 0.25em">{{.Upper}})</td>
|
| /external/llvm/lib/Analysis/ |
| DependenceAnalysis.cpp | [all...] |
| InstructionSimplify.cpp | [all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| DependenceAnalysis.cpp | [all...] |
| InstructionSimplify.cpp | [all...] |
| /external/llvm/lib/Target/SystemZ/ |
| SystemZISelDAGToDAG.cpp | 116 // narrower (in which case the upper bits are don't care), or wider (in which
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseMatrixBase.h | 324 SparseSymmetricPermutationProduct<Derived,Upper|Lower> twistedBy(const PermutationMatrix<Dynamic,Dynamic,StorageIndex>& perm) const
326 return SparseSymmetricPermutationProduct<Derived,Upper|Lower>(derived(), perm);
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixLogarithm.h | 217 .template triangularView<Upper>().solve(TminusI);
252 T = sqrtT.template triangularView<Upper>();
273 * \param[in] A argument of matrix logarithm, should be upper triangular and atomic
|
| /external/swiftshader/third_party/LLVM/lib/VMCore/ |
| Instructions.cpp | [all...] |
