Skip to content

Commit b11afe6

Browse files
committed
correct solve_newton for make cpplint
1 parent 34899e7 commit b11afe6

1 file changed

Lines changed: 0 additions & 50 deletions

File tree

stan/math/rev/functor/solve_newton.hpp

Lines changed: 0 additions & 50 deletions
Original file line numberDiff line numberDiff line change
@@ -200,56 +200,6 @@ Eigen::Matrix<var, Eigen::Dynamic, 1> solve_newton_tol(
200200
return ret_type(ret);
201201
}
202202

203-
/**
204-
* Return the solution to the specified system of algebraic
205-
* equations given an initial guess, and parameters and data,
206-
* which get passed into the algebraic system. Use the
207-
* KINSOL solver from the SUNDIALS suite.
208-
*
209-
* The user can also specify the scaled step size, the function
210-
* tolerance, and the maximum number of steps.
211-
*
212-
* @tparam F type of equation system function
213-
* @tparam T type of elements in the x vector
214-
* @tparam Args types of additional input to the equation system functor
215-
*
216-
* @param[in] f Functor that evaluates the system of equations.
217-
* @param[in] x Vector of starting values (initial guess).
218-
* @param[in, out] msgs The print stream for warning messages.
219-
* @param[in] scaling_step_size Scaled-step stopping tolerance. If
220-
* a Newton step is smaller than the scaling step
221-
* tolerance, the code breaks, assuming the solver is no
222-
* longer making significant progress (i.e. is stuck)
223-
* @param[in] function_tolerance determines whether roots are acceptable.
224-
* @param[in] max_num_steps maximum number of function evaluations.
225-
* @param[in, out] msgs the print stream for warning messages.
226-
* @param[in] args Additional parameters to the equation system functor.
227-
* @return theta Vector of solutions to the system of equations.
228-
* @throw <code>std::invalid_argument</code> if x has size zero.
229-
* @throw <code>std::invalid_argument</code> if x has non-finite elements.
230-
* @throw <code>std::invalid_argument</code> if scaled_step_size is strictly
231-
* negative.
232-
* @throw <code>std::invalid_argument</code> if function_tolerance is strictly
233-
* negative.
234-
* @throw <code>std::invalid_argument</code> if max_num_steps is not positive.
235-
* @throw <code>std::domain_error if solver exceeds max_num_steps.
236-
*/
237-
// template <typename F, typename T, typename... T_Args,
238-
// require_eigen_vector_t<T>* = nullptr>
239-
// Eigen::Matrix<stan::return_type_t<T_Args...>, Eigen::Dynamic, 1>
240-
// solve_newton_tol(const F& f, const T& x, const double scaling_step_size,
241-
// const double function_tolerance, const int64_t max_num_steps,
242-
// std::ostream* const msgs, const T_Args&... args) {
243-
// const auto& args_ref_tuple = std::make_tuple(to_ref(args)...);
244-
// return math::apply(
245-
// [&](const auto&... args_refs) {
246-
// return solve_newton_impl(f, x, msgs,
247-
// scaling_step_size, function_tolerance,
248-
// max_num_steps, args_refs...);
249-
// },
250-
// args_ref_tuple);
251-
// }
252-
253203
/**
254204
* Return the solution to the specified system of algebraic
255205
* equations given an initial guess, and parameters and data,

0 commit comments

Comments
 (0)