| /external/eigen/Eigen/src/PaStiXSupport/ |
| D | PaStiXSupport.h | 246 void factorize(ColSpMatrix& mat);
320 factorize(mat);
359 void PastixBase<Derived>::factorize(ColSpMatrix& mat)
480 void factorize(const MatrixType& matrix)
484 Base::factorize(temp);
584 void factorize(const MatrixType& matrix)
588 Base::factorize(temp);
665 void factorize(const MatrixType& matrix)
669 Base::factorize(temp);
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| D | BasicPreconditioners.h | 61 DiagonalPreconditioner& factorize(const MatType& mat) in factorize() function
80 return factorize(mat); in compute()
138 IdentityPreconditioner& factorize(const MatrixType& ) { return *this; }
|
| D | IterativeSolverBase.h | 83 Derived& factorize(const MatrixType& A) in factorize() function
87 m_preconditioner.factorize(A); in factorize()
|
| D | IncompleteLUT.h | 141 void factorize(const MatrixType& amat);
152 factorize(amat); in compute()
243 void IncompleteLUT<Scalar>::factorize(const _MatrixType& amat) in factorize() function
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| D | SimplicialCholesky.h | 196 void factorize(const MatrixType& a) in factorize() function
363 void factorize(const MatrixType& a)
365 Base::template factorize<false>(a);
458 void factorize(const MatrixType& a)
460 Base::template factorize<true>(a);
553 void factorize(const MatrixType& a)
556 Base::template factorize<true>(a);
558 Base::template factorize<false>(a);
|
| /external/llvm/test/Transforms/InstCombine/ |
| D | distribute.ll | 3 define i32 @factorize(i32 %x, i32 %y) {
4 ; CHECK-LABEL: @factorize(
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| D | IncompleteCholesky.h | 82 void factorize(const MatrixType& amat);
88 factorize(matrix); in compute()
132 void IncompleteCholesky<Scalar,_UpLo, OrderingType>::factorize(const _MatrixType& mat) in factorize() function
|
| /external/eigen/bench/spbench/ |
| D | test_sparseLU.cpp | 78 solver.factorize(A); in main()
|
| D | spbench.dtd | 20 … <!ELEMENT COMPUTE (#PCDATA)> <!-- Time to analyze,to factorize, or to setup the preconditioner-->
|
| /external/eigen/Eigen/src/SuperLUSupport/ |
| D | SuperLUSupport.h | 336 derived().factorize(matrix);
526 void factorize(const MatrixType& matrix);
604 void SuperLU<MatrixType>::factorize(const MatrixType& a)
861 void factorize(const MatrixType& matrix);
920 void SuperILU<MatrixType>::factorize(const MatrixType& a)
|
| /external/eigen/test/ |
| D | sparseqr.cpp | 57 …solver.factorize(A); // this checks that calling analyzePattern is not needed if the pattern do n… in test_sparseqr_scalar()
|
| D | sparse_solver.h | 43 solver.factorize(A); in check_sparse_solving()
|
| /external/eigen/doc/ |
| D | SparseLinearSystems.dox | 92 solver.factorize(A);
97 solver.factorize(A);
102 The compute() method is equivalent to calling both analyzePattern() and factorize().
108 …f solvers precisely, the compute step is further subdivided into analyzePattern() and factorize().
119 In factorize(), the factors of the coefficient matrix are computed. This step should be called each…
|
| /external/eigen/Eigen/src/SparseQR/ |
| D | SparseQR.h | 101 factorize(mat);
104 void factorize(const MatrixType& mat);
323 void SparseQR<MatrixType,OrderingType>::factorize(const MatrixType& mat)
|
| /external/eigen/Eigen/src/SparseLU/ |
| D | SparseLU.h | 105 void factorize (const MatrixType& matrix);
117 factorize(matrix); in compute()
498 void SparseLU<MatrixType, OrderingType>::factorize(const MatrixType& matrix) in factorize() function
|
| /external/eigen/Eigen/src/CholmodSupport/ |
| D | CholmodSupport.h | 215 factorize(matrix); in compute()
275 void factorize(const MatrixType& matrix) in factorize() function
|
| /external/eigen/unsupported/Eigen/src/FFT/ |
| D | ei_kissfft_impl.h | 39 void factorize(int nfft) in factorize() function
395 pd.factorize(nfft); in get_plan()
|
| /external/parameter-framework/upstream/tools/xmlGenerator/ |
| D | README.md | 127 A component can be used to factorize parameter names in configurations.
161 - factorize the rules, taking 3 minute to write a Karnaugh map is worth it.
|
| /external/eigen/Eigen/src/PardisoSupport/ |
| D | PardisoSupport.h | 165 Derived& factorize(const MatrixType& matrix);
331 Derived& PardisoImpl<Derived>::factorize(const MatrixType& a)
|
| /external/ceres-solver/internal/ceres/ |
| D | sparse_normal_cholesky_solver.cc | 198 simplicial_ldlt_->factorize(AtA); in SolveImplUsingEigen()
|
| D | schur_complement_solver.cc | 497 simplicial_ldlt_->factorize(eigen_lhs); in SolveReducedLinearSystemUsingEigen()
|
| /external/eigen/Eigen/src/UmfPackSupport/ |
| D | UmfPackSupport.h | 265 void factorize(const InputMatrixType& matrix)
|
| /external/ceres-solver/docs/source/ |
| D | solving.rst | 1295 it can be useful to factorize the sparse jacobian at each solver
|
| /external/valgrind/ |
| D | NEWS | 1863 278892 gdbsrv: factorize gdb version handling, fix doc and typos
|
| /external/libxml2/ |
| D | ChangeLog | 9645 error handling, factorize error processing
|