Newer
Older
/***************************************************************************
tnlIterativeSolver_impl.h - description
-------------------
begin : Oct 19, 2012
copyright : (C) 2012 by Tomas Oberhuber
email : tomas.oberhuber@fjfi.cvut.cz
***************************************************************************/
/***************************************************************************
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
***************************************************************************/
#ifndef TNLITERATIVESOLVER_IMPL_H_
#define TNLITERATIVESOLVER_IMPL_H_
#include <float.h>
template< typename Real, typename Index >
tnlIterativeSolver< Real, Index> :: tnlIterativeSolver()
: maxIterations( 100000 ),
minIterations( 0 ),
divergenceResidue( DBL_MAX ),
currentResidue( 0 ),
solverMonitor( 0 ),
refreshRate( 1 )
{
};
template< typename Real, typename Index >
void tnlIterativeSolver< Real, Index> :: configSetup( tnlConfigDescription& config,
const tnlString& prefix )
{
config.addEntry< int > ( prefix + "max-iterations", "Maximal number of iterations the solver may perform.", 100000 );
config.addEntry< int > ( prefix + "min-iterations", "Minimal number of iterations the solver must perform.", 0 );
config.addEntry< double >( prefix + "convergence-residue", "Convergence occurs when the residue drops bellow this limit.", 1.0e-6 );
config.addEntry< double >( prefix + "divergence-residue", "Divergence occurs when the residue exceeds given limit.", DBL_MAX );
config.addEntry< int > ( prefix + "refresh-rate", "Number of iterations between solver monitor refreshes.", 1 );
}
template< typename Real, typename Index >
bool tnlIterativeSolver< Real, Index> :: init( const tnlParameterContainer& parameters,
const tnlString& prefix )
{
this->setMaxIterations( parameters.GetParameter< int >( "max-iterations" ) );
this->setMinIterations( parameters.GetParameter< int >( "min-iterations" ) );
this->setConvergenceResidue( parameters.GetParameter< double >( "convergence-residue" ) );
this->setDivergenceResidue( parameters.GetParameter< double >( "divergence-residue" ) );
this->setRefreshRate( parameters.GetParameter< int >( "refresh-rate" ) );
}
template< typename Real, typename Index >
void tnlIterativeSolver< Real, Index> :: setMaxIterations( const Index& maxIterations )
{
this -> maxIterations = maxIterations;
}
template< typename Real, typename Index >
const Index& tnlIterativeSolver< Real, Index> :: getMaxIterations() const
{
return this -> maxIterations;
}
template< typename Real, typename Index >
void tnlIterativeSolver< Real, Index> :: setMinIterations( const Index& minIterations )
{
this -> minIterations = minIterations;
}
template< typename Real, typename Index >
const Index& tnlIterativeSolver< Real, Index> :: getMinIterations() const
{
return this -> minIterations;
}
template< typename Real, typename Index >
void tnlIterativeSolver< Real, Index> :: resetIterations()
{
this -> currentIteration = 0;
}
template< typename Real, typename Index >
bool tnlIterativeSolver< Real, Index> :: nextIteration()
{
if( this->solverMonitor &&
this->currentIteration % this->refreshRate == 0 )
solverMonitor->refresh();
this->currentIteration ++;
if( ( this->getResidue() > this->getDivergenceResidue() &&
this->getIterations() > this->minIterations ) ||
this->getIterations() > this->getMaxIterations() )
return false;
return true;
}
template< typename Real, typename Index >
const Index& tnlIterativeSolver< Real, Index> :: getIterations() const
{
return this -> currentIteration;
}
template< typename Real, typename Index >
void tnlIterativeSolver< Real, Index> :: setConvergenceResidue( const Real& convergenceResidue )
this->convergenceResidue = convergenceResidue;
}
template< typename Real, typename Index >
const Real& tnlIterativeSolver< Real, Index> :: getConvergenceResidue() const
return this->convergenceResidue;
}
template< typename Real, typename Index >
void tnlIterativeSolver< Real, Index> :: setDivergenceResidue( const Real& divergenceResidue )
this->divergenceResidue = divergenceResidue;
}
template< typename Real, typename Index >
const Real& tnlIterativeSolver< Real, Index> :: getDivergenceResidue() const
return this->divergenceResidue;
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
175
176
177
178
179
180
181
182
183
184
185
}
template< typename Real, typename Index >
void tnlIterativeSolver< Real, Index> :: setResidue( const Real& residue )
{
this -> currentResidue = residue;
}
template< typename Real, typename Index >
const Real& tnlIterativeSolver< Real, Index> :: getResidue() const
{
return this -> currentResidue;
}
template< typename Real, typename Index >
void tnlIterativeSolver< Real, Index> :: setRefreshRate( const Index& refreshRate )
{
this -> refreshRate = refreshRate;
}
template< typename Real, typename Index >
void tnlIterativeSolver< Real, Index> :: setSolverMonitor( tnlIterativeSolverMonitor< Real, Index >& solverMonitor )
{
this -> solverMonitor = &solverMonitor;
}
template< typename Real, typename Index >
void tnlIterativeSolver< Real, Index> :: refreshSolverMonitor()
{
if( this -> solverMonitor )
{
this -> solverMonitor -> setIterations( this -> getIterations() );
this -> solverMonitor -> setResidue( this -> getResidue() );
this -> solverMonitor -> refresh();
}
}
#ifdef TEMPLATE_EXPLICIT_INSTANTIATION
extern template class tnlIterativeSolver< float, int >;
extern template class tnlIterativeSolver< double, int >;
extern template class tnlIterativeSolver< float, long int >;
extern template class tnlIterativeSolver< double, long int >;
#ifdef HAVE_CUDA
extern template class tnlIterativeSolver< float, int >;
extern template class tnlIterativeSolver< double, int >;
extern template class tnlIterativeSolver< float, long int >;
extern template class tnlIterativeSolver< double, long int >;
#endif
#endif
#endif /* TNLITERATIVESOLVER_IMPL_H_ */