Searched refs:complex (Results 251 - 275 of 328) sorted by relevance
<<11121314
/external/compiler-rt/test/builtins/Unit/ |
H A D | divdc3_test.c | 16 #include <complex.h>
|
H A D | divsc3_test.c | 16 #include <complex.h>
|
H A D | divtc3_test.c | 18 #include <complex.h>
|
H A D | divxc3_test.c | 18 #include <complex.h>
|
H A D | mulsc3_test.c | 16 #include <complex.h>
|
/external/eigen/Eigen/src/Eigenvalues/ |
H A D | ComplexEigenSolver.h | 24 * \brief Computes eigenvalues and eigenvectors of general complex matrices 67 * This is \c std::complex<Scalar> if #Scalar is real (e.g., 69 * complex. 71 typedef std::complex<RealScalar> ComplexScalar; 195 * This function computes the eigenvalues of the complex matrix \p matrix. 257 // Do a complex Schur decomposition, A = U T U^*
|
H A D | GeneralizedEigenSolver.h | 36 * The generalized eigenvalues and eigenvectors of a matrix pair may be complex, even when the 38 * singular. To workaround this difficulty, the eigenvalues are provided as a pair of complex \f$ \alpha \f$ 79 * This is \c std::complex<Scalar> if #Scalar is real (e.g., 81 * complex. 83 typedef std::complex<RealScalar> ComplexScalar; 92 /** \brief Type for vector of complex scalar values eigenvalues as returned by betas(). 163 * \returns %Matrix whose columns are the (possibly complex) eigenvectors.
|
/external/eigen/test/eigen2/ |
H A D | eigen2_hyperplane.cpp | 122 CALL_SUBTEST_4( hyperplane(Hyperplane<std::complex<double>,5>()) );
|
H A D | eigen2_sparse_product.cpp | 110 CALL_SUBTEST_2( sparse_product(SparseMatrix<std::complex<double> >(16, 16)) );
|
H A D | eigen2_sparse_solvers.cpp | 74 // TODO fix the issue with complex (see SparseLLT::solveInPlace) 115 // TODO fix the issue with complex (see SparseLDLT::solveInPlace) 166 VERIFY_IS_APPROX(refDet,slu.determinant()); // FIXME det is not very stable for complex 179 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LU: umfpack"); // FIXME solve is not very stable for complex 197 CALL_SUBTEST_2( sparse_solvers<std::complex<double> >(16, 16) );
|
H A D | eigen2_triangular.cpp | 154 CALL_SUBTEST_5( triangular(Matrix<std::complex<float>,8, 8>()) );
|
/external/eigen/test/ |
H A D | eigensolver_selfadjoint.cpp | 127 CALL_SUBTEST_9( selfadjointeigensolver(Matrix<std::complex<double>,Dynamic,Dynamic,RowMajor>(s,s)) );
|
H A D | geo_hyperplane.cpp | 153 CALL_SUBTEST_4( hyperplane(Hyperplane<std::complex<double>,5>()) );
|
H A D | sparse_solvers.cpp | 109 CALL_SUBTEST_2(sparse_solvers<std::complex<double> >(s,s) );
|
H A D | sparse_product.cpp | 247 CALL_SUBTEST_2( (sparse_product<SparseMatrix<std::complex<double>, ColMajor > >()) ); 248 CALL_SUBTEST_2( (sparse_product<SparseMatrix<std::complex<double>, RowMajor > >()) );
|
/external/eigen/unsupported/Eigen/src/Polynomials/ |
H A D | PolynomialSolver.h | 21 * - greatest, smallest complex roots, 36 typedef std::complex<RealScalar> RootType; 54 /** \returns the complex roots of the polynomial */ 59 * i.e. the real part of the complex roots that have an imaginary part which 65 * \param[in] absImaginaryThreshold : the maximum bound of the imaginary part of a complex 98 * \returns the complex root with greatest norm. 107 * \returns the complex root with smallest norm. 200 * A real root is defined as the real part of a complex root with absolute imaginary 223 * A real root is defined as the real part of a complex root with absolute imaginary 246 * A real root is defined as the real part of a complex roo [all...] |
/external/eigen/unsupported/test/ |
H A D | polynomialsolver.cpp | 188 std::complex<
|
/external/lldb/examples/python/ |
H A D | sbvalue.py | 239 return complex (int(self))
|
/external/eigen/Eigen/src/Core/products/ |
H A D | GeneralBlockPanelKernel.h | 222 class gebp_traits<std::complex<RealScalar>, RealScalar, _ConjLhs, false> 225 typedef std::complex<RealScalar> LhsScalar; 302 class gebp_traits<std::complex<RealScalar>, std::complex<RealScalar>, _ConjLhs, _ConjRhs > 305 typedef std::complex<RealScalar> Scalar; 306 typedef std::complex<RealScalar> LhsScalar; 307 typedef std::complex<RealScalar> RhsScalar; 308 typedef std::complex<RealScalar> ResScalar; 347 /* Unpack the rhs coeff such that each complex coefficient is spread into 425 class gebp_traits<RealScalar, std::complex<RealScala [all...] |
/external/chromium_org/third_party/opus/src/tests/ |
H A D | test_opus_encode.c | 264 int complex=fast_rand()%11; local 265 if(opus_encoder_ctl(enc, OPUS_SET_COMPLEXITY(complex))!=OPUS_OK)test_failed();
|
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/ |
H A D | yasm.pyx | 31 Expression objects encapsulate complex expressions containing registers,
|
/external/eigen/Eigen/src/CholmodSupport/ |
H A D | CholmodSupport.h | 30 else if (internal::is_same<Scalar,std::complex<float> >::value) 35 else if (internal::is_same<Scalar,std::complex<double> >::value)
|
/external/eigen/unsupported/Eigen/src/FFT/ |
H A D | ei_kissfft_impl.h | 21 typedef std::complex<Scalar> Complex; 268 typedef std::complex<Scalar> Complex; 300 // real-to-complex forward FFT 336 // inverse complex-to-complex 343 // half-complex to scalar
|
/external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
H A D | MatrixFunction.h | 80 typedef std::complex<Scalar> ComplexScalar; 97 * This function converts the real matrix \c A to a complex matrix, 120 * \brief Partial specialization of MatrixFunction for complex matrices 518 typedef std::complex<typename NumTraits<Scalar>::Real> ComplexScalar;
|
H A D | MatrixPower.h | 50 typedef std::complex<RealScalar> ComplexScalar; 263 * This class is capable of computing real/complex matrices raised to 324 typedef std::complex<RealScalar> ComplexScalar;
|
Completed in 3715 milliseconds
<<11121314