HomeSort by relevance Sort by last modified time
    Searched full:triangularview (Results 26 - 50 of 112) sorted by null

12 3 4 5

  /external/eigen/test/
evaluators.cpp 440 VERIFY_IS_APPROX_EVALUATOR2(B, A.triangularView<Upper>(), MatrixXd(A.triangularView<Upper>()));
443 VERIFY_IS_APPROX_EVALUATOR2(B, A.triangularView<UnitLower>(), MatrixXd(A.triangularView<UnitLower>()));
446 VERIFY_IS_APPROX_EVALUATOR2(B, A.triangularView<UnitUpper>(), MatrixXd(A.triangularView<UnitUpper>()));
449 C = B; C.triangularView<Upper>() = A;
450 copy_using_evaluator(B.triangularView<Upper>(), A);
451 VERIFY(B.isApprox(C) && "copy_using_evaluator(B.triangularView<Upper>(), A)");
454 C = B; C.triangularView<Lower>() = A.triangularView<Lower>()
    [all...]
nesting_ops.cpp 61 VERIFY_EVALUATION_COUNT( use_n_times<1>(m1.template triangularView<Lower>().solve(m1.col(0))), 1 );
62 VERIFY_EVALUATION_COUNT( use_n_times<10>(m1.template triangularView<Lower>().solve(m1.col(0))), 1 );
64 VERIFY_EVALUATION_COUNT( use_n_times<1>(Scalar(2)*m1.template triangularView<Lower>().solve(m1.col(0))), 2 ); // FIXME could be one by applying the scaling in-place on the solve result
65 VERIFY_EVALUATION_COUNT( use_n_times<1>(m1.col(0)+m1.template triangularView<Lower>().solve(m1.col(0))), 2 ); // FIXME could be one by adding m1.col() inplace
66 VERIFY_EVALUATION_COUNT( use_n_times<10>(m1.col(0)+m1.template triangularView<Lower>().solve(m1.col(0))), 2 );
88 VERIFY( verify_eval_type<1>(m1.template triangularView<Lower>().solve(m1), m1) );
89 VERIFY( verify_eval_type<1>(m1+m1.template triangularView<Lower>().solve(m1), m1) );
nomalloc.cpp 58 m2.col(0).noalias() = m1.template triangularView<Upper>() * m1.col(0);
59 m2.col(0).noalias() -= m1.adjoint().template triangularView<Upper>() * m1.col(0);
60 m2.col(0).noalias() -= m1.template triangularView<Upper>() * m1.row(0).adjoint();
61 m2.col(0).noalias() -= m1.adjoint().template triangularView<Upper>() * m1.row(0).adjoint();
63 m2.row(0).noalias() = m1.row(0) * m1.template triangularView<Upper>();
64 m2.row(0).noalias() -= m1.row(0) * m1.adjoint().template triangularView<Upper>();
65 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.template triangularView<Upper>();
66 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.adjoint().template triangularView<Upper>();
86 m2 += m2.template triangularView<Upper>() * m1;
87 m2.template triangularView<Upper>() = m2 * m2
    [all...]
product_notemporary.cpp 76 VERIFY_EVALUATION_COUNT( m3.noalias() -= (s1 * m1).template triangularView<Lower>() * m2, 0);
77 VERIFY_EVALUATION_COUNT( rm3.noalias() = (s1 * m1.adjoint()).template triangularView<Upper>() * (m2+m2), 1);
78 VERIFY_EVALUATION_COUNT( rm3.noalias() = (s1 * m1.adjoint()).template triangularView<UnitUpper>() * m2.adjoint(), 0);
80 VERIFY_EVALUATION_COUNT( m3.template triangularView<Upper>() = (m1 * m2.adjoint()), 0);
81 VERIFY_EVALUATION_COUNT( m3.template triangularView<Upper>() -= (m1 * m2.adjoint()), 0);
84 VERIFY_EVALUATION_COUNT( rm3.col(c0).noalias() = (s1 * m1.adjoint()).template triangularView<UnitUpper>() * (s2*m2.row(c0)).adjoint(), 1);
86 VERIFY_EVALUATION_COUNT( m1.template triangularView<Lower>().solveInPlace(m3), 0);
87 VERIFY_EVALUATION_COUNT( m1.adjoint().template triangularView<Lower>().solveInPlace(m3.transpose()), 0);
106 VERIFY_EVALUATION_COUNT( m3.noalias() = m1.block(r0,r0,r1,r1).template triangularView<UnitUpper>() * m2.block(r0,c0,r1,c1), 1);
bandmatrix.cpp 1 // This file is triangularView of Eigen, a lightweight C++ template library
52 dm1.block(0,supers+1,cols-supers-1-a,cols-supers-1-a).template triangularView<Upper>().setZero();
53 dm1.block(subs+1,0,rows-subs-1-b,rows-subs-1-b).template triangularView<Lower>().setZero();
sparse_product.cpp 315 // sparse triangularView with dense matrices
316 VERIFY_IS_APPROX(x=mA.template triangularView<Upper>()*b, refX=refA.template triangularView<Upper>()*b);
317 VERIFY_IS_APPROX(x=mA.template triangularView<Lower>()*b, refX=refA.template triangularView<Lower>()*b);
318 VERIFY_IS_APPROX(x=b*mA.template triangularView<Upper>(), refX=b*refA.template triangularView<Upper>());
319 VERIFY_IS_APPROX(x=b*mA.template triangularView<Lower>(), refX=b*refA.template triangularView<Lower>());
321 // sparse triangularView with sparse matrice
    [all...]
