| /external/eigen/Eigen/src/CholmodSupport/ |
| CholmodSupport.h | 177 compute(matrix);
205 Derived& compute(const MatrixType& matrix) function in class:Eigen::CholmodBase
214 * \sa compute()
228 * \sa compute()
287 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or symbolic()/numeric()");
307 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or symbolic()/numeric()");
370 compute(matrix);
417 compute(matrix);
462 compute(matrix);
509 compute(matrix)
[all...] |
| /external/eigen/Eigen/src/Eigen2Support/ |
| SVD.h | 58 compute(matrix);
68 void compute(const MatrixType& matrix);
94 void SVD<MatrixType>::compute(const MatrixType& matrix) function in class:Eigen::SVD
122 // Compute the transformation for the k-th column and
156 // Compute the k-th row transformation and place the
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| ComplexSchur.h | 40 * Call the function compute() to compute the Schur decomposition of
88 * intends to perform decompositions via compute(). The \p size
92 * \sa compute() for an example.
107 * This constructor calls compute() to compute the Schur decomposition.
118 compute(matrix, computeU);
127 * member function compute(const MatrixType& matrix, bool computeU)
128 * has been called before to compute the Schur decomposition of a
148 * member function compute(const MatrixType& matrix, bool computeU
271 ComplexSchur<MatrixType>& ComplexSchur<MatrixType>::compute(const MatrixType& matrix, bool computeU) function in class:Eigen::ComplexSchur
[all...] |
| EigenSolver.h | 46 * Call the function compute() to compute the eigenvalues and eigenvectors of
109 * perform decompositions via EigenSolver::compute(const MatrixType&, bool).
111 * \sa compute() for an example.
138 * This constructor calls compute() to compute the eigenvalues
144 * \sa compute()
155 compute(matrix, computeEigenvectors);
164 * compute(const MatrixType&, bool) has been called before, and
186 * compute(const MatrixType&, bool) has been called before, an
351 EigenSolver<MatrixType>& EigenSolver<MatrixType>::compute(const MatrixType& matrix, bool computeEigenvectors) function in class:Eigen::EigenSolver
[all...] |
| RealSchur.h | 36 * A, and thus the real Schur decomposition is used in EigenSolver to compute
39 * Call the function compute() to compute the real Schur decomposition of a
77 * perform decompositions via compute(). The \p size parameter is only
81 * \sa compute() for an example.
97 * This constructor calls compute() to compute the Schur decomposition.
110 compute(matrix, computeU);
118 * member function compute(const MatrixType&, bool) has been called before
119 * to compute the Schur decomposition of a matrix, and \p computeU was se
204 RealSchur<MatrixType>& RealSchur<MatrixType>::compute(const MatrixType& matrix, bool computeU) function in class:Eigen::RealSchur
[all...] |
| Tridiagonalization.h | 46 * decomposition. This class is used in SelfAdjointEigenSolver to compute the
49 * Call the function compute() to compute the tridiagonal decomposition of a
107 * perform decompositions via compute(). The \p size parameter is only
111 * \sa compute() for an example.
124 * This constructor calls compute() to compute the tridiagonal decomposition.
155 Tridiagonalization& compute(const MatrixType& matrix) function in class:Eigen::Tridiagonalization
169 * the member function compute(const MatrixType&) has been called before
170 * to compute the tridiagonal decomposition of a matrix
[all...] |
| SelfAdjointEigenSolver.h | 53 * Call the function compute() to compute the eigenvalues and eigenvectors of
105 * perform decompositions via compute(). This constructor
125 * intends to perform decompositions via compute(). The \p size
129 * \sa compute() for an example
144 * This constructor calls compute(const MatrixType&, int) to compute the
151 * \sa compute(const MatrixType&, int)
159 compute(matrix, options);
192 SelfAdjointEigenSolver& compute(const MatrixType& matrix, int options = ComputeEigenvectors)
342 void compute(const MatrixType& matrix, bool computeEigenvectors) function in class:Eigen::SelfAdjointEigenSolver
347 void compute(const MatrixType& matA, const MatrixType& matB, bool computeEigenvectors = true) function in class:Eigen::SelfAdjointEigenSolver
385 ::compute(const MatrixType& matrix, int options) function in class:Eigen::SelfAdjointEigenSolver
[all...] |
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteLUT.h | 67 compute(mat);
92 * Compute an incomplete LU factorization with dual threshold on the matrix mat
97 IncompleteLUT<Scalar>& compute(const MatrixType& amat) function in class:Eigen::IncompleteLUT
166 * \param fillfactor This is used to compute the number @p fill_in of largest elements to keep on each row.
176 * Compute a quick-sort split of a vector
223 // Compute the Fill-reducing permutation
231 internal::minimum_degree_ordering<Scalar, Index>(AtA, m_P); // Then compute the AMD ordering...
|
| IterativeSolverBase.h | 45 * by a call to compute().
49 * this class becomes invalid. Call compute() to update it with the new
55 compute(A);
80 * this class becomes invalid. Call compute() to update it with the new
95 * Currently, this function mostly initialized/compute the preconditioner. In the future
100 * this class becomes invalid. Call compute() to update it with the new
103 Derived& compute(const MatrixType& A) function in class:Eigen::IterativeSolverBase
106 m_preconditioner.compute(A);
164 * \sa compute()
177 * \sa compute()
[all...] |
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU.h | 71 * perform decompositions via PartialPivLU::compute(const MatrixType&).
85 * \param matrix the matrix of which to compute the LU decomposition.
92 PartialPivLU& compute(const MatrixType& matrix);
209 compute(matrix);
387 PartialPivLU<MatrixType>& PartialPivLU<MatrixType>::compute(const MatrixType& matrix) function in class:Eigen::PartialPivLU
444 * Step 1: compute c = Pb.
|
| FullPivLU.h | 69 * perform decompositions via LU::compute(const MatrixType&).
83 * \param matrix the matrix of which to compute the LU decomposition.
90 * \param matrix the matrix of which to compute the LU decomposition.
95 FullPivLU& compute(const MatrixType& matrix);
413 compute(matrix);
417 FullPivLU<MatrixType>& FullPivLU<MatrixType>::compute(const MatrixType& matrix) function in class:Eigen::FullPivLU
568 /* Thus, all we need to do is to compute Ker U, and then apply Q.
669 * Step 1: compute c = P * rhs.
|
| /external/eigen/Eigen/src/PaStiXSupport/ |
| PaStiXSupport.h | 145 * \sa compute()
164 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or symbolic()/numeric()");
246 * \sa compute()
263 // Compute the ordering and the symbolic factorization
266 // Compute the numerical factorization
279 void compute(ColSpMatrix& mat);
336 void PastixBase<Derived>::compute(ColSpMatrix& mat) function in class:Eigen::PastixBase
469 compute(matrix);
471 /** Compute the LU supernodal factorization of \p matrix.
476 void compute (const MatrixType& matrix function in class:Eigen::PastixLU
585 void compute (const MatrixType& matrix) function in class:Eigen::PastixLLT
666 void compute (const MatrixType& matrix) function in class:Eigen::PastixLDLT
[all...] |
| /external/eigen/Eigen/src/QR/ |
| ColPivHouseholderQR.h | 64 * perform decompositions via ColPivHouseholderQR::compute(const MatrixType&).
101 compute(matrix);
139 ColPivHouseholderQR& compute(const MatrixType& matrix);
359 ColPivHouseholderQR<MatrixType>& ColPivHouseholderQR<MatrixType>::compute(const MatrixType& matrix) function in class:Eigen::ColPivHouseholderQR
|
| HouseholderQR.h | 66 * perform decompositions via HouseholderQR::compute(const MatrixType&).
88 compute(matrix);
131 HouseholderQR& compute(const MatrixType& matrix);
313 HouseholderQR<MatrixType>& HouseholderQR<MatrixType>::compute(const MatrixType& matrix) function in class:Eigen::HouseholderQR
|
| FullPivHouseholderQR.h | 75 * perform decompositions via FullPivHouseholderQR::compute(const MatrixType&).
113 compute(matrix);
153 FullPivHouseholderQR& compute(const MatrixType& matrix);
379 FullPivHouseholderQR<MatrixType>& FullPivHouseholderQR<MatrixType>::compute(const MatrixType& matrix) function in class:Eigen::FullPivHouseholderQR
547 // compute the product H'_0 H'_1 ... H'_n-1,
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixLogarithm.h | 44 /** \brief Compute matrix logarithm of atomic matrix
48 MatrixType compute(const MatrixType& A);
80 /** \brief Compute logarithm of triangular matrix with clustered eigenvalues. */
82 MatrixType MatrixLogarithmAtomic<MatrixType>::compute(const MatrixType& A) function in class:Eigen::MatrixLogarithmAtomic
95 /** \brief Compute atanh (inverse hyperbolic tangent). */
107 /** \brief Compute logarithm of 2x2 triangular matrix. */
135 /** \brief Compute logarithm of triangular matrices with size > 2.
160 MatrixSquareRootTriangular<MatrixType>(T).compute(sqrtT);
223 /* \brief Compute Pade approximation to matrix logarithm */
443 /** \brief Compute the matrix logarithm
[all...] |
| MatrixSquareRoot.h | 37 * changed (or destroyed) before compute() is called.
45 /** \brief Compute the matrix square root
53 template <typename ResultType> void compute(ResultType &result);
80 void MatrixSquareRootQuasiTriangular<MatrixType>::compute(ResultType &result) function in class:Eigen::MatrixSquareRootQuasiTriangular
82 // Compute Schur decomposition of m_A
87 // Compute square root of T
92 // Compute square root of m_A
273 /** \brief Compute the matrix square root
282 template <typename ResultType> void compute(ResultType &result);
290 void MatrixSquareRootTriangular<MatrixType>::compute(ResultType &result function in class:Eigen::MatrixSquareRootTriangular
366 template <typename ResultType> void compute(ResultType &result) function in class:Eigen::MatrixSquareRoot
400 template <typename ResultType> void compute(ResultType &result) function in class:Eigen::MatrixSquareRoot
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/cache/super/com/google/common/cache/ |
| CacheBuilder.java | 297 result = compute(key);
302 private V compute(K key) throws ExecutionException { method in class:CacheBuilder.LocalCache
|
| /frameworks/rs/ |
| rsElement.cpp | 166 void Element::compute() { function in class:Element
245 e->compute();
291 e->compute();
|
| rsType.cpp | 67 void Type::compute() { function in class:Type
281 nt->compute();
|
| /hardware/qcom/display/liboverlay/ |
| overlayUtils.cpp | 223 static inline int compute(const uint32_t& x, const uint32_t& y, function in namespace:overlay::utils
233 srcCrop.x = compute(whf.w, srcCrop.x, srcCrop.w);
236 srcCrop.y = compute(whf.h, srcCrop.y, srcCrop.h);
240 srcCrop.x = compute(whf.h,
|
| /external/clang/utils/TableGen/ |
| ClangDiagnosticsEmitter.cpp | 312 /// Compute the set of diagnostics and groups that are immediately
314 void compute(VecOrSet DiagsInPedantic,
365 // Lazily compute the threshold value for the group count.
392 void InferPedantic::compute(VecOrSet DiagsInPedantic, function in class:InferPedantic
410 // Compute the set of diagnostics that are directly in -Wpedantic. We
436 // Compute the set of groups that are directly in -Wpedantic. We
501 // Compute the set of diagnostics that are in -Wpedantic.
504 inferPedantic.compute(&DiagsInPedantic, (RecordVec*)0);
598 // Compute a mapping from a DiagGroup to all of its parents.
616 inferPedantic.compute(&DiagsInPedantic, &GroupsInPedantic)
[all...] |
| /external/eigen/Eigen/src/Cholesky/ |
| LLT.h | 76 * perform decompositions via LLT::compute(const MatrixType&).
93 compute(matrix);
144 LLT& compute(const MatrixType& matrix);
178 * Used to compute and store L
383 LLT<MatrixType,_UpLo>& LLT<MatrixType,_UpLo>::compute(const MatrixType& a) function in class:Eigen::LLT
|
| /external/eigen/Eigen/src/UmfPackSupport/ |
| UmfPackSupport.h | 15 /* TODO extract L, extract U, compute det, etc... */
144 compute(matrix);
195 void compute(const MatrixType& matrix) function in class:Eigen::UmfPackLU
203 * \sa compute()
216 * \sa compute()
231 * \sa factorize(), compute()
256 * \sa analyzePattern(), compute()
|
| /external/eigen/bench/spbench/ |
| spbenchsolver.h | 133 solver.compute(A);
162 // Compute the relative residual norm
228 cout<< "COMPUTE TIME : " << stat[solver_id].compute_time<< " \n";
248 ostringstream compute,solve,total,error; local
258 compute << markup << stat[i].compute_time;
267 compute << " <TD> -" ;
279 statline = "<TH>Compute Time " + compute.str() + "\n"
|
