Home
last modified time | relevance | path

Searched refs:solver (Results 1 – 25 of 40) sorted by relevance

12

/external/eigen/bench/spbench/
Dspbenchsolver.h214 void call_solver(Solver &solver, const int solver_id, const typename Solver::MatrixType& A, const M… in call_solver() argument
225 solver.compute(A); in call_solver()
226 if (solver.info() != Success) in call_solver()
239 x = solver.solve(b); in call_solver()
240 if (solver.info() == NumericalIssue) in call_solver()
279 void call_directsolver(Solver& solver, const int solver_id, const typename Solver::MatrixType& A, c… in call_directsolver() argument
283 call_solver(solver, solver_id, A, b, refX,statbuf); in call_directsolver()
289 void call_itersolver(Solver &solver, const int solver_id, const typename Solver::MatrixType& A, con… in call_itersolver() argument
291 solver.setTolerance(RelErr); in call_itersolver()
292 solver.setMaxIterations(MaximumIters); in call_itersolver()
[all …]
Dtest_sparseLU.cpp31 SparseLU<SparseMatrix<scalar, ColMajor>, COLAMDOrdering<int> > solver; in main() local
73 solver.analyzePattern(A); in main()
78 solver.factorize(A); in main()
83 x = solver.solve(b); in main()
90 cout << "Number of nonzeros in the factor : " << solver.nnzL() + solver.nnzU() << std::endl; in main()
Dsp_solver.cpp30 …ConjugateGradient<SparseMatrix<double, ColMajor>, Lower,IncompleteCholesky<double,Lower> > solver; in main() local
95 solver.compute(A); in main()
98 if (solver.info() != Success) { in main()
108 x = solver.solve(b); in main()
/external/eigen/test/
Dsparse_solver.h15 void solve_with_guess(IterativeSolverBase<Solver>& solver, const MatrixBase<Rhs>& b, const Guess& g… in solve_with_guess() argument
19 x = solver.derived().solveWithGuess(b,g) + Result::Zero(x.rows(), x.cols()); in solve_with_guess()
24 x = solver.derived().solveWithGuess(b.derived(),g); in solve_with_guess()
29 void solve_with_guess(SparseSolverBase<Solver>& solver, const MatrixBase<Rhs>& b, const Guess& , Re… in solve_with_guess() argument
31 x = solver.derived().solve(b) + Result::Zero(x.rows(), x.cols()); in solve_with_guess()
33 x = solver.derived().solve(b); in solve_with_guess()
37 void solve_with_guess(SparseSolverBase<Solver>& solver, const SparseMatrixBase<Rhs>& b, const Guess… in solve_with_guess() argument
38 x = solver.derived().solve(b); in solve_with_guess()
42 void check_sparse_solving(Solver& solver, const typename Solver::MatrixType& A, const Rhs& b, const… in check_sparse_solving() argument
53 solver.compute(A); in check_sparse_solving()
[all …]
Dsparseqr.cpp52 SparseQR<MatrixType, COLAMDOrdering<int> > solver; in test_sparseqr_scalar() local
56 solver.compute(A); in test_sparseqr_scalar()
58 …solver.factorize(A); // this checks that calling analyzePattern is not needed if the pattern do n… in test_sparseqr_scalar()
59 if (solver.info() != Success) in test_sparseqr_scalar()
65 x = solver.solve(b); in test_sparseqr_scalar()
66 if (solver.info() != Success) in test_sparseqr_scalar()
79 VERIFY_IS_EQUAL(dqr.rank(), solver.rank()); in test_sparseqr_scalar()
80 if(solver.rank()==A.cols()) // full rank in test_sparseqr_scalar()
87 Q = solver.matrixQ(); in test_sparseqr_scalar()
95 dQ = solver.matrixQ(); in test_sparseqr_scalar()
Dspqr_support.cpp37 SPQR<MatrixType> solver; in test_spqr_scalar() local
42 solver.compute(A); in test_spqr_scalar()
43 if (solver.info() != Success) in test_spqr_scalar()
49 x = solver.solve(b); in test_spqr_scalar()
50 if (solver.info() != Success) in test_spqr_scalar()
Dincomplete_cholesky.cpp60 Eigen::IncompleteCholesky<double> > solver( A ); in test_incomplete_cholesky() local
61 VERIFY(solver.preconditioner().info() == Eigen::Success); in test_incomplete_cholesky()
62 VERIFY(solver.info() == Eigen::Success); in test_incomplete_cholesky()
Deigensolver_generic.cpp134 Eigen::EigenSolver<MatrixXd> solver(A); in test_eigensolver_generic()
135 VERIFY_IS_EQUAL(solver.info(), NumericalIssue); in test_eigensolver_generic()
/external/eigen/doc/snippets/
DBiCGSTAB_simple.cpp5 BiCGSTAB<SparseMatrix<double> > solver; variable
6 solver.compute(A);
7 x = solver.solve(b);
8 std::cout << "#iterations: " << solver.iterations() << std::endl;
9 std::cout << "estimated error: " << solver.error() << std::endl;
11 x = solver.solve(b); // solve again
DBiCGSTAB_step_by_step.cpp5 BiCGSTAB<SparseMatrix<double> > solver(A);
8 solver.setMaxIterations(1);
11 x = solver.solveWithGuess(b,x);
12 std::cout << i << " : " << solver.error() << std::endl;
14 } while (solver.info()!=Success && i<100);
/external/dng_sdk/source/
Ddng_tone_curve.cpp121 void dng_tone_curve::Solve (dng_spline_solver &solver) const in Solve()
124 solver.Reset (); in Solve()
129 solver.Add (fCoord [index].h, in Solve()
134 solver.Solve (); in Solve()
Ddng_tone_curve.h57 void Solve (dng_spline_solver &solver) const;
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/
DNonLinearConjugateGradientOptimizer.java54 private UnivariateRealSolver solver; field in NonLinearConjugateGradientOptimizer
71 solver = null; in NonLinearConjugateGradientOptimizer()
91 this.solver = lineSearchSolver; in setLineSearchSolver()
122 if (solver == null) { in doOptimize()
123 solver = new BrentSolver(); in doOptimize()
164 final double step = solver.solve(lsf, 0, findUpperBound(lsf, 0, initialStep)); in doOptimize()
DGaussNewtonOptimizer.java109 DecompositionSolver solver = useLU ? in doOptimize() local
112 final double[] dX = solver.solve(b); in doOptimize()
/external/eigen/doc/
DSparseLinearSystems.dox9 %Eigen currently provides a wide set of built-in solvers, as well as wrappers to external solver li…
86 \section TutorialSparseSolverConcept Sparse solver concept
98 SolverClassName<SparseMatrix<double> > solver;
99 solver.compute(A);
100 if(solver.info()!=Success) {
104 x = solver.solve(b);
105 if(solver.info()!=Success) {
110 x1 = solver.solve(b1);
118 ConjugateGradient<SparseMatrix<double>, Eigen::Upper> solver;
119 x = solver.compute(A).solve(b);
[all …]
/external/v8/benchmarks/
Dnavier-stokes.js33 var solver = null; variable
37 solver.update();
42 solver = new FluidField(null);
43 solver.setResolution(128, 128);
44 solver.setIterations(20);
45 solver.setDisplayFunction(function(){});
46 solver.setUICallback(prepareFrame);
47 solver.reset();
52 solver = null;
/external/eigen/Eigen/src/Eigenvalues/
DSelfAdjointEigenSolver.h626 static inline void run(SolverType& solver, const MatrixType& mat, int options)
634 EigenvectorsType& eivecs = solver.m_eivec;
635 VectorType& eivals = solver.m_eivalues;
704 solver.m_info = Success;
705 solver.m_isInitialized = true;
706 solver.m_eigenvectorsOk = computeEigenvectors;
730 static inline void run(SolverType& solver, const MatrixType& mat, int options)
741 EigenvectorsType& eivecs = solver.m_eivec;
742 VectorType& eivals = solver.m_eivalues;
788 solver.m_info = Success;
[all …]
/external/eigen/unsupported/Eigen/
DPolynomials29 * \brief This module provides a QR based polynomial solver.
44 and a QR based polynomial solver.
49 solver.
98 \section QR polynomial solver class
114 …Therefore the current polynomial solver is guaranteed to provide a correct result only when the co…
126 -# a simple use of the polynomial solver is shown;
127 … the QR algorithm is presented: a polynomial with almost conjugate roots is provided to the solver.
/external/eigen/unsupported/test/
DNonLinearOptimization.cpp292 HybridNonLinearSolver<hybrj_functor> solver(functor); in testHybrj1() local
293 info = solver.hybrj1(x); in testHybrj1()
297 VERIFY_IS_EQUAL(solver.nfev, 11); in testHybrj1()
298 VERIFY_IS_EQUAL(solver.njev, 1); in testHybrj1()
301 VERIFY_IS_APPROX(solver.fvec.blueNorm(), 1.192636e-08); in testHybrj1()
325 HybridNonLinearSolver<hybrj_functor> solver(functor); in testHybrj() local
326 solver.diag.setConstant(n, 1.); in testHybrj()
327 solver.useExternalScaling = true; in testHybrj()
328 info = solver.solve(x); in testHybrj()
332 VERIFY_IS_EQUAL(solver.nfev, 11); in testHybrj()
[all …]
/external/eigen/bench/
Ddense_solvers.cpp16 void compute_norm_equation(Solver &solver, const MatrixType &A) { in compute_norm_equation() argument
18 solver.compute(A.transpose()*A); in compute_norm_equation()
20 solver.compute(A); in compute_norm_equation()
25 void compute(Solver &solver, const MatrixType &A) { in compute() argument
26 solver.compute(A); in compute()
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/
DUnivariateRealSolverUtils.java80 UnivariateRealSolver solver = LazyHolder.FACTORY.newDefaultSolver(); in solve() local
81 solver.setAbsoluteAccuracy(absoluteAccuracy); in solve()
82 return solver.solve(f, x0, x1); in solve()
/external/eigen/bench/btl/data/
Daction_settings.txt9 trisolve_vector ; "{/*1.5 triangular solver - vector (X = inv(L) X)}" ; "size" ; 4:5000
10 trisolve_matrix ; "{/*1.5 triangular solver - matrix (M = inv(L) M)}" ; "size" ; 4:5000
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
DHeuristicBase.h74 HeuristicBase(HeuristicSolverImpl<HImpl> &solver) in HeuristicBase() argument
75 : s(solver), g(s.getGraph()) { } in HeuristicBase()
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/events/
DEventState.java242 final BrentSolver solver = new BrentSolver(convergence); in evaluateStep() local
270 solver.solve(maxIterationCount, f, ta, tb) : in evaluateStep()
271 solver.solve(maxIterationCount, f, tb, ta); in evaluateStep()
/external/eigen/Eigen/
DOrderingMethods37 * SparseLU<MatrixType, COLAMDOrdering<int> > solver;
41 * SparseQR<MatrixType, COLAMDOrdering<int> > solver;

12