blob: 2c716ca118c3b55ffb2364d2367bd58c607b99dc (
plain)
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
|
/*
Copyright 2011-2012 Mario Mulansky
Copyright 2012-2013 Karsten Ahnert
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or
copy at http://www.boost.org/LICENSE_1_0.txt)
*/
/* example showing how odeint can be used with std::list */
#include <iostream>
#include <cmath>
#include <list>
#include <boost/numeric/odeint.hpp>
//[ list_bindings
typedef std::list< double > state_type;
namespace boost { namespace numeric { namespace odeint {
template< >
struct is_resizeable< state_type >
{ // declare resizeability
typedef boost::true_type type;
const static bool value = type::value;
};
template< >
struct same_size_impl< state_type , state_type >
{ // define how to check size
static bool same_size( const state_type &v1 ,
const state_type &v2 )
{
return v1.size() == v2.size();
}
};
template< >
struct resize_impl< state_type , state_type >
{ // define how to resize
static void resize( state_type &v1 ,
const state_type &v2 )
{
v1.resize( v2.size() );
}
};
} } }
//]
void lattice( const state_type &x , state_type &dxdt , const double /* t */ )
{
state_type::const_iterator x_begin = x.begin();
state_type::const_iterator x_end = x.end();
state_type::iterator dxdt_begin = dxdt.begin();
x_end--; // stop one before last
while( x_begin != x_end )
{
*(dxdt_begin++) = std::sin( *(x_begin) - *(x_begin++) );
}
*dxdt_begin = sin( *x_begin - *(x.begin()) ); // periodic boundary
}
using namespace boost::numeric::odeint;
int main()
{
const int N = 32;
state_type x;
for( int i=0 ; i<N ; ++i )
x.push_back( 1.0*i/N );
integrate_const( runge_kutta4< state_type >() , lattice , x , 0.0 , 10.0 , 0.1 );
}
|
