| /external/eigen/Eigen/src/Core/products/ |
| TriangularMatrixVector_MKL.h | 102 if (ConjRhs) x_tmp = rhs.conjugate(); else x_tmp = rhs; \
133 if (ConjRhs) x_tmp = rhs.conjugate(); else x_tmp = rhs; \
187 if (ConjRhs) x_tmp = rhs.conjugate(); else x_tmp = rhs; \
218 if (ConjRhs) x_tmp = rhs.conjugate(); else x_tmp = rhs; \
|
| TriangularMatrixMatrix_MKL.h | 153 if (ConjugateRhs) b_tmp = rhs.conjugate(); else b_tmp = rhs; \
165 if (conjA) a_tmp = lhs.conjugate(); else a_tmp = lhs; \
267 if (ConjugateLhs) b_tmp = lhs.conjugate(); else b_tmp = lhs; \
279 if (conjA) a_tmp = rhs.conjugate(); else a_tmp = rhs; \
|
| SelfadjointMatrixVector_MKL.h | 97 x_tmp=map_x.conjugate(); \
|
| /external/eigen/Eigen/src/plugins/ |
| CommonCwiseUnaryOps.h | 19 /** \internal the return type of conjugate() */
97 /** \returns an expression of the complex conjugate of \c *this.
101 conjugate() const function
|
| /external/eigen/doc/ |
| I02_HiPerformance.dox | 30 alpha is a scalar value, and op1, op2 can be transpose, adjoint, conjugate, or the identity.
37 \code m1.noalias() -= s4 * (s1 * m2.adjoint() * (-(s3*m3).conjugate()*s2)) \endcode
39 \code m1.noalias() += (s1*s2*conj(s3)*s4) * m2.adjoint() * m3.conjugate() \endcode
|
| /external/eigen/test/eigen2/ |
| eigen2_sparse_product.cpp | 85 refLo = refUp.transpose().conjugate();
86 mLo = mUp.transpose().conjugate();
96 VERIFY_IS_APPROX(mS.transpose().conjugate(), mS);
|
| /external/eigen/Eigen/src/Core/util/ |
| BlasUtil.h | 24 template<typename Scalar, typename Index, int nr, int StorageOrder, bool Conjugate = false, bool PanelMode=false>
27 template<typename Scalar, typename Index, int Pack1, int Pack2, int StorageOrder, bool Conjugate = false, bool PanelMode = false>
41 template<bool Conjugate> struct conj_if;
150 * and conjugate */
173 // pop conjugate
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| numbers.py | 38 *, /, abs(), .conjugate, ==, and !=.
152 def conjugate(self): member in class:Complex
153 """(x+y*i).conjugate() returns (x-y*i)."""
263 def conjugate(self): member in class:Real
264 """Conjugate is a no-op for Reals."""
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| numbers.py | 38 *, /, abs(), .conjugate, ==, and !=.
152 def conjugate(self): member in class:Complex
153 """(x+y*i).conjugate() returns (x-y*i)."""
263 def conjugate(self): member in class:Real
264 """Conjugate is a no-op for Reals."""
|
| /external/eigen/Eigen/src/Householder/ |
| HouseholderSequence.h | 50 * In addition to the adjoint, you can also apply the inverse (=adjoint), the transpose, and the conjugate operators.
208 /** \brief Complex conjugate of the Householder sequence. */
209 ConjugateReturnType conjugate() const function in class:Eigen::HouseholderSequence
211 return ConjugateReturnType(m_vectors, m_coeffs.conjugate())
217 /** \brief Adjoint (conjugate transpose) of the Householder sequence. */
220 return conjugate().setTrans(!m_trans);
372 /* Necessary for .adjoint() and .conjugate() */
|
| /external/ceres-solver/include/ceres/ |
| types.h | 89 // Solves the reduced linear system using Conjugate Gradients, based
94 // Conjugate gradients on the normal equations.
170 // A generalization of the Conjugate Gradient method to non-linear
173 // precise choice of the non-linear conjugate gradient algorithm
234 // Nonliner conjugate gradient methods are a generalization of the
235 // method of Conjugate Gradients for linear systems. The
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| BiCGSTAB.h | 18 /** \internal Low-level bi conjugate gradient stabilized algorithm
106 * \brief A bi conjugate gradient stabilized solver for sparse square problems
108 * This class allows to solve for A.x = b sparse linear problems using a bi conjugate gradient
|
| ConjugateGradient.h | 17 /** \internal Low-level conjugate gradient algorithm
96 * \brief A conjugate gradient solver for sparse self-adjoint problems
98 * This class allows to solve for A.x = b sparse linear problems using a conjugate gradient algorithm.
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| ConstrainedConjGrad.h | 46 * \f$ CINV = (C * C^T)^{-1} * C \f$ based on a conjugate gradient method.
75 { /* conjugate gradient to compute e */
101 * Constrained conjugate gradient
|
| /external/ceres-solver/internal/ceres/ |
| cgnr_solver.h | 44 // A conjugate gradients on the normal equations solver. This directly solves
|
| implicit_schur_complement.h | 69 // Preconditioned Conjugate Gradients.
71 // The key operation in a conjugate gradient solver is the evaluation of the
|
| iterative_schur_complement_solver.h | 55 // The key idea is that one can run Conjugate Gradients on the Schur
|
| /external/eigen/test/ |
| product_mmtr.cpp | 51 CHECK_MMTR(matc, Upper, -= s*(osc.transpose()*osc.conjugate()));
|
| /external/eigen/Eigen/src/Eigen2Support/Geometry/ |
| Quaternion.h | 174 Quaternion conjugate(void) const;
370 * and/or the quaternion is normalized, then it is enough to use the conjugate.
372 * \sa Quaternion::conjugate()
377 // FIXME should this function be called multiplicativeInverse and conjugate() be called inverse() or opposite() ??
380 return Quaternion(conjugate().coeffs() / n2);
388 /** \returns the conjugate of the \c *this which is equal to the multiplicative inverse
390 * The conjugate of a quaternion represents the opposite rotation.
395 inline Quaternion<Scalar> Quaternion<Scalar>::conjugate() const function in class:Eigen::Quaternion
|
| /external/eigen/demos/opengl/ |
| camera.cpp | 159 qa = qa.conjugate();
197 Quaternionf q = orientation().conjugate();
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/bits/ |
| cmathcalls.h | 116 /* Complex conjugate of Z. */
152 /* Complex conjugate of Z. */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/bits/ |
| cmathcalls.h | 116 /* Complex conjugate of Z. */
152 /* Complex conjugate of Z. */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/bits/ |
| cmathcalls.h | 116 /* Complex conjugate of Z. */
152 /* Complex conjugate of Z. */
|
| /external/chromium-trace/trace-viewer/third_party/gl-matrix/spec/gl-matrix/ |
| quat-spec.js | 248 describe("conjugate", function() {
250 beforeEach(function() { result = quat.conjugate(out, quatA); });
258 beforeEach(function() { result = quat.conjugate(quatA, quatA); });
|
| /external/eigen/Eigen/src/Cholesky/ |
| LLT_MKL.h | 89 return llt_inplace<EIGTYPE, Lower>::rankUpdate(matt, vec.conjugate(), sigma); \
|
