| /external/ceres-solver/ |
| README.google | 1 URL: https://ceres-solver.googlesource.com/ceres-solver/+archive/cfb36463f9c1f806121779d651c7105ad899bb20.tar.gz
7 Ceres (http://ceres-solver.googlecode.com) is a portable non-linear
8 least squares solver, developed at Google. It is now open-source.
10 Website : https://code.google.com/p/ceres-solver/
11 Code : https://ceres-solver.googlesource.com/ceres-solver/
|
| import_ceres_upstream.sh | 18 declare -r temp_repo="/tmp/ceres-solver"
21 https://ceres-solver.googlesource.com/ceres-solver \
42 echo "URL: https://ceres-solver.googlesource.com/ceres-solver/+archive/$commit.tar.gz" >> $temp_readme
|
| patch_from_client.sh | 18 declare -r temp_repo="/tmp/ceres-solver"
20 /usr/local/google/home/sameeragarwal/ceres-solver -b testing\
41 echo "URL: https://ceres-solver.googlesource.com/ceres-solver/+/$commit" >> $temp_readme
|
| README | 1 Ceres Solver - A non-linear least squares minimizer
|
| /external/eigen/test/ |
| sparse_solver.h | 13 template<typename Solver, typename Rhs, typename DenseMat, typename DenseRhs>
14 void check_sparse_solving(Solver& solver, const typename Solver::MatrixType& A, const Rhs& b, const DenseMat& dA, const DenseRhs& db)
16 typedef typename Solver::MatrixType Mat;
24 solver.compute(A);
25 if (solver.info() != Success)
27 std::cerr << "sparse solver testing: factorization failed (check_sparse_solving)\n";
31 x = solver.solve(b);
32 if (solver.info() != Success
[all...] |
| spqr_support.cpp | 35 SPQR<MatrixType> solver; local
40 solver.compute(A);
41 if (solver.info() != Success)
47 x = solver.solve(b);
48 if (solver.info() != Success)
54 //Compare with a dense solver
|
| sparseqr.cpp | 51 SparseQR<MatrixType, COLAMDOrdering<int> > solver; local
55 solver.compute(A);
57 solver.factorize(A); // this checks that calling analyzePattern is not needed if the pattern do not change.
58 if (solver.info() != Success)
64 x = solver.solve(b);
65 if (solver.info() != Success)
74 //Compare with a dense QR solver
78 VERIFY_IS_EQUAL(dqr.rank(), solver.rank());
79 if(solver.rank()==A.cols()) // full rank
86 Q = solver.matrixQ()
[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...] |
| test_sparseLU.cpp | 26 // SparseLU<SparseMatrix<scalar, ColMajor>, AMDOrdering<int> > solver;
28 // SparseLU<SparseMatrix<scalar, ColMajor>, MetisOrdering<int> > solver;
31 SparseLU<SparseMatrix<scalar, ColMajor>, COLAMDOrdering<int> > solver; local
70 // solver.isSymmetric(true);
72 // solver.compute(A);
73 solver.analyzePattern(A);
78 solver.factorize(A);
83 x = solver.solve(b);
90 cout << "Number of nonzeros in the factor : " << solver.nnzL() + solver.nnzU() << std::endl;
[all...] |
| sp_solver.cpp | 28 //SparseLU<SparseMatrix<double, ColMajor> > solver;
29 // SuperLU<SparseMatrix<double, ColMajor> > solver;
30 ConjugateGradient<SparseMatrix<double, ColMajor>, Lower,IncompleteCholesky<double,Lower> > solver; local
35 // solver.iparm(IPARM_THREAD_NBR) = 4;
74 // solver.set_restart(374);
95 solver.compute(A);
96 // solver.analyzePattern(A);
97 // solver.factorize(A);
98 if (solver.info() != Success) {
99 std::cout<< "The solver failed \n"
[all...] |
| spbench.dtd | 2 <!ELEMENT AVAILSOLVER (SOLVER+)>
3 <!ELEMENT SOLVER (TYPE,PACKAGE)>
25 <!ELEMENT BEST_SOLVER CDATA> <!-- Id of the best solver -->
28 <!ATTLIST SOLVER ID CDATA #REQUIRED>
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/ |
| UnivariateRealSolverFactory.java | 28 * Concrete factories extending this class also specify a default solver, instances of which
34 * // create a Brent solver to use
35 * BrentSolver solver = factory.newBrentSolver();
57 * actual solver returned is determined by the underlying factory.
58 * @return the new solver.
64 * solver is an implementation of the bisection method.
65 * @return the new solver.
71 * solver is an implementation of the Brent method.
72 * @return the new solver.
78 * solver is an implementation of Newton's Method
[all...] |
| UnivariateRealSolver.java | 45 * the solver or is otherwise deemed unreasonable.
57 * The default value is provided by the solver implementation.
63 * <p>A solver may require that the interval brackets a single zero root.
71 * or the solver detects convergence problems otherwise.
74 * satisfy the requirements specified by the solver
83 * <p>A solver may require that the interval brackets a single zero root.
92 * or the solver detects convergence problems otherwise.
95 * satisfy the requirements specified by the solver
105 * <p>A solver may require that the interval brackets a single zero root.
114 * or the solver detects convergence problems otherwise
[all...] |
| /external/ceres-solver/internal/ceres/ |
| solver_test.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
31 #include "ceres/solver.h"
47 Solver::Options options;
54 Solver::Options options;
85 TEST(Solver, UpdateStateEveryIterationOption) {
95 Solver::Options options;
101 Solver::Summary summary;
162 TEST(Solver, TrustRegionProblemHasNoParameterBlocks) {
164 Solver::Options options
[all...] |
| solver_impl.h | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
40 #include "ceres/solver.h"
53 // Mirrors the interface in solver.h, but exposes implementation
55 static void Solve(const Solver::Options& options,
57 Solver::Summary* summary);
59 static void TrustRegionSolve(const Solver::Options& options,
61 Solver::Summary* summary);
65 const Solver::Options &options,
70 Solver::Summary* summary)
[all...] |
| summary_utils.h | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
35 #include "ceres/solver.h"
42 void SummarizeGivenProgram(const Program& program, Solver::Summary* summary);
43 void SummarizeReducedProgram(const Program& program, Solver::Summary* summary);
44 void SetSummaryFinalCost(Solver::Summary* summary);
|
| solver.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
33 #include "ceres/solver.h"
54 ss << string("Solver::Options::" #x " = ") << options.x << ". "; \
56 ss << string("Solver::Options::" #x " " #OP " "#y); \
65 ss << string("Solver::Options::" #x " = ") << options.x << ". "; \
66 ss << string("Solver::Options::" #y " = ") << options.y << ". "; \
68 ss << string("Solver::Options::" #x ); \
69 ss << string(#OP " Solver::Options::" #y "."); \
81 bool CommonOptionsAreValid(const Solver::Options& options, string* error)
334 Solver solver; local
[all...] |
| summary_utils.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
34 #include "ceres/solver.h"
39 void SetSummaryFinalCost(Solver::Summary* summary) {
49 void SummarizeGivenProgram(const Program& program, Solver::Summary* summary) {
57 void SummarizeReducedProgram(const Program& program, Solver::Summary* summary) {
|
| linear_solver.h | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
57 // Solver ran for max_num_iterations and terminated before the
61 // Solver was terminated due to numerical problems, generally due to
65 // Solver failed with a fatal error that cannot be recovered from,
117 // See solver.h for information about this flag.
121 // Number of internal iterations that the solver uses. This
126 // If possible, how many threads can the solver use.
130 // eliminated by the linear solver.
133 // the linear solver is informed that it should eliminate th
[all...] |
| minimizer_test.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
34 #include "ceres/solver.h"
51 Solver::Options solver_options;
72 Solver::Options solver_options;
75 Solver::Summary summary;
90 Solver::Options solver_options;
93 Solver::Summary summary;
|
| /external/ceres-solver/docs/source/ |
| index.rst | 1 .. Ceres Solver documentation master file, created by
7 Ceres Solver
26 Ceres Solver is an open source C++ library for modeling and solving
29 since 2010. At Google, Ceres Solver is used to:
57 <http://ceres-solver.org/ceres-solver-1.9.0.tar.gz>`_ or clone the
62 git clone https://ceres-solver.googlesource.com/ceres-solver
67 <https://groups.google.com/forum/?fromgroups#!forum/ceres-solver>`_
70 <https://code.google.com/p/ceres-solver/issues/list>`_
[all...] |
| history.rst | 7 Ceres Solver grew out of the need for general least squares solving at
9 started the development of Ceres Solver. Fredrik left Google shortly
11 years of on-and-off development, Ceres Solver was released as open
26 named our solver after Ceres to celebrate this seminal event in the
|
| /external/ceres-solver/examples/ |
| helloworld.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
42 using ceres::Solver;
60 // mutated in place by the solver.
73 // Run the solver!
74 Solver::Options options;
76 Solver::Summary summary;
|
| helloworld_analytic_diff.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
42 using ceres::Solver;
85 // mutated in place by the solver.
96 // Run the solver!
97 Solver::Options options;
99 Solver::Summary summary;
|
| helloworld_numeric_diff.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
41 using ceres::Solver;
56 // mutated in place by the solver.
69 // Run the solver!
70 Solver::Options options;
72 Solver::Summary summary;
|
