-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBioFVM_solvers.cpp
More file actions
174 lines (143 loc) · 7.31 KB
/
Copy pathBioFVM_solvers.cpp
File metadata and controls
174 lines (143 loc) · 7.31 KB
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
/*
#############################################################################
# If you use BioFVM in your project, please cite BioFVM and the version #
# number, such as below: #
# #
# We solved the diffusion equations using BioFVM (Version 1.1.6) [1] #
# #
# [1] A. Ghaffarizadeh, S.H. Friedman, and P. Macklin, BioFVM: an efficient #
# parallelized diffusive transport solver for 3-D biological simulations,#
# Bioinformatics 32(8): 1256-8, 2016. DOI: 10.1093/bioinformatics/btv730 #
# #
#############################################################################
# #
# BSD 3-Clause License (see https://opensource.org/licenses/BSD-3-Clause) #
# #
# Copyright (c) 2015-2017, Paul Macklin and the BioFVM Project #
# All rights reserved. #
# #
# Redistribution and use in source and binary forms, with or without #
# modification, are permitted provided that the following conditions are #
# met: #
# #
# 1. Redistributions of source code must retain the above copyright notice, #
# this list of conditions and the following disclaimer. #
# #
# 2. Redistributions in binary form must reproduce the above copyright #
# notice, this list of conditions and the following disclaimer in the #
# documentation and/or other materials provided with the distribution. #
# #
# 3. Neither the name of the copyright holder nor the names of its #
# contributors may be used to endorse or promote products derived from this #
# software without specific prior written permission. #
# #
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS #
# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED #
# TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A #
# PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER #
# OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, #
# EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, #
# PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR #
# PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF #
# LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING #
# NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS #
# SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. #
# #
#############################################################################
*/
#include "BioFVM_solvers.h"
#include "BioFVM_vector.h"
#include <iostream>
#include <omp.h>
namespace BioFVM{
void diffusion_decay_solver__constant_coefficients_explicit( Microenvironment& M, double dt )
{
static bool precomputations_and_constants_done = false;
if( !precomputations_and_constants_done )
{
std::cout << std::endl << "Using solver: " << __FUNCTION__ << std::endl
<< " (constant diffusion coefficient with explicit stepping, implicit decay) ... " << std::endl << std::endl;
if( M.mesh.uniform_mesh == true )
{
std::cout << "Uniform mesh detected! Consider switching to a more efficient method, such as " << std::endl
<< " diffusion_decay_solver__constant_coefficients_explicit_uniform_mesh" << std::endl
<< std::endl;
}
precomputations_and_constants_done = true;
}
return;
}
void diffusion_decay_solver__constant_coefficients_explicit_uniform_mesh( Microenvironment& M, double dt )
{
static bool precomputations_and_constants_done = false;
if( !precomputations_and_constants_done )
{
std::cout << std::endl << "Using solver: " << __FUNCTION__ << std::endl
<< " (constant diffusion coefficient with explicit stepping, implicit decay, uniform mesh) ... " << std::endl << std::endl;
if( M.mesh.uniform_mesh == false )
{ std::cout << "Error. This code is only supported for uniform meshes." << std::endl; }
precomputations_and_constants_done = true;
}
return;
}
void diffusion_decay_explicit_uniform_rates( Microenvironment& M, double dt )
{
using std::vector;
using std::cout;
using std::endl;
static int n_jump_i = M.mesh.y_coordinates.size() * M.mesh.z_coordinates.size();
static int n_jump_j = M.mesh.z_coordinates.size();
static int n_jump_k = 1;
if( !M.diffusion_solver_setup_done )
{
M.thomas_i_jump = M.mesh.y_coordinates.size() * M.mesh.z_coordinates.size();
M.thomas_j_jump = M.mesh.z_coordinates.size();
M.thomas_k_jump = 1;
M.diffusion_solver_setup_done = true;
}
if( M.mesh.uniform_mesh == false )
{
cout << "Error: This algorithm is written for uniform Cartesian meshes. Try: something else" << endl << endl;
return;
}
// double buffering to reduce memory copy / allocation overhead
static vector<double >* pNew = &(M.temporary_density_vectors1);
static vector<double >* pOld = &(M.temporary_density_vectors2);
// swap the buffers
vector<double >* pTemp = pNew;
pNew = pOld;
pOld = pTemp;
M.p_density_vectors = pNew;
static bool reaction_diffusion_shortcuts_are_set = false;
static vector<double> constant1 = (1.0 / ( M.mesh.dx * M.mesh.dx )) * M.diffusion_coefficients;
static vector<double> constant2 = dt * constant1;
static vector<double> constant3 = M.one + dt * M.decay_rates;
static vector<double> constant4 = M.one - dt * M.decay_rates;
int n_den = M.number_of_densities();
#pragma omp parallel for
for( int i=0; i < M.mesh.voxels.size() ; i++ )
{
int number_of_neighbors = M.mesh.connected_voxel_indices[i].size();
double d1 = -1.0 * number_of_neighbors;
int index = i * n_den;
for (int d = 0; d < n_den; ++d)
(*pNew)[index + d] = (*pOld)[index + d];
for (int d = 0; d < n_den; ++d)
(*pNew)[index + d] *= constant4[d];
for( int j=0; j < number_of_neighbors ; j++ )
{
//axpy( &(*pNew)[i], constant2, (*pOld)[ M.mesh.connected_voxel_indices[i][j] ] );
for (int d = 0; d < n_den; ++d)
(*pNew)[index+d] += constant2[d] * (*pOld)[ M.mesh.connected_voxel_indices[i][j] *n_den];
}
vector<double> temp = constant2;
temp *= d1;
//axpy( &(*pNew)[i] , temp , (*pOld)[i] );
for (int d = 0; d < n_den; ++d)
(*pNew)[index+d] += constant2[d] * (*pOld)[index];
}
// reset gradient vectors
// M.reset_all_gradient_vectors();
return;
}
};