eigensolver_selfadjoint.cpp 90 symmA.template triangularView<StrictlyUpper>().setZero();
91 symmC.template triangularView<StrictlyUpper>().setZero();
96 symmB.template triangularView<StrictlyUpper>().setZero();
154 //VERIFY(T.topRightCorner(rows-2, cols-2).template triangularView<Upper>().isZero());
220 m2 = m1.triangularView<Upper>();
sparse_basic.cpp 425 // test triangularView
430 refMat3 = refMat2.template triangularView<Lower>();
431 m3 = m2.template triangularView<Lower>();
434 refMat3 = refMat2.template triangularView<Upper>();
435 m3 = m2.template triangularView<Upper>();
439 refMat3 = refMat2.template triangularView<UnitUpper>();
440 m3 = m2.template triangularView<UnitUpper>();
443 refMat3 = refMat2.template triangularView<UnitLower>();
444 m3 = m2.template triangularView<UnitLower>();
448 refMat3 = refMat2.template triangularView<StrictlyUpper>()
    [all...]
cholesky.cpp 32 MatrixType symmLo = symm.template triangularView<Lower>();
33 MatrixType symmUp = symm.template triangularView<Upper>();
84 SquareMatrixType symmUp = symm.template triangularView<Upper>();
85 SquareMatrixType symmLo = symm.template triangularView<Lower>();
153 SquareMatrixType symmUp = symm.template triangularView<Upper>();
154 SquareMatrixType symmLo = symm.template triangularView<Lower>();
314 RealMatrixType symmLo = symm.template triangularView<Lower>();
333 RealMatrixType symmLo = symm.template triangularView<Lower>();
  /external/eigen/Eigen/src/Householder/
BlockHouseholder.h 42 // triFactor.col(i).head(i) = triFactor.block(0,0,i,i).template triangularView<Upper>()
64 * vectors.bottomRightCorner(rs, rt).template triangularView<UnitLower>();
67 triFactor.row(i).tail(rt) = triFactor.row(i).tail(rt) * triFactor.bottomRightCorner(rt,rt).template triangularView<Upper>();
87 const TriangularView<const VectorsType, UnitLower> V(vectors);
94 if(forward) tmp = T.template triangularView<Upper>() * tmp;
95 else tmp = T.template triangularView<Upper>().adjoint() * tmp;
  /external/eigen/Eigen/src/Core/
SelfAdjointView.h 173 * If \c TriMode references the same triangular part than \c *this, then this method simply return a \c TriangularView of the nested expression,
174 * otherwise, the nested expression is first transposed, thus returning a \c TriangularView<Transpose<MatrixType>> object.
176 * \sa MatrixBase::triangularView(), class TriangularView
181 TriangularView<MatrixType,TriMode>,
182 TriangularView<typename MatrixType::AdjointReturnType,TriMode> >::type
183 triangularView() const
188 TriangularView<MatrixType,TriMode>,
189 TriangularView<typename MatrixType::AdjointReturnType,TriMode> >::type(tmp2);
  /external/eigen/blas/
level3_impl.h 325 matA.triangularView<Upper>() = matrix(a,size,size,*lda);
326 matA.triangularView<Lower>() = matrix(a,size,size,*lda).transpose();
330 matA.triangularView<Lower>() = matrix(a,size,size,*lda);
331 matA.triangularView<Upper>() = matrix(a,size,size,*lda).transpose();
399 if(beta==Scalar(0)) matrix(c, *n, *n, *ldc).triangularView<Upper>().setZero();
400 else matrix(c, *n, *n, *ldc).triangularView<Upper>() *= beta;
402 if(beta==Scalar(0)) matrix(c, *n, *n, *ldc).triangularView<Lower>().setZero();
403 else matrix(c, *n, *n, *ldc).triangularView<Lower>() *= beta;
414 matrix(c, *n, *n, *ldc).triangularView<Upper>() += alpha * matrix(a,*n,*k,*lda) * matrix(a,*n,*k,*lda).transpose();
416 matrix(c, *n, *n, *ldc).triangularView<Upper>() += alpha * matrix(a,*k,*n,*lda).transpose() * matrix(a,*k,*n,*lda)
    [all...]
  /external/eigen/unsupported/Eigen/src/IterativeSolvers/
IncompleteLU.h 80 x = m_lu.template triangularView<UnitLower>().solve(b);
81 x = m_lu.template triangularView<Upper>().solve(x);
  /external/tensorflow/tensorflow/core/kernels/
cholesky_grad.cc 68 input_matrix_l_full.template triangularView<Eigen::Lower>();
70 output_matrix = input_matrix_grad.template triangularView<Eigen::Lower>();
109 .template triangularView<Eigen::Upper>()
112 D_bar -= (C_bar.adjoint() * C).template triangularView<Eigen::Lower>();
  /external/eigen/doc/
