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

1 2 34 5

  /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/
LMonestep.h 116 m_wa3 = m_rfactor.template triangularView<Upper>() * (m_permutation.inverse() *m_wa1);
  /external/eigen/Eigen/src/Core/
Transpose.h 231 m.matrix().template triangularView<StrictlyUpper>().swap(m.matrix().transpose());
256 m.matrix().template triangularView<StrictlyUpper>().swap(m.matrix().transpose());
  /external/eigen/Eigen/src/IterativeLinearSolvers/
IncompleteCholesky.h 161 x = m_L.template triangularView<Lower>().solve(x);
162 x = m_L.adjoint().template triangularView<Upper>().solve(x);
IncompleteLUT.h 174 x = m_lu.template triangularView<UnitLower>().solve(x);
175 x = m_lu.template triangularView<Upper>().solve(x);
  /external/eigen/Eigen/src/SparseCore/
SparseMatrixBase.h 333 inline const TriangularView<const Derived, Mode> triangularView() const;
SparseSelfAdjointView.h 198 m_matrix = tmp.template triangularView<Mode>();
200 m_matrix += alpha * tmp.template triangularView<Mode>();
  /external/eigen/doc/
TopicAliasing.dox 122 <tr> <td> TriangularView::solve() </td> <td> TriangularView::solveInPlace() </td> </tr>
TutorialSparse.dox 336 Just as with dense matrices, the triangularView() function can be used to address a triangular part of the matrix, and perform triangular solves with a dense right hand side:
338 dm2 = sm1.triangularView<Lower>(dm1);
339 dv2 = sm1.transpose().triangularView<Upper>(dv1);
  /external/eigen/unsupported/Eigen/src/MatrixFunctions/
MatrixLogarithm.h 217 .template triangularView<Upper>().solve(TminusI);
252 T = sqrtT.template triangularView<Upper>();
MatrixFunction.h 59 N.template triangularView<Upper>().solveInPlace(e);
462 result = U * (fT.template triangularView<Upper>() * U.adjoint());
  /external/eigen/Eigen/src/SparseLU/
SparseLU_SupernodalMatrix.h 275 U = A.template triangularView<UnitLower>().solve(U);
SparseLU_column_bmod.h 168 u = A.template triangularView<UnitLower>().solve(u);
SparseLU_panel_bmod.h 140 U = A.template triangularView<UnitLower>().solve(U);
  /external/eigen/unsupported/test/
matrix_power.cpp 107 typedef typename internal::conditional<IsComplex, TriangularView<MatrixType,Upper>, const MatrixType&>::type TriangularType;
  /external/eigen/Eigen/src/QR/
ColPivHouseholderQR.h 198 * \code matrixR().template triangularView<Upper>() \endcode
201 * matrixR().topLeftCorner(rank(), rank()).template triangularView<Upper>()
606 .template triangularView<Upper>()
CompleteOrthogonalDecomposition.h 175 * \code matrixT().template triangularView<Upper>() \endcode
178 * matrixR().topLeftCorner(rank(), rank()).template triangularView<Upper>()
512 .template triangularView<Upper>()
HouseholderQR.h 364 .template triangularView<Upper>()
  /external/eigen/Eigen/src/Core/util/
ForwardDeclarations.h 124 template<typename MatrixType, unsigned int Mode> class TriangularView;
  /external/eigen/Eigen/src/SPQRSupport/
SuiteSparseQRSupport.h 163 y.topRows(rk) = this->matrixR().topLeftCorner(rk, rk).template triangularView<Upper>().solve(y2.topRows(rk));
  /external/eigen/bench/
eig33.cpp 95 Scalar scale = scaledMat.cwiseAbs()/*.template triangularView<Lower>()*/.maxCoeff();
  /external/eigen/unsupported/Eigen/src/IterativeSolvers/
GMRES.h 167 H.topLeftCorner(k, k).template triangularView <Upper>().solveInPlace(y);
  /external/eigen/unsupported/Eigen/src/NonLinearOptimization/
HybridNonLinearSolver.h 260 wa3 = R.template triangularView<Upper>()*wa1 + qtf;
503 wa3 = R.template triangularView<Upper>()*wa1 + qtf;
LevenbergMarquardt.h 299 wa3 = fjac.template triangularView<Upper>() * (qrfac.colsPermutation().inverse() *wa1);
549 wa3 = fjac.topLeftCorner(n,n).template triangularView<Upper>() * (permutation.inverse() * wa1);
  /external/eigen/Eigen/src/Eigenvalues/
ComplexSchur.h 157 * \code schur.matrixT().triangularView<Upper>() \endcode
HessenbergDecomposition.h 360 result.bottomLeftCorner(n-2, n-2).template triangularView<Lower>().setZero();

Completed in 533 milliseconds

1 2 34 5