1#ifndef STAN_MATH_REV_FUN_BESSEL_FIRST_KIND_HPP
2#define STAN_MATH_REV_FUN_BESSEL_FIRST_KIND_HPP
16 [precomp_bessel, a](
const auto& vi)
mutable {
17 a.adj() += vi.adj_ * precomp_bessel;
25template <
typename T1,
typename T2, require_st_
integral<T1>* =
nullptr,
26 require_eigen_t<T2>* =
nullptr>
31 =
to_arena(v_map * ret_val / a.val().array()
34 ret_val.matrix(), [precomp_bessel, a](
const auto& vi)
mutable {
35 a.adj().array() += vi.adj().array() * precomp_bessel;
T as_array_or_scalar(T &&v)
Returns specified input value.
var_value< plain_type_t< T > > make_callback_var(T &&value, F &&functor)
Creates a new var initialized with a callback_vari with a given value and reverse-pass callback funct...
arena_t< T > to_arena(const T &a)
Converts given argument into a type that either has any dynamic allocation on AD stack or schedules i...
fvar< T > bessel_first_kind(int v, const fvar< T > &z)
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...