A05_PortingFrom2To3.dox 110 A.triangularView<Upper>()
111 A.triangularView<StrictlyLower>()\endcode</td></tr>
116 A.triangularView<Upper>()
117 A.triangularView<StrictlyLower>()\endcode</td></tr>
122 A.triangularView<Upper>()
123 A.triangularView<StrictlyLower>()\endcode</td></tr>
150 \sa class TriangularView, class SelfAdjointView
156 <tr><td>\code A.triangularSolveInPlace<XxxTriangular>(Y);\endcode</td><td>\code A.triangularView<Xxx>().solveInPlace(Y);\endcode</td></tr>
QuickReference.dox 635 TriangularView gives a view on a triangular part of a dense matrix and allows to perform optimized operations on it. The opposite triangular part is never referenced and can be used to store other information.
637 \note The .triangularView() template member function requires the \c template keyword if it is used on an
646 m.triangularView<Xxx>()
653 m1.triangularView<Eigen::Lower>() = m2 + m3 \endcode
658 m2 = m1.triangularView<Eigen::UnitUpper>()\endcode
663 m3 += s1 * m1.adjoint().triangularView<Eigen::UnitUpper>() * m2
664 m3 -= s1 * m2.conjugate() * m1.adjoint().triangularView<Eigen::Lower>() \endcode
672 L1.triangularView<Eigen::UnitLower>().solveInPlace(M2)
673 L1.triangularView<Eigen::Lower>().adjoint().solveInPlace(M3)
674 U1.triangularView<Eigen::Upper>().solveInPlace<OnTheRight>(M4)\endcod
    [all...]
TemplateKeyword.dox 76 and \c Derived2 in the example). That means that the compiler cannot know that <tt>dst.triangularView</tt> is
78 parameter. Another possibility would be that <tt>dst.triangularView</tt> is a member variable with the &lt;
80 possibility, according to the standard. If <tt>dst.triangularView</tt> is a member template (as in our case),
82 triangularView</tt>.
  /external/eigen/unsupported/Eigen/src/NonLinearOptimization/
qrsolv.h 35 s.topLeftCorner(n,n).template triangularView<StrictlyLower>() = s.topLeftCorner(n,n).transpose();
79 s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));
covar.h 64 r.topLeftCorner(n,n).template triangularView<StrictlyUpper>() = r.topLeftCorner(n,n).transpose();
  /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/
LMpar.h 64 //FIXME There is no solve in place for sparse triangularView
65 wa1.head(rank) = s.topLeftCorner(rank,rank).template triangularView<Upper>().solve(qtb.head(rank));
87 s.topLeftCorner(n,n).transpose().template triangularView<Lower>().solveInPlace(wa1);
LMqrsolv.h 48 s.topLeftCorner(n,n).template triangularView<StrictlyLower>() = s.topLeftCorner(n,n).transpose();
91 s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));
178 wa.head(nsing) = R.topLeftCorner(nsing,nsing).template triangularView<Upper>().solve/*InPlace*/(wa.head(nsing));
LMcovar.h 76 r.topLeftCorner(n,n).template triangularView<StrictlyUpper>() = r.topLeftCorner(n,n).transpose();
  /external/eigen/Eigen/src/LU/
PartialPivLU.h 170 * \sa TriangularView::solve(), inverse(), computeInverse()
240 m_lu.template triangularView<UnitLower>().solveInPlace(dst);
243 m_lu.template triangularView<Upper>().solveInPlace(dst);
260 dst = m_lu.template triangularView<Upper>().adjoint().solve(rhs);
262 m_lu.template triangularView<UnitLower>().adjoint().solveInPlace(dst);
265 dst = m_lu.template triangularView<Upper>().transpose().solve(rhs);
267 m_lu.template triangularView<UnitLower>().transpose().solveInPlace(dst);
490 A11.template triangularView<UnitLower>().solveInPlace(A12);
553 MatrixType res = m_lu.template triangularView<UnitLower>().toDenseMatrix()
554 * m_lu.template triangularView<Upper>()
    [all...]
FullPivLU.h 238 * \sa TriangularView::solve(), kernel(), inverse()
602 .template triangularView<UnitLower>().toDenseMatrix()
604 .template triangularView<Upper>().toDenseMatrix();
669 // FIXME when we get triangularView-for-rectangular-matrices, this can be simplified
679 m.block(0, 0, rank(), rank()).template triangularView<StrictlyLower>().setZero();
687 .template triangularView<Upper>().solveInPlace(
776 .template triangularView<UnitLower>()
783 .template triangularView<Upper>()
827 .template triangularView<Upper>()
832 .template triangularView<UnitLower>(
    [all...]
  /external/eigen/bench/btl/libs/eigen3/
eigen3_interface.hh 100 X.template triangularView<Lower>().setZero();
194 X = L.template triangularView<Lower>().solve(B);
198 X = L.template triangularView<Upper>().solve(B);
202 X.noalias() = L.template triangularView<Lower>() * B;

Completed in 9322 milliseconds

12 3 4 5