TMB Documentation  v1.9.11
newton::jacobian_dense_t< Factorization > Member List

This is the complete list of members for newton::jacobian_dense_t< Factorization >, including all inherited members.

activeDomain()TMBad::ADFun<>inline
activeRange()TMBad::ADFun<>inline
ADFun(Functor F, const ScalarVector &x_)TMBad::ADFun<>inline
ADFun(Functor F, Scalar x0_)TMBad::ADFun<>inline
ADFun(Functor F, Scalar x0_, Scalar x1_)TMBad::ADFun<>inline
atomic()TMBad::ADFun<>inline
compose(ADFun other)TMBad::ADFun<>inline
crossprod(const vector< T > &y2, const vector< T > &y)newton::jacobian_dense_t< Factorization >inline
decompose(std::vector< Index > nodes)TMBad::ADFun<>inline
decompose(const char *name)TMBad::ADFun<>inline
decompose_refs()TMBad::ADFun<>inline
DomainInner() constTMBad::ADFun<>inline
DomainOuter() constTMBad::ADFun<>inline
DomainOuterMask()TMBad::ADFun<>inline
DomainVec()TMBad::ADFun<>inline
DomainVecSet(const InplaceVector &x)TMBad::ADFun<>inline
eliminate()TMBad::ADFun<>inline
find_pos(Index inv)TMBad::ADFun<>inline
force_update()TMBad::ADFun<>inline
forward(const Vector &x)TMBad::ADFun<>inline
get_keep_var(std::vector< bool > keep_x, std::vector< bool > keep_y)TMBad::ADFun<>inline
inactivate(std::vector< Index > nodes)TMBad::ADFun<>inline
inner_outer_in_use()TMBad::ADFun<>inline
inv_index_is_consecutive()TMBad::ADFun<>inline
inv_posTMBad::ADFun<>
JacFun(std::vector< bool > keep_x=std::vector< bool >(0), std::vector< bool > keep_y=std::vector< bool >(0))TMBad::ADFun<>inline
Jacobian(const std::vector< Scalar > &x)TMBad::ADFun<>inline
Jacobian(const std::vector< Scalar > &x, std::vector< bool > keep_x, std::vector< bool > keep_y)TMBad::ADFun<>inline
Jacobian(const std::vector< Scalar > &x, const std::vector< Scalar > &w)TMBad::ADFun<>inline
llt_solve(const matrix< TMBad::Scalar > &H, const matrix< TMBad::Scalar > &x)newton::jacobian_dense_t< Factorization >inline
marginal_gk(const std::vector< Index > &random, gk_config cfg=gk_config())TMBad::ADFun<>inline
marginal_sr(const std::vector< Index > &random, std::vector< sr_grid > grid, const std::vector< Index > &random2grid, bool perm=true)TMBad::ADFun<>inline
marginal_sr(const std::vector< Index > &random, sr_grid grid=sr_grid())TMBad::ADFun<>inline
ADFun<>::operator()(const std::vector< Scalar > &x)TMBad::ADFun<>inline
ADFun<>::operator()(const std::vector< ad_aug > &x_) constTMBad::ADFun<>inline
ADFun<>::operator()(ad_aug x0)TMBad::ADFun<>inline
ADFun<>::operator()(ad_aug x0, ad_aug x1)TMBad::ADFun<>inline
optimize()TMBad::ADFun<>inline
parallel_accumulate(size_t num_threads)TMBad::ADFun<>inline
parallelize(size_t num_threads)TMBad::ADFun<>inline
print(print_config cfg=print_config())TMBad::ADFun<>inline
RangeVec()TMBad::ADFun<>inline
reorder(std::vector< Index > last)TMBad::ADFun<>inline
replay()TMBad::ADFun<>inline
resolve_refs()TMBad::ADFun<>inline
reverse(const Vector &w)TMBad::ADFun<>inline
set_inner_outer(ADFun &ans, const std::vector< bool > &outer_mask)TMBad::ADFun<>inline
set_inv_positions()TMBad::ADFun<>inline
set_tail(const std::vector< Index > &random)TMBad::ADFun<>inline
SpJacFun(std::vector< bool > keep_x=std::vector< bool >(0), std::vector< bool > keep_y=std::vector< bool >(0), SpJacFun_config config=SpJacFun_config())TMBad::ADFun<>inline
SwapInner()TMBad::ADFun<>inline
SwapOuter()TMBad::ADFun<>inline
tail_startTMBad::ADFun<>
unset_tail()TMBad::ADFun<>inline
WgtJacFun(std::vector< bool > keep_x=std::vector< bool >(0), std::vector< bool > keep_y=std::vector< bool >(0))TMBad::ADFun<>inline
License: GPL v2