mirror of
https://github.com/boostorg/odeint.git
synced 2025-05-11 13:34:09 +00:00
updated copyright years
This commit is contained in:
parent
f5ee194e7c
commit
4b7c39cbb6
@ -6,7 +6,7 @@
|
||||
integrate steps implementation
|
||||
[end_description]
|
||||
|
||||
Copyright 2012 Mario Mulansky
|
||||
Copyright 2012-2015 Mario Mulansky
|
||||
Copyright 2012 Christoph Koke
|
||||
Copyright 2012 Karsten Ahnert
|
||||
|
||||
|
@ -7,7 +7,7 @@
|
||||
[end_description]
|
||||
|
||||
Copyright 2011-2013 Karsten Ahnert
|
||||
Copyright 2011-2012 Mario Mulansky
|
||||
Copyright 2011-2015 Mario Mulansky
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0.
|
||||
(See accompanying file LICENSE_1_0.txt or
|
||||
|
@ -168,7 +168,8 @@ size_t integrate_const(
|
||||
* \param dt The time step between observer calls, _not_ necessarily the
|
||||
* time step of the integration.
|
||||
* \param observer [optional] Function/Functor called at equidistant time intervals.
|
||||
* \param checker [optional] Functor to check for step count overflows.
|
||||
* \param checker [optional] Functor to check for step count overflows, if no
|
||||
* checker is provided, no exception is thrown.
|
||||
* \return The number of steps performed.
|
||||
*/
|
||||
|
||||
|
@ -7,7 +7,7 @@
|
||||
[end_description]
|
||||
|
||||
Copyright 2011-2013 Karsten Ahnert
|
||||
Copyright 2011-2012 Mario Mulansky
|
||||
Copyright 2011-2015 Mario Mulansky
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0.
|
||||
(See accompanying file LICENSE_1_0.txt or
|
||||
@ -127,6 +127,11 @@ Time integrate_n_steps(
|
||||
* t0 + n*dt. If a DenseOutputStepper is used, the step size also may vary
|
||||
* and the dense output is used to call the observer at equidistant time
|
||||
* points. The final integration time is always t0 + num_of_steps*dt.
|
||||
* If a max_step_checker is provided as StepOverflowChecker, an exception is
|
||||
* thrown if too many steps (default: 500) are performed without progress,
|
||||
* i.e. in between observer calls. If no checker is provided, no such
|
||||
* overflow check is performed.
|
||||
|
||||
*
|
||||
* \param stepper The stepper to be used for numerical integration.
|
||||
* \param system Function/Functor defining the rhs of the ODE.
|
||||
@ -136,6 +141,8 @@ Time integrate_n_steps(
|
||||
* time step of the integration.
|
||||
* \param num_of_steps Number of steps to be performed
|
||||
* \param observer Function/Functor called at equidistant time intervals.
|
||||
* \param checker [optional] Functor to check for step count overflows, if no
|
||||
* checker is provided, no exception is thrown.
|
||||
* \return The number of steps performed.
|
||||
*/
|
||||
|
||||
|
@ -7,7 +7,7 @@
|
||||
[end_description]
|
||||
|
||||
Copyright 2011-2013 Karsten Ahnert
|
||||
Copyright 2011-2012 Mario Mulansky
|
||||
Copyright 2011-2015 Mario Mulansky
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0.
|
||||
(See accompanying file LICENSE_1_0.txt or
|
||||
@ -173,6 +173,10 @@ size_t integrate_times(
|
||||
* If a DenseOutputStepper is provided, the dense output functionality is
|
||||
* used to call the observer at the given times. The end time of the
|
||||
* integration is always *(end_time-1).
|
||||
* If a max_step_checker is provided as StepOverflowChecker, an exception is
|
||||
* thrown if too many steps (default: 500) are performed without progress,
|
||||
* i.e. in between observer calls. If no checker is provided, no such
|
||||
* overflow check is performed.
|
||||
*
|
||||
* \param stepper The stepper to be used for numerical integration.
|
||||
* \param system Function/Functor defining the rhs of the ODE.
|
||||
@ -182,6 +186,8 @@ size_t integrate_times(
|
||||
* \param dt The time step between observer calls, _not_ necessarily the
|
||||
* time step of the integration.
|
||||
* \param observer Function/Functor called at equidistant time intervals.
|
||||
* \param checker [optional] Functor to check for step count overflows, if no
|
||||
* checker is provided, no exception is thrown.
|
||||
* \return The number of steps performed.
|
||||
*/
|
||||
|
||||
|
@ -6,7 +6,7 @@
|
||||
Implementaiton of the Burlish-Stoer method with dense output
|
||||
[end_description]
|
||||
|
||||
Copyright 2011-2013 Mario Mulansky
|
||||
Copyright 2011-2015 Mario Mulansky
|
||||
Copyright 2011-2013 Karsten Ahnert
|
||||
Copyright 2012 Christoph Koke
|
||||
|
||||
|
@ -8,7 +8,7 @@
|
||||
[end_description]
|
||||
|
||||
Copyright 2011-2013 Karsten Ahnert
|
||||
Copyright 2011-2012 Mario Mulansky
|
||||
Copyright 2011-2015 Mario Mulansky
|
||||
Copyright 2012 Christoph Koke
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0.
|
||||
|
@ -7,7 +7,7 @@
|
||||
[end_description]
|
||||
|
||||
Copyright 2011-2012 Karsten Ahnert
|
||||
Copyright 2011-2012 Mario Mulansky
|
||||
Copyright 2011-2015 Mario Mulansky
|
||||
Copyright 2012 Christoph Koke
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0.
|
||||
|
Loading…
x
Reference in New Issue
Block a user