1 files changed, 0 insertions, 98 deletions
diff --git a/libs/numeric/odeint/performance/openmp/osc_chain_1d_system.hpp b/libs/numeric/odeint/performance/openmp/osc_chain_1d_system.hpp
deleted file mode 100644
index d9a6c222d..000000000
--- a/libs/numeric/odeint/performance/openmp/osc_chain_1d_system.hpp
+++ /dev/null
@@ -1,98 +0,0 @@
-/* Boost libs/numeric/odeint/performance/openmp/osc_chain_1d_system.hpp
-
- Copyright 2013 Karsten Ahnert
- Copyright 2013 Mario Mulansky
- Copyright 2013 Pascal Germroth
-
- stronlgy nonlinear hamiltonian lattice
-
- 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)
- */
-
-#ifndef SYSTEM_HPP
-#define SYSTEM_HPP
-
-#include <vector>
-#include <cmath>
-#include <iostream>
-
-#include <omp.h>
-
-#include <boost/math/special_functions/sign.hpp>
-#include <boost/numeric/odeint/external/openmp/openmp.hpp>
-
-namespace checked_math {
-    inline double pow( double x , double y )
-    {
-        if( x==0.0 )
-            // 0**y = 0, don't care for y = 0 or NaN
-            return 0.0;
-        using std::pow;
-        using std::abs;
-        return pow( abs(x) , y );
-    }
-}
-
-double signed_pow( double x , double k )
-{
-    using boost::math::sign;
-    return checked_math::pow( x , k ) * sign(x);
-}
-
-struct osc_chain {
-
-    const double m_kap, m_lam;
-
-    osc_chain( const double kap , const double lam )
-        : m_kap( kap ) , m_lam( lam )
-    { }
-
-    // Simple case with openmp_range_algebra
-    void operator()( const std::vector<double> &q ,
-                           std::vector<double> &dpdt ) const
-    {
-        const size_t N = q.size();
-        double coupling_lr = 0;
-        size_t last_i = N;
-        #pragma omp parallel for firstprivate(coupling_lr, last_i) lastprivate(coupling_lr) schedule(runtime)
-        for(size_t i = 0 ; i < N - 1 ; ++i)
-        {
-            if(i > 0 && i != last_i + 1)
-                coupling_lr = signed_pow( q[i-1]-q[i] , m_lam-1 );
-            dpdt[i] = -signed_pow( q[i] , m_kap-1 ) + coupling_lr;
-            coupling_lr = signed_pow( q[i] - q[i+1] , m_lam-1 );
-            dpdt[i] -= coupling_lr;
-            last_i = i;
-        }
-        dpdt[N-1] = -signed_pow( q[N-1] , m_kap-1 ) + coupling_lr;
-    }
-
-    // Split case with openmp_algebra
-    void operator()( const boost::numeric::odeint::openmp_state<double> &q ,
-                           boost::numeric::odeint::openmp_state<double> &dpdt ) const
-    {
-        const size_t M = q.size();
-        #pragma omp parallel for schedule(runtime)
-        for(size_t i = 0 ; i < M ; ++i)
-        {
-            const std::vector<double> &_q = q[i];
-            std::vector<double> &_dpdt = dpdt[i];
-            const size_t N = q[i].size();
-            double coupling_lr = 0;
-            if(i > 0) coupling_lr = signed_pow( q[i-1].back() - _q[0] , m_lam-1 );
-            for(size_t j = 0 ; j < N-1 ; ++j)
-            {
-                _dpdt[j] = -signed_pow( _q[j] , m_kap-1 ) + coupling_lr;
-                coupling_lr = signed_pow( _q[j] - _q[j+1] , m_lam-1 );
-                _dpdt[j] -= coupling_lr;
-            }
-            _dpdt[N-1] = -signed_pow( _q[N-1] , m_kap-1 ) + coupling_lr;
-            if(i + 1 < M) _dpdt[N-1] -= signed_pow( _q[N-1] - q[i+1].front() , m_lam-1 );
-        }
-    }
-
-};
-
-#endif