| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointRank2Update.h | 74 // vice versa, and take the complex conjugate of all coefficients and vector entries.
|
| GeneralBlockPanelKernel.h | [all...] |
| GeneralMatrixMatrixTriangular_MKL.h | 126 a = mapA.conjugate(); \
|
| GeneralMatrixVector_MKL.h | 114 x_tmp=map_x.conjugate(); \
|
| TriangularMatrixMatrix.h | 17 // template<typename Scalar, int mr, int StorageOrder, bool Conjugate, int Mode>
23 // conj_if<NumTraits<Scalar>::IsComplex && Conjugate> cj;
|
| /external/eigen/Eigen/src/Core/arch/NEON/ |
| Complex.h | 81 // Conjugate v2
182 // Conjugate v2
|
| /external/eigen/Eigen/src/Geometry/ |
| Quaternion.h | 151 Quaternion<Scalar> conjugate() const;
640 * and/or the quaternion is normalized, then it is enough to use the conjugate.
642 * \sa QuaternionBase::conjugate()
647 // FIXME should this function be called multiplicativeInverse and conjugate() be called inverse() or opposite() ??
650 return Quaternion<Scalar>(conjugate().coeffs() / n2);
658 /** \returns the conjugate of the \c *this which is equal to the multiplicative inverse
660 * The conjugate of a quaternion represents the opposite rotation.
666 QuaternionBase<Derived>::conjugate() const function in class:Eigen::QuaternionBase
|
| /external/eigen/Eigen/src/Core/ |
| TriangularMatrix.h | 256 /** \sa MatrixBase::conjugate() */
257 inline TriangularView<MatrixConjugateReturnType,Mode> conjugate() function in class:Eigen::TriangularView
258 { return m_matrix.conjugate(); }
259 /** \sa MatrixBase::conjugate() const */
260 inline const TriangularView<MatrixConjugateReturnType,Mode> conjugate() const function in class:Eigen::TriangularView
261 { return m_matrix.conjugate(); }
|
| Transpose.h | 215 /** \returns an expression of the adjoint (i.e. conjugate transpose) of *this.
233 * \sa adjointInPlace(), transpose(), conjugate(), class Transpose, class internal::scalar_conjugate_op */
238 return this->transpose(); // in the complex case, the .conjugate() is be implicit here
|
| SolveTriangular.h | 19 template<typename LhsScalar, typename RhsScalar, typename Index, int Side, int Mode, bool Conjugate, int StorageOrder>
22 template <typename Scalar, typename Index, int Side, int Mode, bool Conjugate, int TriStorageOrder, int OtherStorageOrder>
|
| BandMatrix.h | 94 Conjugate = ReturnOpposite && NumTraits<Scalar>::IsComplex,
103 typedef typename internal::conditional<Conjugate,
|
| /external/chromium-trace/trace-viewer/third_party/gl-matrix/src/gl-matrix/ |
| quat.js | 344 * Calculates the conjugate of a quat
348 * @param {quat} a quat to calculate conjugate of
351 quat.conjugate = function (out, a) {
|
| /external/eigen/test/eigen2/ |
| eigen2_geometry.cpp | 118 // inverse and conjugate
120 VERIFY_IS_APPROX(q1 * (q1.conjugate() * v1), v1);
163 t1.linear() = q1.conjugate().toRotationMatrix();
|
| eigen2_geometry_with_eigen2_prefix.cpp | 120 // inverse and conjugate
122 VERIFY_IS_APPROX(q1 * (q1.conjugate() * v1), v1);
165 t1.linear() = q1.conjugate().toRotationMatrix();
|
| /external/webrtc/src/modules/audio_processing/aec/ |
| aec_core_sse2.c | 148 // Calculate the product of conjugate(xfBuf) by ef.
149 // re(conjugate(a) * b) = aRe * bRe + aIm * bIm
150 // im(conjugate(a) * b)= aRe * bIm - aIm * bRe
|
| /external/ceres-solver/internal/ceres/ |
| line_search_direction.cc | 81 LOG(FATAL) << "Unknown nonlinear conjugate gradient type: " << type_;
88 LOG(WARNING) << "Restarting non-linear conjugate gradients: "
|
| linear_solver.h | 125 // Iterative solvers, e.g. Preconditioned Conjugate Gradients
184 // the convergence rate of the conjugate gradients algorithm
|
| cgnr_linear_operator.h | 50 // conjugate gradients, where A is the Jacobian and D is a regularizing
|
| iterative_schur_complement_solver.cc | 99 // Instantiate a conjugate gradient solver that runs on the Schur complement
|
| symmetric_linear_solver_test.cc | 33 // old Conjugate Gradients solver.
|
| /external/eigen/test/ |
| geo_quaternion.cpp | 141 // inverse and conjugate
143 VERIFY_IS_APPROX(q1 * (q1.conjugate() * v1), v1);
|
| householder.cpp | 89 HCoeffsVectorType hc = qr.hCoeffs().conjugate();
|
| /external/eigen/Eigen/src/Householder/ |
| Householder.h | 159 tmp.noalias() = right * essential.conjugate();
|
| /external/eigen/Eigen/src/SVD/ |
| UpperBidiagonalization.h | 71 return HouseholderUSequenceType(m_householder, m_householder.diagonal().conjugate());
|
| /external/eigen/unsupported/Eigen/ |
| Polynomials | 122 -# the accuracy problem with the QR algorithm is presented: a polynomial with almost conjugate roots is provided to the solver.
|
