HomeSort by relevance Sort by last modified time
    Searched refs:rankUpdate (Results 1 - 19 of 19) sorted by null

  /external/eigen/test/
product_syrk.cpp 36 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()),
40 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(),
44 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1)._expression(),
48 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs1.adjoint(),s1)._expression(),
52 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs3.adjoint(),s1)._expression(),
56 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs3.adjoint(),s1)._expression(),
60 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.col(c),s1)._expression()),
64 VERIFY_IS_APPROX((m2.template selfadjointView<Upper>().rankUpdate(m1.col(c),s1)._expression()),
68 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.col(c).conjugate(),s1)._expression()),
72 VERIFY_IS_APPROX((m2.template selfadjointView<Upper>().rankUpdate(m1.col(c).conjugate(),s1)._expression())
    [all...]
product_selfadjoint.cpp 43 m2.template selfadjointView<Lower>().rankUpdate(v1,v2);
47 m2.template selfadjointView<Upper>().rankUpdate(-v1,s2*v2,s3);
51 m2.template selfadjointView<Upper>().rankUpdate(-s2*r1.adjoint(),r2.adjoint()*s3,s1);
57 m2.block(1,1,rows-1,cols-1).template selfadjointView<Lower>().rankUpdate(v1.tail(rows-1),v2.head(cols-1));
nomalloc.cpp 85 m2.template selfadjointView<Lower>().rankUpdate(m1.col(0),-1);
86 m2.template selfadjointView<Lower>().rankUpdate(m1.row(0),-1);
90 // m1.template selfadjointView<Lower>().rankUpdate(m2);
cholesky.cpp 53 chollo.rankUpdate(vec, sigma);
56 cholup.rankUpdate(vec, sigma);
product_notemporary.cpp 98 VERIFY_EVALUATION_COUNT( m3.template selfadjointView<Lower>().rankUpdate(m2.adjoint()), 0);
sparse_solver.h 149 halfA.template selfadjointView<Solver::UpLo>().rankUpdate(M);
  /external/eigen/Eigen/src/Cholesky/
LLT_MKL.h 75 static typename MatrixType::Index rankUpdate(MatrixType& mat, const VectorType& vec, const typename MatrixType::RealScalar& sigma) \
86 static typename MatrixType::Index rankUpdate(MatrixType& mat, const VectorType& vec, const typename MatrixType::RealScalar& sigma) \
89 return llt_inplace<EIGTYPE, Lower>::rankUpdate(matt, vec.conjugate(), sigma); \
LLT.h 174 LLT rankUpdate(const VectorType& vec, const RealScalar& sigma = 1);
317 if(rs>0) A22.template selfadjointView<Lower>().rankUpdate(A21,-1); // bottleneck
323 static typename MatrixType::Index rankUpdate(MatrixType& mat, const VectorType& vec, const RealScalar& sigma)
346 static typename MatrixType::Index rankUpdate(MatrixType& mat, const VectorType& vec, const RealScalar& sigma)
349 return llt_inplace<Scalar, Lower>::rankUpdate(matt, vec.conjugate(), sigma);
404 LLT<_MatrixType,_UpLo> LLT<_MatrixType,_UpLo>::rankUpdate(const VectorType& v, const RealScalar& sigma)
409 if(internal::llt_inplace<typename MatrixType::Scalar, UpLo>::rankUpdate(m_matrix,v,sigma)>=0)
LDLT.h 102 * \sa rankUpdate(w,sigma)
199 LDLT& rankUpdate(const MatrixBase<Derived>& w,RealScalar alpha=1);
452 LDLT<MatrixType,_UpLo>& LDLT<MatrixType,_UpLo>::rankUpdate(const MatrixBase<Derived>& w,typename NumTraits<typename MatrixType::Scalar>::Real sigma)
  /external/ceres-solver/internal/ceres/
dense_normal_cholesky_solver.cc 82 // Using rankUpdate instead of GEMM, exposes the fact that its the
85 lhs.selfadjointView<Eigen::Upper>().rankUpdate(Aref.transpose());
line_search_direction.cc 268 rankUpdate(delta_x, delta_x_times_delta_x_transpose_scale_factor);
  /external/eigen/blas/
level2_real_impl.h 92 // if(UPLO(*uplo)==LO) matrix(c,*n,*n,*ldc).selfadjointView<Lower>().rankUpdate(vector(x_cpy,*n), alpha);
93 // else if(UPLO(*uplo)==UP) matrix(c,*n,*n,*ldc).selfadjointView<Upper>().rankUpdate(vector(x_cpy,*n), alpha);
146 if(UPLO(*uplo)==LO) matrix(c,*n,*n,*ldc).selfadjointView<Lower>().rankUpdate(vector(x_cpy,*n), vector(y_cpy,*n), alpha);
147 else if(UPLO(*uplo)==UP) matrix(c,*n,*n,*ldc).selfadjointView<Upper>().rankUpdate(vector(x_cpy,*n), vector(y_cpy,*n), alpha);
level2_cplx_impl.h 138 // if(UPLO(*uplo)==LO) matrix(a,*n,*n,*lda).selfadjointView<Lower>().rankUpdate(vector(x_cpy,*n), alpha);
139 // else if(UPLO(*uplo)==UP) matrix(a,*n,*n,*lda).selfadjointView<Upper>().rankUpdate(vector(x_cpy,*n), alpha);
185 if(UPLO(*uplo)==LO) matrix(a,*n,*n,*lda).selfadjointView<Lower>().rankUpdate(vector(x_cpy,*n),vector(y_cpy,*n),alpha);
186 else if(UPLO(*uplo)==UP) matrix(a,*n,*n,*lda).selfadjointView<Upper>().rankUpdate(vector(x_cpy,*n),vector(y_cpy,*n),alpha);
  /external/eigen/Eigen/src/Core/products/
SelfadjointRank2Update.h 61 ::rankUpdate(const MatrixBase<DerivedU>& u, const MatrixBase<DerivedV>& v, Scalar alpha)
SelfadjointProduct.h 116 ::rankUpdate(const MatrixBase<DerivedU>& u, Scalar alpha)
  /external/eigen/Eigen/src/Core/
SelfAdjointView.h 132 * \sa rankUpdate(const MatrixBase<DerivedU>&, Scalar)
135 SelfAdjointView& rankUpdate(const MatrixBase<DerivedU>& u, const MatrixBase<DerivedV>& v, Scalar alpha = Scalar(1));
145 * \sa rankUpdate(const MatrixBase<DerivedU>&, const MatrixBase<DerivedV>&, Scalar)
148 SelfAdjointView& rankUpdate(const MatrixBase<DerivedU>& u, Scalar alpha = Scalar(1));
  /external/eigen/Eigen/src/SparseCore/
SparseSelfAdjointView.h 97 SparseSelfAdjointView& rankUpdate(const SparseMatrixBase<DerivedU>& u, Scalar alpha = Scalar(1));
176 SparseSelfAdjointView<MatrixType,UpLo>::rankUpdate(const SparseMatrixBase<DerivedU>& u, Scalar alpha)
  /external/eigen/Eigen/src/Eigenvalues/
Tridiagonalization.h 372 .rankUpdate(matA.col(i).tail(remainingSize), hCoeffs.tail(remainingSize), -1);
  /external/eigen/bench/btl/libs/eigen3/
eigen3_interface.hh 101 X.template selfadjointView<Lower>().rankUpdate(A);

Completed in 397 milliseconds