| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| H A D | BasicPreconditioners.h | 65 DiagonalPreconditioner& factorize(const MatType& mat) function in class:Eigen::DiagonalPreconditioner
84 return factorize(mat);
151 LeastSquareDiagonalPreconditioner& factorize(const MatType& mat) function in class:Eigen::LeastSquareDiagonalPreconditioner
185 return factorize(mat);
213 IdentityPreconditioner& factorize(const MatrixType& ) { return *this; } function in class:Eigen::IdentityPreconditioner
|
| H A D | IterativeSolverBase.h | 209 * Currently, this function mostly calls factorize on the preconditioner.
217 Derived& factorize(const EigenBase<MatrixDerived>& A) function in class:Eigen::IterativeSolverBase
221 m_preconditioner.factorize(matrix());
|
| H A D | IncompleteCholesky.h | 75 * You must call compute() or the pair analyzePattern()/factorize() to make it valid.
138 void factorize(const MatrixType& mat);
142 * It is a shortcut for a sequential call to the analyzePattern() and factorize() methods.
144 * \sa analyzePattern(), factorize()
150 factorize(mat);
157 eigen_assert(m_factorizationIsOk && "factorize() should be called first");
196 void IncompleteCholesky<Scalar,_UpLo, OrderingType>::factorize(const _MatrixType& mat) function in class:Eigen::IncompleteCholesky
|
| H A D | IncompleteLUT.h | 152 void factorize(const MatrixType& amat);
163 factorize(amat);
253 void IncompleteLUT<Scalar,StorageIndex>::factorize(const _MatrixType& amat) function in class:Eigen::IncompleteLUT
|
| /external/eigen/Eigen/src/PaStiXSupport/ |
| H A D | PaStiXSupport.h | 167 * \sa analyzePattern() factorize()
185 * \sa analyzePattern() factorize()
227 void factorize(ColSpMatrix& mat);
300 factorize(mat);
338 void PastixBase<Derived>::factorize(ColSpMatrix& mat) function in class:Eigen::PastixBase
434 * \sa analyzePattern() factorize()
446 * \sa factorize()
461 void factorize(const MatrixType& matrix) function in class:Eigen::PastixLU
465 Base::factorize(temp);
545 * \sa analyzePattern() factorize()
567 void factorize(const MatrixType& matrix) function in class:Eigen::PastixLLT
651 void factorize(const MatrixType& matrix) function in class:Eigen::PastixLDLT
[all...] |
| /external/eigen/Eigen/src/SparseCholesky/ |
| H A D | SimplicialCholesky.h | 206 void factorize(const MatrixType& a) function in class:Eigen::SimplicialCholeskyBase
374 * \sa factorize()
387 void factorize(const MatrixType& a) function in class:Eigen::SimplicialLLT
389 Base::template factorize<false>(a);
471 * \sa factorize()
484 void factorize(const MatrixType& a) function in class:Eigen::SimplicialLDLT
486 Base::template factorize<true>(a);
566 * \sa factorize()
579 void factorize(const MatrixType& a) function in class:Eigen::SimplicialCholesky
582 Base::template factorize<tru
[all...] |
| /external/eigen/bench/spbench/ |
| H A D | test_sparseLU.cpp | 78 solver.factorize(A);
|
| /external/eigen/test/ |
| H A D | sparseqr.cpp | 58 solver.factorize(A); // this checks that calling analyzePattern is not needed if the pattern do not change.
|
| H A D | sparse_solver.h | 70 VERIFY(solver.info() == Success && "solving failed when using analyzePattern/factorize API");
75 // test the analyze/factorize API
77 solver.factorize(A);
78 VERIFY(solver.info() == Success && "factorization failed when using analyzePattern/factorize API");
80 VERIFY(solver.info() == Success && "solving failed when using analyzePattern/factorize API");
|
| /external/eigen/Eigen/src/SuperLUSupport/ |
| H A D | SuperLUSupport.h | 368 derived().factorize(matrix);
375 * \sa factorize()
522 * \sa factorize()
537 void factorize(const MatrixType& matrix);
613 void SuperLU<MatrixType>::factorize(const MatrixType& a) function in class:Eigen::SuperLU
651 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or analyzePattern()/factorize()");
709 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for extracting factors, you must first call either compute() or analyzePattern()/factorize()");
795 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for computing the determinant, you must first call either compute() or analyzePattern()/factorize()");
869 * \sa factorize()
882 void factorize(cons
941 void SuperILU<MatrixType>::factorize(const MatrixType& a) function in class:Eigen::SuperILU
[all...] |
| /external/eigen/Eigen/src/SparseLU/ |
| H A D | SparseLU.h | 52 * solver.factorize(A);
117 void factorize (const MatrixType& matrix);
129 factorize(matrix);
496 void SparseLU<MatrixType, OrderingType>::factorize(const MatrixType& matrix) function in class:Eigen::SparseLU
|
| /external/eigen/Eigen/src/CholmodSupport/ |
| H A D | CholmodSupport.h | 235 factorize(matrix);
243 * \sa factorize()
267 void factorize(const MatrixType& matrix) function in class:Eigen::CholmodBase
|
| /external/eigen/Eigen/src/PardisoSupport/ |
| H A D | PardisoSupport.h | 164 * \sa factorize()
174 Derived& factorize(const MatrixType& matrix);
302 Derived& PardisoImpl<Derived>::factorize(const MatrixType& a)
|
| /external/eigen/unsupported/Eigen/src/FFT/ |
| H A D | ei_kissfft_impl.h | 39 void factorize(int nfft) function in struct:Eigen::internal::kiss_cpx_fft
395 pd.factorize(nfft);
|
| /external/eigen/Eigen/src/SparseQR/ |
| H A D | SparseQR.h | 112 * \sa analyzePattern(), factorize()
117 factorize(mat);
120 void factorize(const MatrixType& mat);
348 void SparseQR<MatrixType,OrderingType>::factorize(const MatrixType& mat) function in class:Eigen::SparseQR
|
| /external/eigen/Eigen/src/UmfPackSupport/ |
| H A D | UmfPackSupport.h | 255 * \sa factorize(), compute()
271 * \sa factorize(), compute()
275 eigen_assert(m_numeric && "UmfPackLU: you must first call factorize()");
308 void factorize(const InputMatrixType& matrix) function in class:Eigen::UmfPackLU
|