1#ifndef STAN_MATH_REV_FUN_EIGENVECTORS_HPP
2#define STAN_MATH_REV_FUN_EIGENVECTORS_HPP
25template <
typename T, require_rev_matrix_t<T>* =
nullptr>
29 return return_t(Eigen::MatrixXd(0, 0));
34 Eigen::SelfAdjointEigenSolver<Eigen::MatrixXd> solver(arena_m.val());
36 auto eigenvals =
to_arena(solver.eigenvalues());
39 const auto p = arena_m.val().
cols();
40 Eigen::MatrixXd f = (1
41 / (eigenvals.rowwise().replicate(p).
transpose()
42 - eigenvals.rowwise().replicate(p))
44 f.diagonal().setZero();
47 * f.cwiseProduct(eigenvecs.val_op().transpose() * eigenvecs.adj_op())
48 * eigenvecs.val_op().transpose();
51 return return_t(eigenvecs);
void check_symmetric(const char *function, const char *name, const matrix_cl< T > &y)
Check if the matrix_cl is symmetric.
auto transpose(Arg &&a)
Transposes a kernel generator expression.
int64_t cols(const T_x &x)
Returns the number of columns in the specified kernel generator expression.
matrix_cl< double > eigenvectors_sym(const matrix_cl< double > &m)
void reverse_pass_callback(F &&functor)
Puts a callback on the autodiff stack to be called in reverse pass.
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...
typename internal::arena_type_impl< std::decay_t< T > >::type arena_t
Determines a type that can be used in place of T that does any dynamic allocations on the AD stack.
std::conditional_t< is_any_var_matrix< ReturnType, Types... >::value, stan::math::var_value< stan::math::promote_scalar_t< double, plain_type_t< ReturnType > > >, stan::math::promote_scalar_t< stan::math::var_value< double >, plain_type_t< ReturnType > > > return_var_matrix_t
Given an Eigen type and several inputs, determine if a matrix should be var<Matrix> or Matrix<var>.
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...