| /external/eigen/Eigen/src/Eigenvalues/ |
| HessenbergDecomposition.h | 235 return HouseholderSequenceType(m_matrix, m_hCoeffs.conjugate())
316 .applyHouseholderOnTheRight(matA.col(i).tail(remainingSize-1).conjugate(), internal::conj(h), &temp.coeffRef(0));
|
| Tridiagonalization.h | 241 return HouseholderSequenceType(m_matrix, m_hCoeffs.conjugate())
451 mat = HouseholderSequenceType(mat, hCoeffs.conjugate())
541 result.template diagonal<1>() = m_matrix.template diagonal<-1>().conjugate();
|
| /external/eigen/test/ |
| geo_transformations.cpp | 65 t1.linear() = q1.conjugate().toRotationMatrix();
176 t1.linear() = q1.conjugate().toRotationMatrix();
|
| sparse_basic.cpp | 189 VERIFY_IS_APPROX(m1.conjugate(), refM1.conjugate());
|
| /external/eigen/unsupported/Eigen/ |
| FFT | 60 * conjugate-symmetric of the first half. This saves them a copy and some
392 // create the implicit right-half spectrum (conjugate-mirror of the left-half)
|
| MatrixFunctions | 180 complex conjugate eigenvalues are allowed). In the complex case, it
327 complex conjugate eigenvalues are allowed). In that case, the matrix
|
| /external/eigen/unsupported/Eigen/src/FFT/ |
| ei_kissfft_impl.h | 302 // then fill in the conjugate symmetric half
390 // TODO look for PlanKey(nfft, ! inverse) and conjugate the twiddles
|
| /frameworks/av/media/libstagefright/codecs/amrwbenc/src/ |
| az_isp.c | 30 * For a even order m=2n, F1(z) has M/2 conjugate roots on the unit *
31 * circle and F2(z) has M/2-1 conjugate roots on the unit circle in *
|
| /external/ceres-solver/internal/ceres/ |
| conjugate_gradients_solver.cc | 31 // A preconditioned conjugate gradients solver
|
| /external/eigen/Eigen/src/Core/arch/AltiVec/ |
| Complex.h | 83 // multiply a_im * b and get the conjugate result
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| LeastSquares.h | 153 VectorType diff = (*(points[i]) - mean).conjugate();
|
| /external/eigen/doc/ |
| TopicLinearAlgebraDecompositions.dox | 238 More generally, a matrix \f$ A \f$ is selfadjoint if and only if it is equal to its adjoint \f$ A^* \f$. The adjoint is also called the \em conjugate \em transpose. </dd>
|
| /external/eigen/test/eigen2/ |
| eigen2_submatrices.cpp | 74 VERIFY_IS_APPROX(square.row(r1).eigen2_dot(m1.col(c1)), (square.lazy() * m1.conjugate())(r1,c1));
|
| /frameworks/rs/scriptc/ |
| rs_quaternion.rsh | 124 * @param q quaternion to conjugate
|
| /prebuilts/sdk/renderscript/include/ |
| rs_quaternion.rsh | 124 * @param q quaternion to conjugate
|
| /external/eigen/Eigen/src/Core/ |
| Functors.h | 71 * \brief Template functor to compute the conjugate product of two scalars
315 * \brief Template functor to compute the conjugate of a complex value
317 * \sa class CwiseUnaryOp, MatrixBase::conjugate()
[all...] |
| Dot.h | 55 * (sesquilinear) dot product, conjugate-linear in the first variable and linear in the
|
| /external/chromium_org/third_party/WebKit/Source/modules/webaudio/ |
| PeriodicWave.cpp | 180 // Generate complex conjugate because of the way the inverse FFT is defined.
|
| /external/eigen/Eigen/src/Core/util/ |
| ForwardDeclarations.h | 86 template<typename MatrixType> class Conjugate;
|
| /external/eigen/Eigen/src/QR/ |
| HouseholderQR.h | 119 return HouseholderSequenceType(m_qr, m_hCoeffs.conjugate());
|
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| PolynomialSolver.h | 322 * be no multiple roots or conjugate roots for instance.
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixSquareRoot.h | 142 // pre: T.block(i,i,2,2) has complex conjugate eigenvalues
148 // TODO: This case (2-by-2 blocks with complex conjugate eigenvalues) is probably hidden somewhere
|
| /external/ceres-solver/docs/source/ |
| solving.rst | 178 equations. Typically an iterative linear solver like the Conjugate
382 2. ``NONLINEAR_CONJUGATE_GRADIENT`` A generalization of the Conjugate
587 Conjugate Gradients solver on the *normal equations*, but without
647 The convergence rate of Conjugate Gradients for
652 :math:`\kappa(H)` is high and a direct application of Conjugate
659 Preconditioned Conjugate Gradients algorithm (PCG) and its worst case
[all...] |
| /external/eigen/Eigen/src/Cholesky/ |
| LLT.h | 349 return llt_inplace<Scalar, Lower>::rankUpdate(matt, vec.conjugate(), sigma);
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/ |
| tgmath.h | 434 /* Complex conjugate of Z. */
|
