Tree @upstream/2015.00.00.7 (Download .tar.gz)
- ..
- __contents_xml.js
- __external_xml.js
- __index_xml.js
- __reference_xml.js
- __search_xml.js
- _a11c_bthread.cpp_xml.js
- _a11c_openmp.cpp_xml.js
- _a11c_pthread.cpp_xml.js
- _abort_recording.cpp_xml.js
- _abort_recording_xml.js
- _abs.cpp_xml.js
- _abs_xml.js
- _acos.cpp_xml.js
- _acosforward_xml.js
- _acosreverse_xml.js
- _ad_assign.cpp_xml.js
- _ad_assign_xml.js
- _ad_binary_xml.js
- _ad_ctor.cpp_xml.js
- _ad_ctor_xml.js
- _ad_fun.cpp_xml.js
- _ad_in_c.cpp_xml.js
- _ad_input.cpp_xml.js
- _ad_input_xml.js
- _ad_output.cpp_xml.js
- _ad_output_xml.js
- _ad_xml.js
- _add.cpp_xml.js
- _addeq.cpp_xml.js
- _adfun_xml.js
- _adolc_alloc_mat_xml.js
- _adolc_det_lu.cpp_xml.js
- _adolc_det_minor.cpp_xml.js
- _adolc_mat_mul.cpp_xml.js
- _adolc_ode.cpp_xml.js
- _adolc_poly.cpp_xml.js
- _adolc_prefix_xml.js
- _adolc_sparse_hessian.cpp_xml.js
- _adolc_sparse_jacobian.cpp_xml.js
- _advalued_xml.js
- _appendix_xml.js
- _arithmetic_xml.js
- _asin.cpp_xml.js
- _asinforward_xml.js
- _asinreverse_xml.js
- _atan.cpp_xml.js
- _atan2.cpp_xml.js
- _atan2_xml.js
- _atanforward_xml.js
- _atanreverse_xml.js
- _atomic_afun_xml.js
- _atomic_base_clear_xml.js
- _atomic_base_xml.js
- _atomic_ctor_xml.js
- _atomic_for_sparse_jac_xml.js
- _atomic_forward_xml.js
- _atomic_get_started.cpp_xml.js
- _atomic_hes_sparse.cpp_xml.js
- _atomic_mat_mul.cpp_xml.js
- _atomic_matrix_mul.hpp_xml.js
- _atomic_norm_sq.cpp_xml.js
- _atomic_option_xml.js
- _atomic_reciprocal.cpp_xml.js
- _atomic_rev_sparse_hes_xml.js
- _atomic_rev_sparse_jac_xml.js
- _atomic_reverse_xml.js
- _atomic_tangent.cpp_xml.js
- _atomic_xml.js
- _base_adolc.hpp_xml.js
- _base_alloc.hpp_xml.js
- _base_complex.hpp_xml.js
- _base_cond_exp_xml.js
- _base_double.hpp_xml.js
- _base_example_xml.js
- _base_float.hpp_xml.js
- _base_identical_xml.js
- _base_member_xml.js
- _base_ordered_xml.js
- _base_require.cpp_xml.js
- _base_require_xml.js
- _base_std_math_xml.js
- _bender_quad.cpp_xml.js
- _benderquad_xml.js
- _bib_xml.js
- _bool_fun.cpp_xml.js
- _boolfun_xml.js
- _boolvalued_xml.js
- _bugs_xml.js
- _capacity_order.cpp_xml.js
- _capacity_order_xml.js
- _change_const.cpp_xml.js
- _check_for_nan.cpp_xml.js
- _check_for_nan_xml.js
- _check_numeric_type.cpp_xml.js
- _check_simple_vector.cpp_xml.js
- _checknumerictype_xml.js
- _checkpoint.cpp_xml.js
- _checkpoint_xml.js
- _checksimplevector_xml.js
- _close.gif
- _closeblue.gif
- _cmake_check_xml.js
- _cmake_xml.js
- _colpack.cpp_xml.js
- _colpack_prefix_xml.js
- _compare.cpp_xml.js
- _compare_c_xml.js
- _compare_change.cpp_xml.js
- _compare_xml.js
- _comparechange_xml.js
- _complex_poly.cpp_xml.js
- _compute_assign_xml.js
- _cond_exp.cpp_xml.js
- _condexp_xml.js
- _conj_grad.cpp_xml.js
- _contents.js
- _contents_xml.htm
- _convert_xml.js
- _correct_det_by_minor_c_xml.js
- _cos.cpp_xml.js
- _cosh.cpp_xml.js
- _cppad_assert_xml.js
- _cppad_det_lu.cpp_xml.js
- _cppad_det_minor.cpp_xml.js
- _cppad_eigen.hpp_xml.js
- _cppad_ipopt_nlp_xml.js
- _cppad_mat_mul.cpp_xml.js
- _cppad_ode.cpp_xml.js
- _cppad_poly.cpp_xml.js
- _cppad_sparse_hessian.cpp_xml.js
- _cppad_sparse_jacobian.cpp_xml.js
- _cppad_testvector_xml.js
- _cppad_vector.cpp_xml.js
- _cppad_vector_xml.js
- _cppad_xml.js
- _dependent_xml.js
- _deprecated_xml.js
- _det_33.hpp_xml.js
- _det_33_xml.js
- _det_by_lu.cpp_xml.js
- _det_by_lu.hpp_xml.js
- _det_by_lu_xml.js
- _det_by_minor.cpp_xml.js
- _det_by_minor.hpp_xml.js
- _det_by_minor_c_xml.js
- _det_by_minor_xml.js
- _det_grad_33.hpp_xml.js
- _det_grad_33_xml.js
- _det_of_minor.cpp_xml.js
- _det_of_minor.hpp_xml.js
- _det_of_minor_c_xml.js
- _det_of_minor_xml.js
- _discrete_xml.js
- _div.cpp_xml.js
- _div_eq.cpp_xml.js
- _double_det_lu.cpp_xml.js
- _double_det_minor.cpp_xml.js
- _double_mat_mul.cpp_xml.js
- _double_ode.cpp_xml.js
- _double_poly.cpp_xml.js
- _double_sparse_hessian.cpp_xml.js
- _double_sparse_jacobian.cpp_xml.js
- _download_xml.js
- _drivers_xml.js
- _eigen_array.cpp_xml.js
- _eigen_det.cpp_xml.js
- _eigen_plugin.hpp_xml.js
- _eigen_prefix_xml.js
- _elapsed_seconds.cpp_xml.js
- _elapsed_seconds_c_xml.js
- _elapsed_seconds_xml.js
- _epsilon_xml.js
- _equal_op_seq.cpp_xml.js
- _equalopseq_xml.js
- _erf.cpp_xml.js
- _erf_forward_xml.js
- _erf_reverse_xml.js
- _erf_xml.js
- _error_handler.cpp_xml.js
- _errorhandler_xml.js
- _example.cpp_xml.js
- _example_xml.js
- _exampleutility_xml.js
- _exp.cpp_xml.js
- _exp_2.cpp_xml.js
- _exp_2.hpp_xml.js
- _exp_2_cppad_xml.js
- _exp_2_for0.cpp_xml.js
- _exp_2_for0_xml.js
- _exp_2_for1.cpp_xml.js
- _exp_2_for1_xml.js
- _exp_2_for2.cpp_xml.js
- _exp_2_for2_xml.js
- _exp_2_rev1.cpp_xml.js
- _exp_2_rev1_xml.js
- _exp_2_rev2.cpp_xml.js
- _exp_2_rev2_xml.js
- _exp_2_xml.js
- _exp_apx_main.cpp_xml.js
- _exp_eps.cpp_xml.js
- _exp_eps.hpp_xml.js
- _exp_eps_cppad_xml.js
- _exp_eps_for0.cpp_xml.js
- _exp_eps_for0_xml.js
- _exp_eps_for1.cpp_xml.js
- _exp_eps_for1_xml.js
- _exp_eps_for2.cpp_xml.js
- _exp_eps_for2_xml.js
- _exp_eps_rev1.cpp_xml.js
- _exp_eps_rev1_xml.js
- _exp_eps_rev2.cpp_xml.js
- _exp_eps_rev2_xml.js
- _exp_eps_xml.js
- _expforward_xml.js
- _expreverse_xml.js
- _external.xml
- _fadbad_det_lu.cpp_xml.js
- _fadbad_det_minor.cpp_xml.js
- _fadbad_mat_mul.cpp_xml.js
- _fadbad_ode.cpp_xml.js
- _fadbad_poly.cpp_xml.js
- _fadbad_prefix_xml.js
- _fadbad_sparse_hessian.cpp_xml.js
- _fadbad_sparse_jacobian.cpp_xml.js
- _faq_xml.js
- _for_one.cpp_xml.js
- _for_sparse_jac.cpp_xml.js
- _for_two.cpp_xml.js
- _forone_xml.js
- _forsparsejac_xml.js
- _fortwo_xml.js
- _forward.cpp_xml.js
- _forward_dir.cpp_xml.js
- _forward_dir_xml.js
- _forward_one_xml.js
- _forward_order.cpp_xml.js
- _forward_order_xml.js
- _forward_two_xml.js
- _forward_xml.js
- _forward_zero_xml.js
- _forwardtheory_xml.js
- _fun_assign.cpp_xml.js
- _fun_check.cpp_xml.js
- _funcheck_xml.js
- _funconstruct_xml.js
- _fundeprecated_xml.js
- _funeval_xml.js
- _general_xml.js
- _get_adolc.sh_xml.js
- _get_colpack.sh_xml.js
- _get_eigen.sh_xml.js
- _get_fadbad.sh_xml.js
- _get_ipopt.sh_xml.js
- _get_sacado.sh_xml.js
- _get_started.cpp_xml.js
- _glossary_xml.js
- _harmonic.cpp_xml.js
- _harmonic_time.cpp_xml.js
- _harmonic_work.cpp_xml.js
- _hes_lagrangian.cpp_xml.js
- _hes_lu_det.cpp_xml.js
- _hes_minor_det.cpp_xml.js
- _hes_times_dir.cpp_xml.js
- _hessian.cpp_xml.js
- _hessian_xml.js
- _image.gif
- _include_deprecated_xml.js
- _independent.cpp_xml.js
- _independent_xml.js
- _index.xml
- _index_sort.cpp_xml.js
- _index_sort_xml.js
- _install_xml.js
- _installunix_xml.js
- _integer.cpp_xml.js
- _integer_xml.js
- _interface2c.cpp_xml.js
- _interp_onetape.cpp_xml.js
- _interp_retape.cpp_xml.js
- _introduction_xml.js
- _ipopt_nlp_get_started.cpp_xml.js
- _ipopt_nlp_ode_check.cpp_xml.js
- _ipopt_nlp_ode_fast.hpp_xml.js
- _ipopt_nlp_ode_fast_xml.js
- _ipopt_nlp_ode_problem.hpp_xml.js
- _ipopt_nlp_ode_problem_xml.js
- _ipopt_nlp_ode_run.hpp_xml.js
- _ipopt_nlp_ode_simple.hpp_xml.js
- _ipopt_nlp_ode_simple_xml.js
- _ipopt_nlp_ode_xml.js
- _ipopt_ode_speed.cpp_xml.js
- _ipopt_prefix_xml.js
- _ipopt_solve_get_started.cpp_xml.js
- _ipopt_solve_ode_inverse.cpp_xml.js
- _ipopt_solve_retape.cpp_xml.js
- _ipopt_solve_xml.js
- _jac_lu_det.cpp_xml.js
- _jac_minor_det.cpp_xml.js
- _jacobian.cpp_xml.js
- _jacobian_xml.js
- _library_xml.js
- _license_xml.js
- _limits.cpp_xml.js
- _limits_xml.js
- _link_det_lu_xml.js
- _link_det_minor_xml.js
- _link_mat_mul_xml.js
- _link_ode_xml.js
- _link_poly_xml.js
- _link_sparse_hessian_xml.js
- _link_sparse_jacobian_xml.js
- _listallexamples_xml.js
- _log.cpp_xml.js
- _log10.cpp_xml.js
- _logforward_xml.js
- _logreverse_xml.js
- _lu_factor.cpp_xml.js
- _lu_factor.hpp_xml.js
- _lu_invert.cpp_xml.js
- _lu_invert.hpp_xml.js
- _lu_ratio.cpp_xml.js
- _lu_solve.cpp_xml.js
- _lu_solve.hpp_xml.js
- _lu_vec_ad.cpp_xml.js
- _lu_vec_ad_ok.cpp_xml.js
- _ludetandsolve_xml.js
- _lufactor_xml.js
- _luinvert_xml.js
- _luratio_xml.js
- _lusolve_xml.js
- _main_compare_c_xml.js
- _mat_sum_sq.cpp_xml.js
- _mat_sum_sq.hpp_xml.js
- _mat_sum_sq_xml.js
- _mathother_xml.js
- _memory_leak_xml.js
- _microsoft_timer_xml.js
- _mul.cpp_xml.js
- _mul_eq.cpp_xml.js
- _mul_level.cpp_xml.js
- _mul_level_adolc.cpp_xml.js
- _mul_level_adolc_ode.cpp_xml.js
- _mul_level_ode.cpp_xml.js
- _mul_level_xml.js
- _multi_newton.cpp_xml.js
- _multi_newton_time.cpp_xml.js
- _multi_newton_work.cpp_xml.js
- _multi_thread_xml.js
- _nan.cpp_xml.js
- _nan_xml.js
- _near_equal.cpp_xml.js
- _near_equal_ext.cpp_xml.js
- _nearequal_xml.js
- _nearequalext_xml.js
- _number_skip.cpp_xml.js
- _number_skip_xml.js
- _numeric_type.cpp_xml.js
- _numerictype_xml.js
- _ode_err_control.cpp_xml.js
- _ode_err_maxabs.cpp_xml.js
- _ode_evaluate.cpp_xml.js
- _ode_evaluate.hpp_xml.js
- _ode_evaluate_xml.js
- _ode_gear.cpp_xml.js
- _ode_gear_control.cpp_xml.js
- _ode_stiff.cpp_xml.js
- _ode_taylor.cpp_xml.js
- _odeerrcontrol_xml.js
- _odegear_xml.js
- _odegearcontrol_xml.js
- _old_atomic_xml.js
- _old_mat_mul.cpp_xml.js
- _old_mat_mul.hpp_xml.js
- _old_max_num_threads_xml.js
- _old_reciprocal.cpp_xml.js
- _old_tan.cpp_xml.js
- _old_usead_1.cpp_xml.js
- _old_usead_2.cpp_xml.js
- _omp_alloc.cpp_xml.js
- _omp_alloc_xml.js
- _omp_available_xml.js
- _omp_create_array_xml.js
- _omp_delete_array_xml.js
- _omp_efficient_xml.js
- _omp_free_available_xml.js
- _omp_get_memory_xml.js
- _omp_get_thread_num_xml.js
- _omp_in_parallel_xml.js
- _omp_inuse_xml.js
- _omp_max_num_threads_xml.js
- _omp_max_thread_xml.js
- _omp_return_memory_xml.js
- _open.gif
- _openblue.gif
- _opt_val_hes.cpp_xml.js
- _opt_val_hes_xml.js
- _optimize.cpp_xml.js
- _optimize_xml.js
- _par_var.cpp_xml.js
- _parallel_ad_xml.js
- _parvar_xml.js
- _pkgconfig_xml.js
- _poly.cpp_xml.js
- _poly.hpp_xml.js
- _poly_xml.js
- _pow.cpp_xml.js
- _pow_int.cpp_xml.js
- _pow_int_xml.js
- _pow_xml.js
- _preprocessor_xml.js
- _print_for_cout.cpp_xml.js
- _print_for_string.cpp_xml.js
- _printfor_xml.js
- _reference.xml
- _repeat_det_by_minor_c_xml.js
- _rev_one.cpp_xml.js
- _rev_sparse_hes.cpp_xml.js
- _rev_sparse_jac.cpp_xml.js
- _rev_two.cpp_xml.js
- _reverse_any.cpp_xml.js
- _reverse_any_xml.js
- _reverse_identity_xml.js
- _reverse_one.cpp_xml.js
- _reverse_one_xml.js
- _reverse_three.cpp_xml.js
- _reverse_two.cpp_xml.js
- _reverse_two_xml.js
- _reverse_xml.js
- _reversetheory_xml.js
- _revone_xml.js
- _revsparsehes_xml.js
- _revsparsejac_xml.js
- _revtwo_xml.js
- _romberg_one.cpp_xml.js
- _rombergmul.cpp_xml.js
- _rombergmul_xml.js
- _rombergone_xml.js
- _rosen34_xml.js
- _rosen_34.cpp_xml.js
- _runge45_1.cpp_xml.js
- _runge45_2.cpp_xml.js
- _runge45_xml.js
- _sacado_det_lu.cpp_xml.js
- _sacado_det_minor.cpp_xml.js
- _sacado_mat_mul.cpp_xml.js
- _sacado_ode.cpp_xml.js
- _sacado_poly.cpp_xml.js
- _sacado_prefix_xml.js
- _sacado_sparse_hessian.cpp_xml.js
- _sacado_sparse_jacobian.cpp_xml.js
- _search.xml.js
- _search_xml.htm
- _seq_property.cpp_xml.js
- _seq_property_xml.js
- _sign.cpp_xml.js
- _sign_xml.js
- _simple_ad_bthread.cpp_xml.js
- _simple_ad_openmp.cpp_xml.js
- _simple_ad_pthread.cpp_xml.js
- _simple_vector.cpp_xml.js
- _simplevector_xml.js
- _sin.cpp_xml.js
- _sincosforward_xml.js
- _sincosreverse_xml.js
- _sinh.cpp_xml.js
- _size_order_xml.js
- _sparse_hes_fun.cpp_xml.js
- _sparse_hes_fun.hpp_xml.js
- _sparse_hes_fun_xml.js
- _sparse_hessian.cpp_xml.js
- _sparse_hessian_xml.js
- _sparse_jac_fun.cpp_xml.js
- _sparse_jac_fun.hpp_xml.js
- _sparse_jac_fun_xml.js
- _sparse_jacobian.cpp_xml.js
- _sparse_jacobian_xml.js
- _sparse_xml.js
- _speed_adolc_xml.js
- _speed_cppad_xml.js
- _speed_double_xml.js
- _speed_example.cpp_xml.js
- _speed_fadbad_xml.js
- _speed_main_xml.js
- _speed_program.cpp_xml.js
- _speed_sacado_xml.js
- _speed_test.cpp_xml.js
- _speed_test_xml.js
- _speed_utility_xml.js
- _speed_xml.js
- _speedtest_xml.js
- _sqrt.cpp_xml.js
- _sqrtforward_xml.js
- _sqrtreverse_xml.js
- _stack_machine.cpp_xml.js
- _std_math_ad_xml.js
- _sub.cpp_xml.js
- _sub_eq.cpp_xml.js
- _ta_available_xml.js
- _ta_create_array_xml.js
- _ta_delete_array_xml.js
- _ta_free_all_xml.js
- _ta_free_available_xml.js
- _ta_get_memory_xml.js
- _ta_hold_memory_xml.js
- _ta_in_parallel_xml.js
- _ta_inuse_xml.js
- _ta_num_threads_xml.js
- _ta_parallel_setup_xml.js
- _ta_return_memory_xml.js
- _ta_thread_num_xml.js
- _tan.cpp_xml.js
- _tan_forward_xml.js
- _tan_reverse_xml.js
- _tanh.cpp_xml.js
- _tape_index.cpp_xml.js
- _team_bthread.cpp_xml.js
- _team_example.cpp_xml.js
- _team_openmp.cpp_xml.js
- _team_pthread.cpp_xml.js
- _team_thread.hpp_xml.js
- _test_vector_xml.js
- _testvector_xml.js
- _theory_xml.js
- _thread_alloc.cpp_xml.js
- _thread_alloc_xml.js
- _thread_test.cpp_xml.js
- _time_det_by_minor_c_xml.js
- _time_test.cpp_xml.js
- _time_test_xml.js
- _tracknewdel.cpp_xml.js
- _tracknewdel_xml.js
- _unary_minus.cpp_xml.js
- _unary_plus.cpp_xml.js
- _unaryminus_xml.js
- _unaryplus_xml.js
- _uniform_01.hpp_xml.js
- _uniform_01_c_xml.js
- _uniform_01_xml.js
- _value.cpp_xml.js
- _value_xml.js
- _var2par.cpp_xml.js
- _var2par_xml.js
- _vec_ad.cpp_xml.js
- _vecad_xml.js
- _vector_bool.cpp_xml.js
- _whats_new_03_xml.js
- _whats_new_04_xml.js
- _whats_new_05_xml.js
- _whats_new_06_xml.js
- _whats_new_07_xml.js
- _whats_new_08_xml.js
- _whats_new_09_xml.js
- _whats_new_10_xml.js
- _whats_new_11_xml.js
- _whats_new_12_xml.js
- _whats_new_13_xml.js
- _whats_new_14_xml.js
- _whats_new_xml.js
- _wishlist_xml.js
- a11c_bthread.cpp.xml
- a11c_openmp.cpp.xml
- a11c_pthread.cpp.xml
- abort_recording.cpp.xml
- abort_recording.xml
- abs.cpp.xml
- abs.xml
- acos.cpp.xml
- acosforward.xml
- acosreverse.xml
- ad.xml
- ad_assign.cpp.xml
- ad_assign.xml
- ad_binary.xml
- ad_ctor.cpp.xml
- ad_ctor.xml
- ad_fun.cpp.xml
- ad_in_c.cpp.xml
- ad_input.cpp.xml
- ad_input.xml
- ad_output.cpp.xml
- ad_output.xml
- add.cpp.xml
- addeq.cpp.xml
- adfun.xml
- adolc_alloc_mat.xml
- adolc_det_lu.cpp.xml
- adolc_det_minor.cpp.xml
- adolc_mat_mul.cpp.xml
- adolc_ode.cpp.xml
- adolc_poly.cpp.xml
- adolc_prefix.xml
- adolc_sparse_hessian.cpp.xml
- adolc_sparse_jacobian.cpp.xml
- advalued.xml
- appendix.xml
- arithmetic.xml
- asin.cpp.xml
- asinforward.xml
- asinreverse.xml
- atan.cpp.xml
- atan2.cpp.xml
- atan2.xml
- atanforward.xml
- atanreverse.xml
- atomic.xml
- atomic_afun.xml
- atomic_base.xml
- atomic_base_clear.xml
- atomic_ctor.xml
- atomic_for_sparse_jac.xml
- atomic_forward.xml
- atomic_get_started.cpp.xml
- atomic_hes_sparse.cpp.xml
- atomic_mat_mul.cpp.xml
- atomic_matrix_mul.hpp.xml
- atomic_norm_sq.cpp.xml
- atomic_option.xml
- atomic_reciprocal.cpp.xml
- atomic_rev_sparse_hes.xml
- atomic_rev_sparse_jac.xml
- atomic_reverse.xml
- atomic_tangent.cpp.xml
- base_adolc.hpp.xml
- base_alloc.hpp.xml
- base_complex.hpp.xml
- base_cond_exp.xml
- base_double.hpp.xml
- base_example.xml
- base_float.hpp.xml
- base_identical.xml
- base_member.xml
- base_ordered.xml
- base_require.cpp.xml
- base_require.xml
- base_std_math.xml
- bender_quad.cpp.xml
- benderquad.xml
- bib.xml
- bool_fun.cpp.xml
- boolfun.xml
- boolvalued.xml
- bugs.xml
- capacity_order.cpp.xml
- capacity_order.xml
- change_const.cpp.xml
- check_for_nan.cpp.xml
- check_for_nan.xml
- check_numeric_type.cpp.xml
- check_simple_vector.cpp.xml
- checknumerictype.xml
- checkpoint.cpp.xml
- checkpoint.xml
- checksimplevector.xml
- cmake.xml
- cmake_check.xml
- colpack.cpp.xml
- colpack_prefix.xml
- compare.cpp.xml
- compare.xml
- compare_c.xml
- compare_change.cpp.xml
- comparechange.xml
- complex_poly.cpp.xml
- compute_assign.xml
- cond_exp.cpp.xml
- condexp.xml
- conj_grad.cpp.xml
- convert.xml
- correct_det_by_minor_c.xml
- cos.cpp.xml
- cosh.cpp.xml
- cppad.xml
- cppad_assert.xml
- cppad_det_lu.cpp.xml
- cppad_det_minor.cpp.xml
- cppad_eigen.hpp.xml
- cppad_ipopt_nlp.xml
- cppad_mat_mul.cpp.xml
- cppad_ode.cpp.xml
- cppad_poly.cpp.xml
- cppad_sparse_hessian.cpp.xml
- cppad_sparse_jacobian.cpp.xml
- cppad_testvector.xml
- cppad_vector.cpp.xml
- cppad_vector.xml
- dependent.xml
- deprecated.xml
- det_33.hpp.xml
- det_33.xml
- det_by_lu.cpp.xml
- det_by_lu.hpp.xml
- det_by_lu.xml
- det_by_minor.cpp.xml
- det_by_minor.hpp.xml
- det_by_minor.xml
- det_by_minor_c.xml
- det_grad_33.hpp.xml
- det_grad_33.xml
- det_of_minor.cpp.xml
- det_of_minor.hpp.xml
- det_of_minor.xml
- det_of_minor_c.xml
- discrete.xml
- div.cpp.xml
- div_eq.cpp.xml
- double_det_lu.cpp.xml
- double_det_minor.cpp.xml
- double_mat_mul.cpp.xml
- double_ode.cpp.xml
- double_poly.cpp.xml
- double_sparse_hessian.cpp.xml
- double_sparse_jacobian.cpp.xml
- download.xml
- drivers.xml
- eigen_array.cpp.xml
- eigen_det.cpp.xml
- eigen_plugin.hpp.xml
- eigen_prefix.xml
- elapsed_seconds.cpp.xml
- elapsed_seconds.xml
- elapsed_seconds_c.xml
- epsilon.xml
- equal_op_seq.cpp.xml
- equalopseq.xml
- erf.cpp.xml
- erf.xml
- erf_forward.xml
- erf_reverse.xml
- error.wrd
- error_handler.cpp.xml
- errorhandler.xml
- example.cpp.xml
- example.xml
- exampleutility.xml
- exp.cpp.xml
- exp_2.cpp.xml
- exp_2.hpp.xml
- exp_2.xml
- exp_2_cppad.xml
- exp_2_for0.cpp.xml
- exp_2_for0.xml
- exp_2_for1.cpp.xml
- exp_2_for1.xml
- exp_2_for2.cpp.xml
- exp_2_for2.xml
- exp_2_rev1.cpp.xml
- exp_2_rev1.xml
- exp_2_rev2.cpp.xml
- exp_2_rev2.xml
- exp_apx_main.cpp.xml
- exp_eps.cpp.xml
- exp_eps.hpp.xml
- exp_eps.xml
- exp_eps_cppad.xml
- exp_eps_for0.cpp.xml
- exp_eps_for0.xml
- exp_eps_for1.cpp.xml
- exp_eps_for1.xml
- exp_eps_for2.cpp.xml
- exp_eps_for2.xml
- exp_eps_rev1.cpp.xml
- exp_eps_rev1.xml
- exp_eps_rev2.cpp.xml
- exp_eps_rev2.xml
- expforward.xml
- expreverse.xml
- fadbad_det_lu.cpp.xml
- fadbad_det_minor.cpp.xml
- fadbad_mat_mul.cpp.xml
- fadbad_ode.cpp.xml
- fadbad_poly.cpp.xml
- fadbad_prefix.xml
- fadbad_sparse_hessian.cpp.xml
- fadbad_sparse_jacobian.cpp.xml
- faq.xml
- for_one.cpp.xml
- for_sparse_jac.cpp.xml
- for_two.cpp.xml
- forone.xml
- forsparsejac.xml
- fortwo.xml
- forward.cpp.xml
- forward.xml
- forward_dir.cpp.xml
- forward_dir.xml
- forward_one.xml
- forward_order.cpp.xml
- forward_order.xml
- forward_two.xml
- forward_zero.xml
- forwardtheory.xml
- fun_assign.cpp.xml
- fun_check.cpp.xml
- funcheck.xml
- funconstruct.xml
- fundeprecated.xml
- funeval.xml
- general.xml
- get_adolc.sh.xml
- get_colpack.sh.xml
- get_eigen.sh.xml
- get_fadbad.sh.xml
- get_ipopt.sh.xml
- get_sacado.sh.xml
- get_started.cpp.xml
- glossary.xml
- harmonic.cpp.xml
- harmonic_time.cpp.xml
- harmonic_work.cpp.xml
- hes_lagrangian.cpp.xml
- hes_lu_det.cpp.xml
- hes_minor_det.cpp.xml
- hes_times_dir.cpp.xml
- hessian.cpp.xml
- hessian.xml
- include_deprecated.xml
- independent.cpp.xml
- independent.xml
- index.html
- index_sort.cpp.xml
- index_sort.xml
- install.xml
- installunix.xml
- integer.cpp.xml
- integer.xml
- interface2c.cpp.xml
- interp_onetape.cpp.xml
- interp_retape.cpp.xml
- introduction.xml
- ipopt_nlp_get_started.cpp.xml
- ipopt_nlp_ode.xml
- ipopt_nlp_ode_check.cpp.xml
- ipopt_nlp_ode_fast.hpp.xml
- ipopt_nlp_ode_fast.xml
- ipopt_nlp_ode_problem.hpp.xml
- ipopt_nlp_ode_problem.xml
- ipopt_nlp_ode_run.hpp.xml
- ipopt_nlp_ode_simple.hpp.xml
- ipopt_nlp_ode_simple.xml
- ipopt_ode_speed.cpp.xml
- ipopt_prefix.xml
- ipopt_solve.xml
- ipopt_solve_get_started.cpp.xml
- ipopt_solve_ode_inverse.cpp.xml
- ipopt_solve_retape.cpp.xml
- jac_lu_det.cpp.xml
- jac_minor_det.cpp.xml
- jacobian.cpp.xml
- jacobian.xml
- library.xml
- license.xml
- limits.cpp.xml
- limits.xml
- link_det_lu.xml
- link_det_minor.xml
- link_mat_mul.xml
- link_ode.xml
- link_poly.xml
- link_sparse_hessian.xml
- link_sparse_jacobian.xml
- listallexamples.xml
- log.cpp.xml
- log10.cpp.xml
- logforward.xml
- logreverse.xml
- lu_factor.cpp.xml
- lu_factor.hpp.xml
- lu_invert.cpp.xml
- lu_invert.hpp.xml
- lu_ratio.cpp.xml
- lu_solve.cpp.xml
- lu_solve.hpp.xml
- lu_vec_ad.cpp.xml
- lu_vec_ad_ok.cpp.xml
- ludetandsolve.xml
- lufactor.xml
- luinvert.xml
- luratio.xml
- lusolve.xml
- main_compare_c.xml
- mat_sum_sq.cpp.xml
- mat_sum_sq.hpp.xml
- mat_sum_sq.xml
- mathother.xml
- memory_leak.xml
- microsoft_timer.xml
- mul.cpp.xml
- mul_eq.cpp.xml
- mul_level.cpp.xml
- mul_level.xml
- mul_level_adolc.cpp.xml
- mul_level_adolc_ode.cpp.xml
- mul_level_ode.cpp.xml
- multi_newton.cpp.xml
- multi_newton_time.cpp.xml
- multi_newton_work.cpp.xml
- multi_thread.xml
- nan.cpp.xml
- nan.xml
- near_equal.cpp.xml
- near_equal_ext.cpp.xml
- nearequal.xml
- nearequalext.xml
- number_skip.cpp.xml
- number_skip.xml
- numeric_type.cpp.xml
- numerictype.xml
- ode_err_control.cpp.xml
- ode_err_maxabs.cpp.xml
- ode_evaluate.cpp.xml
- ode_evaluate.hpp.xml
- ode_evaluate.xml
- ode_gear.cpp.xml
- ode_gear_control.cpp.xml
- ode_stiff.cpp.xml
- ode_taylor.cpp.xml
- odeerrcontrol.xml
- odegear.xml
- odegearcontrol.xml
- old_atomic.xml
- old_mat_mul.cpp.xml
- old_mat_mul.hpp.xml
- old_max_num_threads.xml
- old_reciprocal.cpp.xml
- old_tan.cpp.xml
- old_usead_1.cpp.xml
- old_usead_2.cpp.xml
- omp_alloc.cpp.xml
- omp_alloc.xml
- omp_available.xml
- omp_create_array.xml
- omp_delete_array.xml
- omp_efficient.xml
- omp_free_available.xml
- omp_get_memory.xml
- omp_get_thread_num.xml
- omp_in_parallel.xml
- omp_inuse.xml
- omp_max_num_threads.xml
- omp_max_thread.xml
- omp_return_memory.xml
- opt_val_hes.cpp.xml
- opt_val_hes.xml
- optimize.cpp.xml
- optimize.xml
- par_var.cpp.xml
- parallel_ad.xml
- parvar.xml
- pkgconfig.xml
- poly.cpp.xml
- poly.hpp.xml
- poly.xml
- pow.cpp.xml
- pow.xml
- pow_int.cpp.xml
- pow_int.xml
- preprocessor.xml
- print_for_cout.cpp.xml
- print_for_string.cpp.xml
- printfor.xml
- repeat_det_by_minor_c.xml
- rev_one.cpp.xml
- rev_sparse_hes.cpp.xml
- rev_sparse_jac.cpp.xml
- rev_two.cpp.xml
- reverse.xml
- reverse_any.cpp.xml
- reverse_any.xml
- reverse_identity.xml
- reverse_one.cpp.xml
- reverse_one.xml
- reverse_three.cpp.xml
- reverse_two.cpp.xml
- reverse_two.xml
- reversetheory.xml
- revone.xml
- revsparsehes.xml
- revsparsejac.xml
- revtwo.xml
- romberg_one.cpp.xml
- rombergmul.cpp.xml
- rombergmul.xml
- rombergone.xml
- rosen34.xml
- rosen_34.cpp.xml
- runge45.xml
- runge45_1.cpp.xml
- runge45_2.cpp.xml
- sacado_det_lu.cpp.xml
- sacado_det_minor.cpp.xml
- sacado_mat_mul.cpp.xml
- sacado_ode.cpp.xml
- sacado_poly.cpp.xml
- sacado_prefix.xml
- sacado_sparse_hessian.cpp.xml
- sacado_sparse_jacobian.cpp.xml
- seq_property.cpp.xml
- seq_property.xml
- sign.cpp.xml
- sign.xml
- simple_ad_bthread.cpp.xml
- simple_ad_openmp.cpp.xml
- simple_ad_pthread.cpp.xml
- simple_vector.cpp.xml
- simplevector.xml
- sin.cpp.xml
- sincosforward.xml
- sincosreverse.xml
- sinh.cpp.xml
- size_order.xml
- sparse.xml
- sparse_hes_fun.cpp.xml
- sparse_hes_fun.hpp.xml
- sparse_hes_fun.xml
- sparse_hessian.cpp.xml
- sparse_hessian.xml
- sparse_jac_fun.cpp.xml
- sparse_jac_fun.hpp.xml
- sparse_jac_fun.xml
- sparse_jacobian.cpp.xml
- sparse_jacobian.xml
- speed.xml
- speed_adolc.xml
- speed_cppad.xml
- speed_double.xml
- speed_example.cpp.xml
- speed_fadbad.xml
- speed_main.xml
- speed_program.cpp.xml
- speed_sacado.xml
- speed_test.cpp.xml
- speed_test.xml
- speed_utility.xml
- speedtest.xml
- sqrt.cpp.xml
- sqrtforward.xml
- sqrtreverse.xml
- stack_machine.cpp.xml
- std_math_ad.xml
- sub.cpp.xml
- sub_eq.cpp.xml
- ta_available.xml
- ta_create_array.xml
- ta_delete_array.xml
- ta_free_all.xml
- ta_free_available.xml
- ta_get_memory.xml
- ta_hold_memory.xml
- ta_in_parallel.xml
- ta_inuse.xml
- ta_num_threads.xml
- ta_parallel_setup.xml
- ta_return_memory.xml
- ta_thread_num.xml
- tan.cpp.xml
- tan_forward.xml
- tan_reverse.xml
- tanh.cpp.xml
- tape_index.cpp.xml
- team_bthread.cpp.xml
- team_example.cpp.xml
- team_openmp.cpp.xml
- team_pthread.cpp.xml
- team_thread.hpp.xml
- test_vector.xml
- testvector.xml
- theory.xml
- thread_alloc.cpp.xml
- thread_alloc.xml
- thread_test.cpp.xml
- time_det_by_minor_c.xml
- time_test.cpp.xml
- time_test.xml
- tracknewdel.cpp.xml
- tracknewdel.xml
- unary_minus.cpp.xml
- unary_plus.cpp.xml
- unaryminus.xml
- unaryplus.xml
- uniform_01.hpp.xml
- uniform_01.xml
- uniform_01_c.xml
- value.cpp.xml
- value.xml
- var2par.cpp.xml
- var2par.xml
- vec_ad.cpp.xml
- vecad.xml
- vector_bool.cpp.xml
- whats_new.xml
- whats_new_03.xml
- whats_new_04.xml
- whats_new_05.xml
- whats_new_06.xml
- whats_new_07.xml
- whats_new_08.xml
- whats_new_09.xml
- whats_new_10.xml
- whats_new_11.xml
- whats_new_12.xml
- whats_new_13.xml
- whats_new_14.xml
- wishlist.xml
old_usead_2.cpp.xml @upstream/2015.00.00.7 — raw · history · blame
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 | <?xml version='1.0'?> <html xmlns='http://www.w3.org/1999/xhtml' xmlns:math='http://www.w3.org/1998/Math/MathML' > <head> <title>Using AD to Compute Atomic Function Derivatives</title> <meta http-equiv='Content-Type' content='text/html' charset='utf-8'/> <meta name="description" id="description" content="Using AD to Compute Atomic Function Derivatives"/> <meta name="keywords" id="keywords" content=" using ad to compute atomic function derivatives Ad inside user checkpoint deprecated purpose "/> <style type='text/css'> body { color : black } body { background-color : white } A:link { color : blue } A:visited { color : purple } A:active { color : purple } </style> <script type='text/javascript' language='JavaScript' src='_old_usead_2.cpp_xml.js'> </script> </head> <body> <table><tr> <td> <a href="http://www.coin-or.org/CppAD/" target="_top"><img border="0" src="_image.gif"/></a> </td> <td><a href="old_usead_1.cpp.xml" target="_top">Prev</a> </td><td><a href="old_tan.cpp.xml" target="_top">Next</a> </td><td> <select onchange='choose_across0(this)'> <option>Index-></option> <option>contents</option> <option>reference</option> <option>index</option> <option>search</option> <option>external</option> </select> </td> <td> <select onchange='choose_up0(this)'> <option>Up-></option> <option>CppAD</option> <option>Appendix</option> <option>deprecated</option> <option>old_atomic</option> <option>old_usead_2.cpp</option> </select> </td> <td> <select onchange='choose_down3(this)'> <option>Appendix-></option> <option>Faq</option> <option>Theory</option> <option>glossary</option> <option>Bib</option> <option>Bugs</option> <option>WishList</option> <option>whats_new</option> <option>deprecated</option> <option>compare_c</option> <option>License</option> </select> </td> <td> <select onchange='choose_down2(this)'> <option>deprecated-></option> <option>include_deprecated</option> <option>FunDeprecated</option> <option>omp_max_thread</option> <option>TrackNewDel</option> <option>omp_alloc</option> <option>memory_leak</option> <option>epsilon</option> <option>test_vector</option> <option>cppad_ipopt_nlp</option> <option>old_atomic</option> </select> </td> <td> <select onchange='choose_down1(this)'> <option>old_atomic-></option> <option>old_reciprocal.cpp</option> <option>old_usead_1.cpp</option> <option>old_usead_2.cpp</option> <option>old_tan.cpp</option> <option>old_mat_mul.cpp</option> </select> </td> <td>old_usead_2.cpp</td> <td> <select onchange='choose_current0(this)'> <option>Headings-></option> <option>Deprecated</option> <option>Purpose</option> </select> </td> </tr></table><br/> <center><b><big><big>Using AD to Compute Atomic Function Derivatives</big></big></b></center> <br/> <b><big><a name="Deprecated" id="Deprecated">Deprecated</a></big></b> <br/> This example has been deprecated because it is easier to use the <a href="checkpoint.xml" target="_top"><span style='white-space: nowrap'>checkpoint</span></a> class instead. <br/> <br/> <b><big><a name="Purpose" id="Purpose">Purpose</a></big></b> <br/> Consider the case where an inner function is used repeatedly in the definition of an outer function. In this case, it may reduce the number of variables <a href="seq_property.xml#size_var" target="_top"><span style='white-space: nowrap'>size_var</span></a> , and hence the required memory. <code><font color="blue"> <pre style='display:inline'> # include <cppad/cppad.hpp> namespace { // Begin empty namespace using CppAD::AD; using CppAD::ADFun; using CppAD::vector; // ---------------------------------------------------------------------- // ODE for [t, t^2 / 2 ] in form required by Runge45 class Fun { public: void Ode( const <a href="ad.xml" target="_top">AD</a><double> &t, const vector< <a href="ad.xml" target="_top">AD</a><double> > &z, vector< <a href="ad.xml" target="_top">AD</a><double> > &f) { assert( z.size() == 2 ); assert( f.size() == 2 ); f[0] = 1.0; f[1] = z[0]; } }; // ---------------------------------------------------------------------- // Create function that takes on Runge45 step for the ODE above <a href="funconstruct.xml" target="_top">ADFun</a><double>* r_ptr_; void create_r(void) { size_t n = 3, m = 2; vector< <a href="ad.xml" target="_top">AD</a><double> > x(n), zi(m), y(m), e(m); // The value of x does not matter because the operation sequence // does not depend on x. x[0] = 0.0; // initial value z_0 (t) at t = ti x[1] = 0.0; // initial value z_1 (t) at t = ti x[2] = 0.1; // final time for this integration CppAD::<a href="independent.xml" target="_top">Independent</a>(x); zi[0] = x[0]; // z_0 (t) at t = ti zi[1] = x[1]; // z_1 (t) at t = ti <a href="ad.xml" target="_top">AD</a><double> ti = 0.0; // t does not appear in ODE so does not matter <a href="ad.xml" target="_top">AD</a><double> tf = x[2]; // final time size_t M = 3; // number of Runge45 steps to take Fun F; y = CppAD::Runge45(F, M, ti, tf, zi, e); r_ptr_ = new <a href="funconstruct.xml" target="_top">ADFun</a><double>(x, y); } void destroy_r(void) { delete r_ptr_; r_ptr_ = CPPAD_NULL; } // ---------------------------------------------------------------------- // forward mode routine called by CppAD bool solve_ode_forward( size_t id , size_t k , size_t n , size_t m , const vector<bool>& vx , vector<bool>& vy , const vector<double>& tx , vector<double>& ty ) { assert( id == 0 ); assert( n == 3 ); assert( m == 2 ); assert( k == 0 || vx.size() == 0 ); bool ok = true; vector<double> xp(n), yp(m); size_t i, j; // check for special case if( vx.size() > 0 ) { //Compute r, a Jacobian sparsity pattern. // Use reverse mode because m < n. vector< std::set<size_t> > s(m), r(m); for(i = 0; i < m; i++) s[i].insert(i); r = r_ptr_->RevSparseJac(m, s); std::set<size_t>::const_iterator itr; for(i = 0; i < m; i++) { vy[i] = false; for(itr = s[i].begin(); itr != s[i].end(); itr++) { j = *itr; assert( j < n ); // y[i] depends on the value of x[j] vy[i] |= vx[j]; } } } // make sure r_ has proper lower order Taylor coefficients stored // then compute ty[k] for(size_t q = 0; q <= k; q++) { for(j = 0; j < n; j++) xp[j] = tx[j * (k+1) + q]; yp = r_ptr_->Forward(q, xp); if( q == k ) { for(i = 0; i < m; i++) ty[i * (k+1) + q] = yp[i]; } # ifndef NDEBUG else { for(i = 0; i < m; i++) assert( ty[i * (k+1) + q] == yp[i] ); } # endif } // no longer need the Taylor coefficients in r_ptr_ // (have to reconstruct them every time) r_ptr_->capacity_order(0); return ok; } // ---------------------------------------------------------------------- // reverse mode routine called by CppAD bool solve_ode_reverse( size_t id , size_t k , size_t n , size_t m , const vector<double>& tx , const vector<double>& ty , vector<double>& px , const vector<double>& py ) { assert( id == 0 ); assert( n == 3 ); assert( m == 2 ); bool ok = true; vector<double> xp(n), w( (k+1) * m ), dw( (k+1) * n ); // make sure r_ has proper forward mode coefficients size_t i, j, q; for(q = 0; q <= k; q++) { for(j = 0; j < n; j++) xp[j] = tx[j * (k+1) + q]; # ifdef NDEBUG r_ptr_->Forward(q, xp); # else vector<double> yp(m); yp = r_ptr_->Forward(q, xp); for(i = 0; i < m; i++) assert( ty[i * (k+1) + q] == yp[i] ); # endif } for(i = 0; i < m; i++) { for(q = 0; q <=k; q++) w[ i * (k+1) + q] = py[ i * (k+1) + q]; } dw = r_ptr_->Reverse(k+1, w); for(j = 0; j < n; j++) { for(q = 0; q <=k; q++) px[ j * (k+1) + q] = dw[ j * (k+1) + q]; } // no longer need the Taylor coefficients in r_ptr_ // (have to reconstruct them every time) r_ptr_->capacity_order(0); return ok; } // ---------------------------------------------------------------------- // forward Jacobian sparsity routine called by CppAD bool solve_ode_for_jac_sparse( size_t id , size_t n , size_t m , size_t p , const vector< std::set<size_t> >& r , vector< std::set<size_t> >& s ) { assert( id == 0 ); assert( n == 3 ); assert( m == 2 ); bool ok = true; vector< std::set<size_t> > R(n), S(m); for(size_t j = 0; j < n; j++) R[j] = r[j]; S = r_ptr_->ForSparseJac(p, R); for(size_t i = 0; i < m; i++) s[i] = S[i]; // no longer need the forward mode sparsity pattern // (have to reconstruct them every time) r_ptr_->size_forward_set(0); return ok; } // ---------------------------------------------------------------------- // reverse Jacobian sparsity routine called by CppAD bool solve_ode_rev_jac_sparse( size_t id , size_t n , size_t m , size_t p , vector< std::set<size_t> >& r , const vector< std::set<size_t> >& s ) { assert( id == 0 ); assert( n == 3 ); assert( m == 2 ); bool ok = true; vector< std::set<size_t> > R(p), S(p); std::set<size_t>::const_iterator itr; size_t i; // untranspose s for(i = 0; i < m; i++) { for(itr = s[i].begin(); itr != s[i].end(); itr++) S[*itr].insert(i); } R = r_ptr_->RevSparseJac(p, S); // transpose r for(i = 0; i < m; i++) r[i].clear(); for(i = 0; i < p; i++) { for(itr = R[i].begin(); itr != R[i].end(); itr++) r[*itr].insert(i); } return ok; } // ---------------------------------------------------------------------- // reverse Hessian sparsity routine called by CppAD bool solve_ode_rev_hes_sparse( size_t id , size_t n , size_t m , size_t p , const vector< std::set<size_t> >& r , const vector<bool>& s , vector<bool>& t , const vector< std::set<size_t> >& u , vector< std::set<size_t> >& v ) { // Can just return false if not use RevSparseHes. assert( id == 0 ); assert( n == 3 ); assert( m == 2 ); bool ok = true; std::set<size_t>::const_iterator itr; // compute sparsity pattern for T(x) = S(x) * f'(x) vector< std::set<size_t> > S(1); size_t i, j; S[0].clear(); for(i = 0; i < m; i++) if( s[i] ) S[0].insert(i); t = r_ptr_->RevSparseJac(1, s); // compute sparsity pattern for A(x)^T = U(x)^T * f'(x) vector< std::set<size_t> > Ut(p), At(p); for(i = 0; i < m; i++) { for(itr = u[i].begin(); itr != u[i].end(); itr++) Ut[*itr].insert(i); } At = r_ptr_->RevSparseJac(p, Ut); // compute sparsity pattern for H(x)^T = R^T * (S * F)''(x) vector< std::set<size_t> > R(n), Ht(p); for(j = 0; j < n; j++) R[j] = r[j]; r_ptr_->ForSparseJac(p, R); Ht = r_ptr_->RevSparseHes(p, S); // compute sparsity pattern for V(x) = A(x) + H(x)^T for(j = 0; j < n; j++) v[j].clear(); for(i = 0; i < p; i++) { for(itr = At[i].begin(); itr != At[i].end(); itr++) v[*itr].insert(i); for(itr = Ht[i].begin(); itr != Ht[i].end(); itr++) v[*itr].insert(i); } // no longer need the forward mode sparsity pattern // (have to reconstruct them every time) r_ptr_->size_forward_set(0); return ok; } // --------------------------------------------------------------------- // Declare the <a href="ad.xml" target="_top">AD</a><double> routine solve_ode(id, ax, ay) CPPAD_USER_ATOMIC( solve_ode , CppAD::vector , double , solve_ode_forward , solve_ode_reverse , solve_ode_for_jac_sparse , solve_ode_rev_jac_sparse , solve_ode_rev_hes_sparse ) } // End empty namespace bool old_usead_2(void) { bool ok = true; using CppAD::NearEqual; double eps = 10. * CppAD::numeric_limits<double>::epsilon(); // -------------------------------------------------------------------- // Create the <a href="funconstruct.xml" target="_top">ADFun</a><doulbe> r_ create_r(); // -------------------------------------------------------------------- // domain and range space vectors size_t n = 3, m = 2; vector< <a href="ad.xml" target="_top">AD</a><double> > au(n), ax(n), ay(m); au[0] = 0.0; // value of z_0 (t) = t, at t = 0 ax[1] = 0.0; // value of z_1 (t) = t^2/2, at t = 0 au[2] = 1.0; // final t CppAD::<a href="independent.xml" target="_top">Independent</a>(au); size_t M = 2; // number of r steps to take ax[0] = au[0]; // value of z_0 (t) = t, at t = 0 ax[1] = au[1]; // value of z_1 (t) = t^2/2, at t = 0 <a href="ad.xml" target="_top">AD</a><double> dt = au[2] / M; // size of each r step ax[2] = dt; for(size_t i_step = 0; i_step < M; i_step++) { size_t id = 0; // not used solve_ode(id, ax, ay); ax[0] = ay[0]; ax[1] = ay[1]; } // create f: u -> y and stop tape recording // y_0(t) = u_0 + t = u_0 + u_2 // y_1(t) = u_1 + u_0 * t + t^2 / 2 = u_1 + u_0 * u_2 + u_2^2 / 2 // where t = u_2 <a href="funconstruct.xml" target="_top">ADFun</a><double> f; f.Dependent(au, ay); // -------------------------------------------------------------------- // Check forward mode results // // zero order forward vector<double> up(n), yp(m); size_t q = 0; double u0 = 0.5; double u1 = 0.25; double u2 = 0.75; double check; up[0] = u0; up[1] = u1; up[2] = u2; yp = f.<a href="forward.xml" target="_top">Forward</a>(q, up); check = u0 + u2; ok &= <a href="nearequal.xml" target="_top">NearEqual</a>( yp[0], check, eps, eps); check = u1 + u0 * u2 + u2 * u2 / 2.0; ok &= <a href="nearequal.xml" target="_top">NearEqual</a>( yp[1], check, eps, eps); // // forward mode first derivative w.r.t t q = 1; up[0] = 0.0; up[1] = 0.0; up[2] = 1.0; yp = f.<a href="forward.xml" target="_top">Forward</a>(q, up); check = 1.0; ok &= <a href="nearequal.xml" target="_top">NearEqual</a>( yp[0], check, eps, eps); check = u0 + u2; ok &= <a href="nearequal.xml" target="_top">NearEqual</a>( yp[1], check, eps, eps); // // forward mode second order Taylor coefficient w.r.t t q = 2; up[0] = 0.0; up[1] = 0.0; up[2] = 0.0; yp = f.<a href="forward.xml" target="_top">Forward</a>(q, up); check = 0.0; ok &= <a href="nearequal.xml" target="_top">NearEqual</a>( yp[0], check, eps, eps); check = 1.0 / 2.0; ok &= <a href="nearequal.xml" target="_top">NearEqual</a>( yp[1], check, eps, eps); // -------------------------------------------------------------------- // reverse mode derivatives of \partial_t y_1 (t) vector<double> w(m * q), dw(n * q); w[0 * q + 0] = 0.0; w[1 * q + 0] = 0.0; w[0 * q + 1] = 0.0; w[1 * q + 1] = 1.0; dw = f.<a href="reverse.xml" target="_top">Reverse</a>(q, w); // derivative of y_1(u) = u_1 + u_0 * u_2 + u_2^2 / 2, w.r.t. u // is equal deritative of \partial_u2 y_1(u) w.r.t \partial_u2 u check = u2; ok &= <a href="nearequal.xml" target="_top">NearEqual</a>( dw[0 * q + 1], check, eps, eps); check = 1.0; ok &= <a href="nearequal.xml" target="_top">NearEqual</a>( dw[1 * q + 1], check, eps, eps); check = u0 + u2; ok &= <a href="nearequal.xml" target="_top">NearEqual</a>( dw[2 * q + 1], check, eps, eps); // derivative of \partial_t y_1 w.r.t u = u_0 + t, w.r.t u check = 1.0; ok &= <a href="nearequal.xml" target="_top">NearEqual</a>( dw[0 * q + 0], check, eps, eps); check = 0.0; ok &= <a href="nearequal.xml" target="_top">NearEqual</a>( dw[1 * q + 0], check, eps, eps); check = 1.0; ok &= <a href="nearequal.xml" target="_top">NearEqual</a>( dw[2 * q + 0], check, eps, eps); // -------------------------------------------------------------------- // forward mode sparsity pattern for the Jacobian // f_u = [ 1, 0, 1 ] // [ u_2, 1, u_2 ] size_t i, j, p = n; CppAD::vectorBool r(n * p), s(m * p); // r = identity sparsity pattern for(i = 0; i < n; i++) for(j = 0; j < p; j++) r[i*n +j] = (i == j); s = f.ForSparseJac(p, r); ok &= s[ 0 * p + 0] == true; ok &= s[ 0 * p + 1] == false; ok &= s[ 0 * p + 2] == true; ok &= s[ 1 * p + 0] == true; ok &= s[ 1 * p + 1] == true; ok &= s[ 1 * p + 2] == true; // -------------------------------------------------------------------- // reverse mode sparsity pattern for the Jacobian q = m; s.resize(q * m); r.resize(q * n); // s = identity sparsity pattern for(i = 0; i < q; i++) for(j = 0; j < m; j++) s[i*m +j] = (i == j); r = f.RevSparseJac(q, s); ok &= r[ 0 * n + 0] == true; ok &= r[ 0 * n + 1] == false; ok &= r[ 0 * n + 2] == true; ok &= r[ 1 * n + 0] == true; ok &= r[ 1 * n + 1] == true; ok &= r[ 1 * n + 2] == true; // -------------------------------------------------------------------- // Hessian sparsity for y_1 (u) = u_1 + u_0 * u_2 + u_2^2 / 2 s.resize(m); s[0] = false; s[1] = true; r.resize(n * n); for(i = 0; i < n; i++) for(j = 0; j < n; j++) r[ i * n + j ] = (i == j); CppAD::vectorBool h(n * n); h = f.RevSparseHes(n, s); ok &= h[0 * n + 0] == false; ok &= h[0 * n + 1] == false; ok &= h[0 * n + 2] == true; ok &= h[1 * n + 0] == false; ok &= h[1 * n + 1] == false; ok &= h[1 * n + 2] == false; ok &= h[2 * n + 0] == true; ok &= h[2 * n + 1] == false; ok &= h[2 * n + 2] == true; // -------------------------------------------------------------------- destroy_r(); // Free all temporary work space associated with old_atomic objects. // (If there are future calls to user atomic functions, they will // create new temporary work space.) CppAD::user_atomic<double>::clear(); return ok; } </pre> </font></code> <hr/>Input File: example/atomic/old_usead_2.cpp </body> </html> |