| /external/eigen/test/ |
| sparse_solver.h | 14 template<typename Solver, typename Rhs, typename Guess,typename Result>
15 void solve_with_guess(IterativeSolverBase<Solver>& solver, const MatrixBase<Rhs>& b, const Guess& g, Result &x) {
19 x = solver.derived().solveWithGuess(b,g) + Result::Zero(x.rows(), x.cols());
24 x = solver.derived().solveWithGuess(b.derived(),g);
28 template<typename Solver, typename Rhs, typename Guess,typename Result>
29 void solve_with_guess(SparseSolverBase<Solver>& solver, const MatrixBase<Rhs>& b, const Guess& , Result& x) {
31 x = solver.derived().solve(b) + Result::Zero(x.rows(), x.cols());
33 x = solver.derived().solve(b)
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 179 SolverT *Solver;
347 Graph() : Solver(nullptr) {}
351 : Metadata(std::move(Metadata)), Solver(nullptr) {}
359 /// @brief Lock this graph to the given solver instance in preparation
360 /// for running the solver. This method will call solver.handleAddNode for
362 /// solver an opportunity to set up any requried metadata.
364 assert(!Solver && "Solver already set. Call unsetSolver().");
365 Solver = &S
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 164 SolverT *Solver;
328 Graph() : Solver(nullptr) {}
332 : Metadata(std::move(Metadata)), Solver(nullptr) {}
340 /// @brief Lock this graph to the given solver instance in preparation
341 /// for running the solver. This method will call solver.handleAddNode for
343 /// solver an opportunity to set up any requried metadata.
345 assert(!Solver && "Solver already set. Call unsetSolver().");
346 Solver = &S
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 164 SolverT *Solver;
328 Graph() : Solver(nullptr) {}
332 : Metadata(std::move(Metadata)), Solver(nullptr) {}
340 /// @brief Lock this graph to the given solver instance in preparation
341 /// for running the solver. This method will call solver.handleAddNode for
343 /// solver an opportunity to set up any requried metadata.
345 assert(!Solver && "Solver already set. Call unsetSolver().");
346 Solver = &S
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/CodeGen/PBQP/ |
| Graph.h | 165 SolverT *Solver = nullptr;
353 /// @brief Lock this graph to the given solver instance in preparation
354 /// for running the solver. This method will call solver.handleAddNode for
356 /// solver an opportunity to set up any requried metadata.
358 assert(!Solver && "Solver already set. Call unsetSolver().");
359 Solver = &S;
361 Solver->handleAddNode(NId);
363 Solver->handleAddEdge(EId)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/CodeGen/PBQP/ |
| Graph.h | 165 SolverT *Solver = nullptr;
353 /// @brief Lock this graph to the given solver instance in preparation
354 /// for running the solver. This method will call solver.handleAddNode for
356 /// solver an opportunity to set up any requried metadata.
358 assert(!Solver && "Solver already set. Call unsetSolver().");
359 Solver = &S;
361 Solver->handleAddNode(NId);
363 Solver->handleAddEdge(EId)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/CodeGen/PBQP/ |
| Graph.h | 165 SolverT *Solver = nullptr;
353 /// @brief Lock this graph to the given solver instance in preparation
354 /// for running the solver. This method will call solver.handleAddNode for
356 /// solver an opportunity to set up any requried metadata.
358 assert(!Solver && "Solver already set. Call unsetSolver().");
359 Solver = &S;
361 Solver->handleAddNode(NId);
363 Solver->handleAddEdge(EId)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/CodeGen/PBQP/ |
| Graph.h | 165 SolverT *Solver = nullptr;
353 /// @brief Lock this graph to the given solver instance in preparation
354 /// for running the solver. This method will call solver.handleAddNode for
356 /// solver an opportunity to set up any requried metadata.
358 assert(!Solver && "Solver already set. Call unsetSolver().");
359 Solver = &S;
361 Solver->handleAddNode(NId);
363 Solver->handleAddEdge(EId)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/CodeGen/PBQP/ |
| Graph.h | 165 SolverT *Solver = nullptr;
353 /// @brief Lock this graph to the given solver instance in preparation
354 /// for running the solver. This method will call solver.handleAddNode for
356 /// solver an opportunity to set up any requried metadata.
358 assert(!Solver && "Solver already set. Call unsetSolver().");
359 Solver = &S;
361 Solver->handleAddNode(NId);
363 Solver->handleAddEdge(EId)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/CodeGen/PBQP/ |
| Graph.h | 165 SolverT *Solver = nullptr;
353 /// @brief Lock this graph to the given solver instance in preparation
354 /// for running the solver. This method will call solver.handleAddNode for
356 /// solver an opportunity to set up any requried metadata.
358 assert(!Solver && "Solver already set. Call unsetSolver().");
359 Solver = &S;
361 Solver->handleAddNode(NId);
363 Solver->handleAddEdge(EId)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/CodeGen/PBQP/ |
| Graph.h | 165 SolverT *Solver = nullptr;
353 /// @brief Lock this graph to the given solver instance in preparation
354 /// for running the solver. This method will call solver.handleAddNode for
356 /// solver an opportunity to set up any requried metadata.
358 assert(!Solver && "Solver already set. Call unsetSolver().");
359 Solver = &S;
361 Solver->handleAddNode(NId);
363 Solver->handleAddEdge(EId)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/CodeGen/PBQP/ |
| Graph.h | 165 SolverT *Solver = nullptr;
353 /// @brief Lock this graph to the given solver instance in preparation
354 /// for running the solver. This method will call solver.handleAddNode for
356 /// solver an opportunity to set up any requried metadata.
358 assert(!Solver && "Solver already set. Call unsetSolver().");
359 Solver = &S;
361 Solver->handleAddNode(NId);
363 Solver->handleAddEdge(EId)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/CodeGen/PBQP/ |
| Graph.h | 165 SolverT *Solver = nullptr;
353 /// @brief Lock this graph to the given solver instance in preparation
354 /// for running the solver. This method will call solver.handleAddNode for
356 /// solver an opportunity to set up any requried metadata.
358 assert(!Solver && "Solver already set. Call unsetSolver().");
359 Solver = &S;
361 Solver->handleAddNode(NId);
363 Solver->handleAddEdge(EId)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/PBQP/ |
| Graph.h | 165 SolverT *Solver = nullptr;
353 /// @brief Lock this graph to the given solver instance in preparation
354 /// for running the solver. This method will call solver.handleAddNode for
356 /// solver an opportunity to set up any requried metadata.
358 assert(!Solver && "Solver already set. Call unsetSolver().");
359 Solver = &S;
361 Solver->handleAddNode(NId);
363 Solver->handleAddEdge(EId)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/PBQP/ |
| Graph.h | 165 SolverT *Solver = nullptr;
353 /// @brief Lock this graph to the given solver instance in preparation
354 /// for running the solver. This method will call solver.handleAddNode for
356 /// solver an opportunity to set up any requried metadata.
358 assert(!Solver && "Solver already set. Call unsetSolver().");
359 Solver = &S;
361 Solver->handleAddNode(NId);
363 Solver->handleAddEdge(EId)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/PBQP/ |
| Graph.h | 165 SolverT *Solver = nullptr;
353 /// @brief Lock this graph to the given solver instance in preparation
354 /// for running the solver. This method will call solver.handleAddNode for
356 /// solver an opportunity to set up any requried metadata.
358 assert(!Solver && "Solver already set. Call unsetSolver().");
359 Solver = &S;
361 Solver->handleAddNode(NId);
363 Solver->handleAddEdge(EId)
[all...] |
| /external/eigen/bench/spbench/ |
| spbenchsolver.h | 83 int best_time_id; // id of the best solver for the current system
107 out <<" <SOLVER ID='" << EIGEN_UMFPACK << "'>\n";
110 out << " </SOLVER> \n";
113 out <<" <SOLVER ID='" << EIGEN_SUPERLU << "'>\n";
116 out << " </SOLVER> \n";
119 out <<" <SOLVER ID='" << EIGEN_CHOLMOD_SIMPLICIAL_LLT << "'>\n";
122 out << " </SOLVER> \n";
124 out <<" <SOLVER ID='" << EIGEN_CHOLMOD_SUPERNODAL_LLT << "'>\n";
127 out << " </SOLVER> \n";
129 out <<" <SOLVER ID='" << EIGEN_CHOLMOD_LDLT << "'>\n";
315 UmfPackLU<SpMat> solver; local
323 SuperLU<SpMat> solver; local
332 PastixLU<SpMat> solver; local
341 PardisoLU<SpMat> solver; local
348 SparseLU<SpMat, COLAMDOrdering<int> > solver; local
354 SparseLU<SpMat, MetisOrdering<int> > solver; local
362 BiCGSTAB<SpMat> solver; local
368 BiCGSTAB<SpMat, IncompleteLUT<Scalar> > solver; local
382 GMRES<SpMat, IncompleteLUT<Scalar> > solver; local
392 SimplicialLDLT<SpMat, Lower> solver; local
400 CholmodDecomposition<SpMat, Lower> solver; local
410 PastixLDLT<SpMat, Lower> solver; local
419 PardisoLDLT<SpMat, Lower> solver; local
432 SimplicialLLT<SpMat, Lower> solver; local
441 CholmodDecomposition<SpMat, Lower> solver; local
455 PastixLLT<SpMat, Lower> solver; local
464 PardisoLLT<SpMat, Lower> solver; local
472 ConjugateGradient<SpMat, Lower> solver; local
[all...] |
| /external/eigen/bench/ |
| dense_solvers.cpp | 14 template<typename Solver,typename MatrixType>
16 void compute_norm_equation(Solver &solver, const MatrixType &A) {
18 solver.compute(A.transpose()*A);
20 solver.compute(A);
23 template<typename Solver,typename MatrixType>
25 void compute(Solver &solver, const MatrixType &A) {
26 solver.compute(A);
122 cout << "solver/size"
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| SCCP.cpp | 156 /// SCCPSolver - This class is a general purpose solver for Sparse Conditional
240 /// AddTrackedFunction - If the SCCP solver is supposed to track calls into
265 /// method should be use to handle this. If this returns true, the solver
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| CholeskyDecompositionImpl.java | 187 return new Solver(lTData);
190 /** Specialized solver. */
191 private static class Solver implements DecompositionSolver {
197 * Build a solver from decomposed matrix.
200 private Solver(final double[][] lTData) {
|
| SingularValueDecompositionImpl.java | 268 return new Solver(singularValues, getUT(), getV(), getRank() == Math
272 /** Specialized solver. */
273 private static class Solver implements DecompositionSolver {
282 * Build a solver from decomposed matrix.
292 private Solver(final double[] singularValues, final RealMatrix uT,
|
| LUDecompositionImpl.java | 228 return new Solver(lu, pivot, singular);
231 /** Specialized solver. */
232 private static class Solver implements DecompositionSolver {
244 * Build a solver from decomposed matrix.
249 private Solver(final double[][] lu, final int[] pivot, final boolean singular) {
|
| QRDecompositionImpl.java | 248 return new Solver(qrt, rDiag);
251 /** Specialized solver. */
252 private static class Solver implements DecompositionSolver {
266 * Build a solver from decomposed matrix.
270 private Solver(final double[][] qrt, final double[] rDiag) {
|
| EigenDecompositionImpl.java | 240 return new Solver(realEigenvalues, imagEigenvalues, eigenvectors);
243 /** Specialized solver. */
244 private static class Solver implements DecompositionSolver {
256 * Build a solver from decomposed matrix.
264 private Solver(final double[] realEigenvalues,
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| SCCP.cpp | 154 /// SCCPSolver - This class is a general purpose solver for Sparse Conditional
239 /// AddTrackedFunction - If the SCCP solver is supposed to track calls into
264 /// method should be use to handle this. If this returns true, the solver
[all...] |
