/external/eigen/bench/spbench/ |
D | spbenchsolver.h | 214 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 …]
|
D | test_sparseLU.cpp | 31 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()
|
D | sp_solver.cpp | 30 …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/ |
D | sparse_solver.h | 15 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 …]
|
D | sparseqr.cpp | 52 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()
|
D | spqr_support.cpp | 37 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()
|
/external/tensorflow/tensorflow/core/kernels/ |
D | matrix_inverse_op.cc | 128 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 …]
|
D | matrix_solve_op.cc | 171 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 …]
|
D | determinant_op.cc | 168 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 …]
|
D | cuda_solvers.cc | 180 std::unique_ptr<CudaSolver> solver, in CheckLapackInfoAndDeleteSolverAsync() argument 196 solver->context(), success, in CheckLapackInfoAndDeleteSolverAsync() 205 auto* stream = solver->context()->op_device_context()->stream(); in CheckLapackInfoAndDeleteSolverAsync() 208 CudaSolver* solver, in CheckLapackInfoAndDeleteSolverAsync() 229 delete solver; in CheckLapackInfoAndDeleteSolverAsync() 239 auto solver_raw_ptr = solver.release(); in CheckLapackInfoAndDeleteSolverAsync() 252 std::unique_ptr<CudaSolver> solver, in CheckLapackInfoAndDeleteSolverAsync() argument 255 OpKernelContext* context = solver->context(); in CheckLapackInfoAndDeleteSolverAsync() 266 CheckLapackInfoAndDeleteSolverAsync(std::move(solver), dev_lapack_info, in CheckLapackInfoAndDeleteSolverAsync() 325 static inline Status GeamImpl(SolverFnT solver, cublasHandle_t cublas_handle, in GeamImpl() argument [all …]
|
D | svd_op_gpu.cu.cc | 97 std::unique_ptr<CudaSolver> solver) { in RunSVD() argument 117 context, solver->allocate_scoped_tensor(U->dtype(), u_shape, &u_copy), in RunSVD() 135 dev_info.push_back(solver->GetDeviceLapackInfo(batch_size, "gesvd")); in RunSVD() 143 solver->allocate_scoped_tensor( in RunSVD() 176 solver->Gesvd(jobu, jobvt, m, n, input, m, outputS, outputU, m, in RunSVD() 214 CheckResult(context, std::move(done), dev_info, std::move(solver)); in RunSVD() 219 std::unique_ptr<CudaSolver> solver) { in CheckResult() argument 231 CudaSolver::CheckLapackInfoAndDeleteSolverAsync(std::move(solver), dev_info, in CheckResult() 249 std::unique_ptr<CudaSolver> solver(new CudaSolver(context)); in PerformSVD_MgeqN() local 252 solver->allocate_scoped_tensor(M.dtype(), input_shape, &input_copy), in PerformSVD_MgeqN() [all …]
|
D | qr_op_impl.h | 174 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()
|
D | lu_op_gpu.cu.cc | 109 auto solver = absl::make_unique<CudaSolver>(context); in ComputeAsync() local 162 solver->allocate_scoped_tensor( in ComputeAsync() 180 auto packed_triangular_factors_ptrs = solver->GetScratchSpace<uint8>( in ComputeAsync() 191 solver->GetDeviceLapackInfo(batch_size, "getrfBatched")); in ComputeAsync() 194 solver->GetrfBatched(num_rows, packed_triangular_factors_ptrs_base, in ComputeAsync() 201 dev_info.push_back(solver->GetDeviceLapackInfo(batch_size, "getrf")); in ComputeAsync() 205 solver->Getrf( in ComputeAsync() 252 CudaSolver::CheckLapackInfoAndDeleteSolverAsync(std::move(solver), dev_info, in ComputeAsync()
|
D | self_adjoint_eig_v2_op_gpu.cc | 85 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()
|
D | cholesky_op.cc | 125 std::unique_ptr<CudaSolver> solver(new CudaSolver(context)); in ComputeAsync() local 146 dev_info.push_back(solver->GetDeviceLapackInfo(batch_size, "potrf")); in ComputeAsync() 151 solver->Potrf(CUBLAS_FILL_MODE_UPPER, n, in ComputeAsync() 165 CudaSolver::CheckLapackInfoAndDeleteSolverAsync(std::move(solver), dev_info, in ComputeAsync()
|
/external/libaom/libaom/aom_dsp/ |
D | noise_model.c | 169 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() 247 const aom_noise_strength_solver_t *solver, double value) { in noise_strength_solver_get_bin_index() argument 249 fclamp(value, solver->min_intensity, solver->max_intensity); in noise_strength_solver_get_bin_index() 250 const double range = solver->max_intensity - solver->min_intensity; in noise_strength_solver_get_bin_index() 251 return (solver->num_bins - 1) * (val - solver->min_intensity) / range; in noise_strength_solver_get_bin_index() 255 const aom_noise_strength_solver_t *solver, double x) { in noise_strength_solver_get_value() argument 256 const double bin = noise_strength_solver_get_bin_index(solver, x); in noise_strength_solver_get_value() [all …]
|
D | noise_model.h | 89 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/eigen/doc/snippets/ |
D | BiCGSTAB_simple.cpp | 5 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
|
D | BiCGSTAB_step_by_step.cpp | 5 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/ |
D | dng_tone_curve.cpp | 121 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/eigen/doc/ |
D | SparseLinearSystems.dox | 9 %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/ |
D | noise_model_test.cc | 117 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/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/ |
D | NonLinearConjugateGradientOptimizer.java | 54 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/v8/benchmarks/ |
D | navier-stokes.js | 33 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/ |
D | SelfAdjointEigenSolver.h | 626 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 …]
|