Home
last modified time | relevance | path

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

1234

/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()
/external/tensorflow/tensorflow/core/kernels/linalg/
Dmatrix_inverse_op.cc128 std::unique_ptr<CudaSolver> solver(new CudaSolver(context)); in ComputeAsync() local
135 solver->allocate_scoped_tensor(DataTypeToEnum<Scalar>::value, in ComputeAsync()
154 solver->allocate_scoped_tensor(DataTypeToEnum<int>::value, in ComputeAsync()
158 auto input_copy_ptr_array = solver->GetScratchSpace<uint8>( in ComputeAsync()
161 auto output_ptr_array = solver->GetScratchSpace<uint8>( in ComputeAsync()
184 solver->GetDeviceLapackInfo(batch_size, "MatInvBatched")); in ComputeAsync()
187 solver->MatInvBatched(n, input_copy_ptr_array_base, n, in ComputeAsync()
196 solver->GetDeviceLapackInfo(batch_size, "GetrfBatched")); in ComputeAsync()
198 solver->GetrfBatched(n, input_copy_ptr_array_base, in ComputeAsync()
204 solver->GetDeviceLapackInfo(batch_size, "GetriBatched")); in ComputeAsync()
[all …]
Dmatrix_solve_op.cc171 std::unique_ptr<CudaSolver> solver(new CudaSolver(context)); in ComputeAsync() local
182 solver->allocate_scoped_tensor(DataTypeToEnum<Scalar>::value, in ComputeAsync()
190 solver->forward_input_or_allocate_scoped_tensor( in ComputeAsync()
206 solver->allocate_scoped_tensor(DataTypeToEnum<int>::value, in ComputeAsync()
214 auto input_copy_ptrs = solver->GetScratchSpace<uint8>( in ComputeAsync()
229 solver->GetDeviceLapackInfo(batch_size, "getrfBatched")); in ComputeAsync()
232 solver->GetrfBatched(n, input_copy_ptrs_base, n, pivots_mat.data(), in ComputeAsync()
238 dev_info.push_back(solver->GetDeviceLapackInfo(batch_size, "getrf")); in ComputeAsync()
242 solver->Getrf(n, n, &input_copy_reshaped(batch, 0, 0), n, in ComputeAsync()
258 solver->allocate_scoped_tensor(DataTypeToEnum<Scalar>::value, in ComputeAsync()
[all …]
Ddeterminant_op.cc168 std::unique_ptr<CudaSolver> solver(new CudaSolver(context)); in ComputeAsync() local
175 solver->forward_input_or_allocate_scoped_tensor( in ComputeAsync()
189 solver->allocate_scoped_tensor(DataTypeToEnum<int>::value, in ComputeAsync()
197 auto input_copy_ptrs = solver->GetScratchSpace<uint8>( in ComputeAsync()
213 solver->GetDeviceLapackInfo(batch_size, "getrfBatched")); in ComputeAsync()
216 solver->GetrfBatched(n, input_copy_ptrs_base, n, pivots_mat.data(), in ComputeAsync()
222 dev_info.push_back(solver->GetDeviceLapackInfo(batch_size, "getrf")); in ComputeAsync()
226 solver->Getrf(n, n, &input_copy_reshaped(batch, 0, 0), n, in ComputeAsync()
262 CudaSolver::CheckLapackInfoAndDeleteSolverAsync(std::move(solver), dev_info, in ComputeAsync()
313 std::unique_ptr<CudaSolver> solver(new CudaSolver(context)); in ComputeAsync() local
[all …]
Dsvd_op_gpu.cu.cc100 std::unique_ptr<CudaSolver> solver) { in RunSVD() argument
152 context, solver->allocate_scoped_tensor(U->dtype(), u_shape, &u_copy), in RunSVD()
157 solver->allocate_scoped_tensor(V->dtype(), v_shape, &v_copy), done); in RunSVD()
169 dev_info.push_back(solver->GetDeviceLapackInfo(batch_size, "gesvd")); in RunSVD()
177 solver->allocate_scoped_tensor( in RunSVD()
191 solver->GesvdjBatched(jobz, m, n, input_ptr, m, outputS_ptr, in RunSVD()
220 solver->Gesvd(jobu, jobvt, m, n, input, m, outputS, outputU, m, in RunSVD()
265 CheckResult(context, std::move(done), dev_info, std::move(solver)); in RunSVD()
270 std::unique_ptr<CudaSolver> solver) { in CheckResult() argument
282 CudaSolver::CheckLapackInfoAndDeleteSolverAsync(std::move(solver), dev_info, in CheckResult()
[all …]
Dqr_op_impl.h174 std::unique_ptr<CudaSolver> solver(new CudaSolver(context)); in ComputeAsync()
184 solver->allocate_scoped_tensor(DataTypeToEnum<Scalar>::value, in ComputeAsync()
190 solver->allocate_scoped_tensor( in ComputeAsync()
203 dev_info.push_back(solver->GetDeviceLapackInfo(batch_size, "geqrf")); in ComputeAsync()
211 solver->Geqrf(m, n, &input_transposed_reshaped(batch, 0, 0), m, in ComputeAsync()
230 solver->Geam(CUBLAS_OP_T, CUBLAS_OP_N, n, in ComputeAsync()
260 solver->Unmqr(CUBLAS_SIDE_LEFT, CublasAdjointOp<Scalar>(), m, m, in ComputeAsync()
274 dev_info.push_back(solver->GetDeviceLapackInfo(batch_size, "orgqr")); in ComputeAsync()
278 solver->Ungqr( in ComputeAsync()
288 CudaSolver::CheckLapackInfoAndDeleteSolverAsync(std::move(solver), dev_info, in ComputeAsync()
Dcholesky_op.cc124 std::unique_ptr<CudaSolver> solver(new CudaSolver(context)); in ComputeAsync() local
156 auto output_reshaped_ptrs = solver->GetScratchSpace<uint8>( in ComputeAsync()
165 solver->GetDeviceLapackInfo(batch_size, "potrfBatched")); in ComputeAsync()
167 solver->PotrfBatched(CUBLAS_FILL_MODE_UPPER, n, in ComputeAsync()
184 dev_info.push_back(solver->GetDeviceLapackInfo(batch_size, "potrf")); in ComputeAsync()
187 solver->Potrf(CUBLAS_FILL_MODE_UPPER, n, in ComputeAsync()
205 CudaSolver::CheckLapackInfoAndDeleteSolverAsync(std::move(solver), dev_info, in ComputeAsync()
Dlu_op_gpu.cu.cc111 auto solver = absl::make_unique<CudaSolver>(context); in ComputeAsync() local
164 solver->allocate_scoped_tensor( in ComputeAsync()
182 auto packed_triangular_factors_ptrs = solver->GetScratchSpace<uint8>( in ComputeAsync()
193 solver->GetDeviceLapackInfo(batch_size, "getrfBatched")); in ComputeAsync()
196 solver->GetrfBatched(num_rows, packed_triangular_factors_ptrs_base, in ComputeAsync()
203 dev_info.push_back(solver->GetDeviceLapackInfo(batch_size, "getrf")); in ComputeAsync()
207 solver->Getrf( in ComputeAsync()
254 CudaSolver::CheckLapackInfoAndDeleteSolverAsync(std::move(solver), dev_info, in ComputeAsync()
Dself_adjoint_eig_v2_op_gpu.cc85 std::unique_ptr<CudaSolver> solver(new CudaSolver(context)); in ComputeAsync() local
93 solver->allocate_scoped_tensor(DataTypeToEnum<RealScalar>::value, in ComputeAsync()
101 solver->forward_input_or_allocate_scoped_tensor( in ComputeAsync()
126 dev_info.push_back(solver->GetDeviceLapackInfo(batch_size, "heevd")); in ComputeAsync()
133 solver->Heevd(compute_v_ ? CUSOLVER_EIG_MODE_VECTOR in ComputeAsync()
156 CudaSolver::CheckLapackInfoAndDeleteSolverAsync(std::move(solver), dev_info, in ComputeAsync()
/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/libaom/libaom/aom_dsp/
Dnoise_model.c169 static void noise_strength_solver_clear(aom_noise_strength_solver_t *solver) { in noise_strength_solver_clear() argument
170 equation_system_clear(&solver->eqns); in noise_strength_solver_clear()
171 solver->num_equations = 0; in noise_strength_solver_clear()
172 solver->total = 0; in noise_strength_solver_clear()
248 const aom_noise_strength_solver_t *solver, double value) { in noise_strength_solver_get_bin_index() argument
250 fclamp(value, solver->min_intensity, solver->max_intensity); in noise_strength_solver_get_bin_index()
251 const double range = solver->max_intensity - solver->min_intensity; in noise_strength_solver_get_bin_index()
252 return (solver->num_bins - 1) * (val - solver->min_intensity) / range; in noise_strength_solver_get_bin_index()
256 const aom_noise_strength_solver_t *solver, double x) { in noise_strength_solver_get_value() argument
257 const double bin = noise_strength_solver_get_bin_index(solver, x); in noise_strength_solver_get_value()
[all …]
Dnoise_model.h89 int aom_noise_strength_solver_init(aom_noise_strength_solver_t *solver,
91 void aom_noise_strength_solver_free(aom_noise_strength_solver_t *solver);
98 const aom_noise_strength_solver_t *solver, int i);
106 aom_noise_strength_solver_t *solver, double block_mean, double noise_std);
109 int aom_noise_strength_solver_solve(aom_noise_strength_solver_t *solver);
117 const aom_noise_strength_solver_t *solver, int max_num_points,
/external/tensorflow/tensorflow/core/util/
Dcuda_solvers.cc201 std::unique_ptr<CudaSolver> solver, in CheckLapackInfoAndDeleteSolverAsync() argument
217 solver->context(), success, in CheckLapackInfoAndDeleteSolverAsync()
226 auto* stream = solver->context()->op_device_context()->stream(); in CheckLapackInfoAndDeleteSolverAsync()
229 CudaSolver* solver, in CheckLapackInfoAndDeleteSolverAsync()
250 delete solver; in CheckLapackInfoAndDeleteSolverAsync()
260 auto solver_raw_ptr = solver.release(); in CheckLapackInfoAndDeleteSolverAsync()
273 std::unique_ptr<CudaSolver> solver, in CheckLapackInfoAndDeleteSolverAsync() argument
276 OpKernelContext* context = solver->context(); in CheckLapackInfoAndDeleteSolverAsync()
287 CheckLapackInfoAndDeleteSolverAsync(std::move(solver), dev_lapack_info, in CheckLapackInfoAndDeleteSolverAsync()
346 static inline Status GeamImpl(SolverFnT solver, cublasHandle_t cublas_handle, in GeamImpl() argument
[all …]
/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()
/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()
/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/libaom/libaom/test/
Dnoise_model_test.cc117 aom_noise_strength_solver_t solver; in TEST() local
118 aom_noise_strength_solver_init(&solver, 2, 8); in TEST()
119 EXPECT_NEAR(0, aom_noise_strength_solver_get_center(&solver, 0), 1e-5); in TEST()
120 EXPECT_NEAR(255, aom_noise_strength_solver_get_center(&solver, 1), 1e-5); in TEST()
121 aom_noise_strength_solver_free(&solver); in TEST()
125 aom_noise_strength_solver_t solver; in TEST() local
126 aom_noise_strength_solver_init(&solver, 2, 10); in TEST()
127 EXPECT_NEAR(0, aom_noise_strength_solver_get_center(&solver, 0), 1e-5); in TEST()
128 EXPECT_NEAR(1023, aom_noise_strength_solver_get_center(&solver, 1), 1e-5); in TEST()
129 aom_noise_strength_solver_free(&solver); in TEST()
[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.

1234