Chris@16
|
1 /*
|
Chris@16
|
2 [auto_generated]
|
Chris@16
|
3 boost/numeric/odeint/integrate/integrate_n_steps.hpp
|
Chris@16
|
4
|
Chris@16
|
5 [begin_description]
|
Chris@16
|
6 Integration of n steps with constant time size. Adaptive and dense-output methods are fully supported.
|
Chris@16
|
7 [end_description]
|
Chris@16
|
8
|
Chris@16
|
9 Copyright 2009-2011 Karsten Ahnert
|
Chris@16
|
10 Copyright 2009-2011 Mario Mulansky
|
Chris@16
|
11
|
Chris@16
|
12 Distributed under the Boost Software License, Version 1.0.
|
Chris@16
|
13 (See accompanying file LICENSE_1_0.txt or
|
Chris@16
|
14 copy at http://www.boost.org/LICENSE_1_0.txt)
|
Chris@16
|
15 */
|
Chris@16
|
16
|
Chris@16
|
17
|
Chris@16
|
18 #ifndef BOOST_NUMERIC_ODEINT_INTEGRATE_INTEGRATE_N_STEPS_HPP_INCLUDED
|
Chris@16
|
19 #define BOOST_NUMERIC_ODEINT_INTEGRATE_INTEGRATE_N_STEPS_HPP_INCLUDED
|
Chris@16
|
20
|
Chris@16
|
21 #include <boost/type_traits/is_same.hpp>
|
Chris@16
|
22
|
Chris@16
|
23 #include <boost/numeric/odeint/stepper/stepper_categories.hpp>
|
Chris@16
|
24 #include <boost/numeric/odeint/integrate/null_observer.hpp>
|
Chris@16
|
25 #include <boost/numeric/odeint/integrate/detail/integrate_n_steps.hpp>
|
Chris@16
|
26
|
Chris@16
|
27 namespace boost {
|
Chris@16
|
28 namespace numeric {
|
Chris@16
|
29 namespace odeint {
|
Chris@16
|
30
|
Chris@16
|
31
|
Chris@16
|
32 /*
|
Chris@16
|
33 * Integrates n steps
|
Chris@16
|
34 *
|
Chris@16
|
35 * the two overloads are needed in order to solve the forwarding problem
|
Chris@16
|
36 */
|
Chris@16
|
37 template< class Stepper , class System , class State , class Time , class Observer>
|
Chris@16
|
38 Time integrate_n_steps(
|
Chris@16
|
39 Stepper stepper , System system , State &start_state ,
|
Chris@16
|
40 Time start_time , Time dt , size_t num_of_steps ,
|
Chris@16
|
41 Observer observer )
|
Chris@16
|
42 {
|
Chris@16
|
43
|
Chris@16
|
44 return detail::integrate_n_steps(
|
Chris@16
|
45 stepper , system , start_state ,
|
Chris@16
|
46 start_time , dt , num_of_steps ,
|
Chris@16
|
47 observer , typename Stepper::stepper_category() );
|
Chris@16
|
48 }
|
Chris@16
|
49
|
Chris@16
|
50 /**
|
Chris@16
|
51 * \brief Solves the forwarding problem, can be called with Boost.Range as start_state.
|
Chris@16
|
52 */
|
Chris@16
|
53 template< class Stepper , class System , class State , class Time , class Observer >
|
Chris@16
|
54 Time integrate_n_steps(
|
Chris@16
|
55 Stepper stepper , System system , const State &start_state ,
|
Chris@16
|
56 Time start_time , Time dt , size_t num_of_steps ,
|
Chris@16
|
57 Observer observer )
|
Chris@16
|
58 {
|
Chris@16
|
59 return detail::integrate_n_steps(
|
Chris@16
|
60 stepper , system , start_state ,
|
Chris@16
|
61 start_time , dt , num_of_steps ,
|
Chris@16
|
62 observer , typename Stepper::stepper_category() );
|
Chris@16
|
63 }
|
Chris@16
|
64
|
Chris@16
|
65
|
Chris@16
|
66 /**
|
Chris@16
|
67 * \brief The same function as above, but without observer calls.
|
Chris@16
|
68 */
|
Chris@16
|
69 template< class Stepper , class System , class State , class Time >
|
Chris@16
|
70 Time integrate_n_steps(
|
Chris@16
|
71 Stepper stepper , System system , State &start_state ,
|
Chris@16
|
72 Time start_time , Time dt , size_t num_of_steps )
|
Chris@16
|
73 {
|
Chris@16
|
74 return integrate_n_steps( stepper , system , start_state , start_time , dt , num_of_steps , null_observer() );
|
Chris@16
|
75 }
|
Chris@16
|
76
|
Chris@16
|
77 /**
|
Chris@16
|
78 * \brief Solves the forwarding problem, can be called with Boost.Range as start_state.
|
Chris@16
|
79 */
|
Chris@16
|
80 template< class Stepper , class System , class State , class Time >
|
Chris@16
|
81 Time integrate_n_steps(
|
Chris@16
|
82 Stepper stepper , System system , const State &start_state ,
|
Chris@16
|
83 Time start_time , Time dt , size_t num_of_steps )
|
Chris@16
|
84 {
|
Chris@16
|
85 return integrate_n_steps( stepper , system , start_state , start_time , dt , num_of_steps , null_observer() );
|
Chris@16
|
86 }
|
Chris@16
|
87
|
Chris@16
|
88
|
Chris@16
|
89
|
Chris@16
|
90 /************* DOXYGEN *************/
|
Chris@16
|
91 /**
|
Chris@16
|
92 * \fn Time integrate_n_steps( Stepper stepper , System system , State &start_state , Time start_time , Time dt , size_t num_of_steps , Observer observer )
|
Chris@16
|
93 * \brief Integrates the ODE with constant step size.
|
Chris@16
|
94 *
|
Chris@16
|
95 * This function is similar to integrate_const. The observer is called at
|
Chris@16
|
96 * equidistant time intervals t0 + n*dt.
|
Chris@16
|
97 * If the Stepper is a normal stepper without step size control, dt is also
|
Chris@16
|
98 * used for the numerical scheme. If a ControlledStepper is provided, the
|
Chris@16
|
99 * algorithm might reduce the step size to meet the error bounds, but it is
|
Chris@16
|
100 * ensured that the observer is always called at equidistant time points
|
Chris@16
|
101 * t0 + n*dt. If a DenseOutputStepper is used, the step size also may vary
|
Chris@16
|
102 * and the dense output is used to call the observer at equidistant time
|
Chris@16
|
103 * points. The final integration time is always t0 + num_of_steps*dt.
|
Chris@16
|
104 *
|
Chris@16
|
105 * \param stepper The stepper to be used for numerical integration.
|
Chris@16
|
106 * \param system Function/Functor defining the rhs of the ODE.
|
Chris@16
|
107 * \param start_state The initial condition x0.
|
Chris@16
|
108 * \param start_time The initial time t0.
|
Chris@16
|
109 * \param dt The time step between observer calls, _not_ necessarily the
|
Chris@16
|
110 * time step of the integration.
|
Chris@16
|
111 * \param num_of_steps Number of steps to be performed
|
Chris@16
|
112 * \param observer Function/Functor called at equidistant time intervals.
|
Chris@16
|
113 * \return The number of steps performed.
|
Chris@16
|
114 */
|
Chris@16
|
115
|
Chris@16
|
116
|
Chris@16
|
117
|
Chris@16
|
118 } // namespace odeint
|
Chris@16
|
119 } // namespace numeric
|
Chris@16
|
120 } // namespace boost
|
Chris@16
|
121
|
Chris@16
|
122
|
Chris@16
|
123
|
Chris@16
|
124 #endif // BOOST_NUMERIC_ODEINT_INTEGRATE_INTEGRATE_N_STEPS_HPP_INCLUDED
|