2019-12-03 07:10:21 -06:00
/*
2019-12-05 07:24:37 -06:00
Copyright 2019 Equinor ASA
2019-12-03 07:10:21 -06:00
This file is part of the Open Porous Media project ( OPM ) .
OPM 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 3 of the License , or
( at your option ) any later version .
OPM is distributed in the hope that it will be useful ,
but WITHOUT ANY WARRANTY ; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE . See the
GNU General Public License for more details .
You should have received a copy of the GNU General Public License
along with OPM . If not , see < http : //www.gnu.org/licenses/>.
*/
# include <config.h>
# include <memory>
2019-12-06 10:23:32 -06:00
# include <sstream>
2019-12-03 07:10:21 -06:00
2019-12-06 04:05:41 -06:00
# include <opm/common/OpmLog/OpmLog.hpp>
2019-12-18 08:47:35 -06:00
# include <opm/common/ErrorMacros.hpp>
2019-12-06 04:27:17 -06:00
# include <opm/material/common/Unused.hpp>
2019-12-06 04:05:41 -06:00
2019-12-04 09:59:58 -06:00
# include <opm/simulators/linalg/bda/BdaBridge.hpp>
# include <opm/simulators/linalg/bda/BdaResult.hpp>
2019-12-03 07:10:21 -06:00
2019-12-06 04:27:17 -06:00
# define PRINT_TIMERS_BRIDGE 0
2019-12-03 07:10:21 -06:00
typedef Dune : : InverseOperatorResult InverseOperatorResult ;
namespace Opm
{
2020-02-13 04:04:02 -06:00
BdaBridge : : BdaBridge ( bool use_gpu_ , int linear_solver_verbosity , int maxit , double tolerance )
: use_gpu ( use_gpu_ )
{
2019-12-18 08:54:14 -06:00
if ( use_gpu ) {
2019-12-18 08:50:09 -06:00
backend . reset ( new cusparseSolverBackend ( linear_solver_verbosity , maxit , tolerance ) ) ;
}
2019-12-03 07:10:21 -06:00
}
2019-12-16 03:05:12 -06:00
2019-12-18 08:47:35 -06:00
2019-12-03 07:10:21 -06:00
template < class BridgeMatrix >
int checkZeroDiagonal ( BridgeMatrix & mat ) {
2019-12-18 08:50:09 -06:00
static std : : vector < typename BridgeMatrix : : size_type > diag_indices ; // contains offsets of the diagonal nnzs
int numZeros = 0 ;
2019-12-18 09:37:29 -06:00
const int dim = 3 ; // might be replaced with mat[0][0].N() or BridgeMatrix::block_type::size()
2019-12-18 08:50:09 -06:00
const double zero_replace = 1e-15 ;
2019-12-18 08:54:14 -06:00
if ( diag_indices . size ( ) = = 0 ) {
2019-12-18 08:50:09 -06:00
int N = mat . N ( ) ;
diag_indices . reserve ( N ) ;
2019-12-18 08:54:14 -06:00
for ( typename BridgeMatrix : : iterator r = mat . begin ( ) ; r ! = mat . end ( ) ; + + r ) {
2019-12-18 08:50:09 -06:00
auto diag = r - > find ( r . index ( ) ) ; // diag is an iterator
assert ( diag . index ( ) = = r . index ( ) ) ;
2019-12-18 08:54:14 -06:00
for ( int rr = 0 ; rr < dim ; + + rr ) {
2019-12-18 08:50:09 -06:00
auto & val = ( * diag ) [ rr ] [ rr ] ; // reference to easily change the value
2019-12-18 08:54:14 -06:00
if ( val = = 0.0 ) { // could be replaced by '< 1e-30' or similar
2019-12-18 08:50:09 -06:00
val = zero_replace ;
+ + numZeros ;
}
}
diag_indices . emplace_back ( diag . offset ( ) ) ;
}
} else {
2019-12-18 08:54:14 -06:00
for ( typename BridgeMatrix : : iterator r = mat . begin ( ) ; r ! = mat . end ( ) ; + + r ) {
2019-12-18 08:50:09 -06:00
typename BridgeMatrix : : size_type offset = diag_indices [ r . index ( ) ] ;
auto & diag_block = r - > getptr ( ) [ offset ] ; // diag_block is a reference to MatrixBlock, located on column r of row r
2019-12-18 08:54:14 -06:00
for ( int rr = 0 ; rr < dim ; + + rr ) {
2019-12-18 08:50:09 -06:00
auto & val = diag_block [ rr ] [ rr ] ;
2019-12-18 08:54:14 -06:00
if ( val = = 0.0 ) { // could be replaced by '< 1e-30' or similar
2019-12-18 08:50:09 -06:00
val = zero_replace ;
+ + numZeros ;
}
}
}
}
return numZeros ;
2019-12-03 07:10:21 -06:00
}
2019-12-06 07:33:52 -06:00
// iterate sparsity pattern from Matrix and put colIndices and rowPointers in arrays
2019-12-03 07:10:21 -06:00
// sparsity pattern should stay the same due to matrix-add-well-contributions
2019-12-18 08:47:35 -06:00
// this could be removed if Dune::BCRSMatrix features an API call that returns colIndices and rowPointers
2019-12-03 07:10:21 -06:00
template < class BridgeMatrix >
2019-12-06 10:23:32 -06:00
void getSparsityPattern ( BridgeMatrix & mat , std : : vector < int > & h_rows , std : : vector < int > & h_cols ) {
2019-12-18 08:50:09 -06:00
int sum_nnzs = 0 ;
// convert colIndices and rowPointers
2019-12-18 08:54:14 -06:00
if ( h_rows . size ( ) = = 0 ) {
2019-12-18 08:50:09 -06:00
h_rows . emplace_back ( 0 ) ;
2019-12-18 08:54:14 -06:00
for ( typename BridgeMatrix : : const_iterator r = mat . begin ( ) ; r ! = mat . end ( ) ; + + r ) {
2019-12-18 08:50:09 -06:00
int size_row = 0 ;
2019-12-18 08:54:14 -06:00
for ( auto c = r - > begin ( ) ; c ! = r - > end ( ) ; + + c ) {
2019-12-18 08:50:09 -06:00
h_cols . emplace_back ( c . index ( ) ) ;
size_row + + ;
}
sum_nnzs + = size_row ;
h_rows . emplace_back ( sum_nnzs ) ;
}
2019-12-18 09:37:29 -06:00
// h_rows and h_cols could be changed to 'unsigned int', but cusparse expects 'int'
if ( static_cast < unsigned int > ( h_rows [ mat . N ( ) ] ) ! = mat . nonzeroes ( ) ) {
2019-12-18 08:50:09 -06:00
OPM_THROW ( std : : logic_error , " Error size of rows do not sum to number of nonzeroes in BdaBridge::getSparsityPattern() " ) ;
}
}
2019-12-06 07:33:52 -06:00
} // end getSparsityPattern()
2019-12-03 07:10:21 -06:00
template < class BridgeMatrix , class BridgeVector >
2020-03-13 08:21:59 -05:00
void BdaBridge : : solve_system ( BridgeMatrix * mat OPM_UNUSED , BridgeVector & b OPM_UNUSED , WellContributions & wellContribs OPM_UNUSED , InverseOperatorResult & res OPM_UNUSED )
2019-12-03 07:10:21 -06:00
{
2019-12-18 08:54:14 -06:00
if ( use_gpu ) {
2019-12-18 08:50:09 -06:00
BdaResult result ;
result . converged = false ;
static std : : vector < int > h_rows ;
static std : : vector < int > h_cols ;
2019-12-18 09:37:29 -06:00
const int dim = ( * mat ) [ 0 ] [ 0 ] . N ( ) ;
const int N = mat - > N ( ) * dim ;
const int nnz = ( h_rows . empty ( ) ) ? mat - > nonzeroes ( ) * dim * dim : h_rows . back ( ) * dim * dim ;
2019-12-18 08:50:09 -06:00
2019-12-18 08:54:14 -06:00
if ( dim ! = 3 ) {
2019-12-18 08:50:09 -06:00
OpmLog : : warning ( " cusparseSolver only accepts blocksize = 3 at this time, will use Dune for the remainder of the program " ) ;
use_gpu = false ;
2020-03-19 08:09:42 -05:00
return ;
2019-12-18 08:50:09 -06:00
}
2019-12-18 08:54:14 -06:00
if ( h_rows . capacity ( ) = = 0 ) {
2019-12-18 08:50:09 -06:00
h_rows . reserve ( N + 1 ) ;
h_cols . reserve ( nnz ) ;
2019-12-06 07:33:52 -06:00
# if PRINT_TIMERS_BRIDGE
2019-12-18 08:50:09 -06:00
Dune : : Timer t ;
2019-12-06 07:33:52 -06:00
# endif
2019-12-18 08:50:09 -06:00
getSparsityPattern ( * mat , h_rows , h_cols ) ;
2019-12-06 07:33:52 -06:00
# if PRINT_TIMERS_BRIDGE
2019-12-18 08:50:09 -06:00
std : : ostringstream out ;
out < < " getSparsityPattern() took: " < < t . stop ( ) < < " s " ;
OpmLog : : info ( out . str ( ) ) ;
2019-12-06 07:33:52 -06:00
# endif
2019-12-18 08:50:09 -06:00
}
2019-12-03 07:10:21 -06:00
# if PRINT_TIMERS_BRIDGE
2019-12-18 08:50:09 -06:00
Dune : : Timer t_zeros ;
int numZeros = checkZeroDiagonal ( * mat ) ;
std : : ostringstream out ;
out < < " Checking zeros took: " < < t_zeros . stop ( ) < < " s, found " < < numZeros < < " zeros " ;
OpmLog : : info ( out . str ( ) ) ;
2019-12-03 07:10:21 -06:00
# else
2019-12-18 08:50:09 -06:00
checkZeroDiagonal ( * mat ) ;
2019-12-03 07:10:21 -06:00
# endif
2019-12-18 08:50:09 -06:00
/////////////////////////
// actually solve
typedef cusparseSolverBackend : : cusparseSolverStatus cusparseSolverStatus ;
// assume that underlying data (nonzeroes) from mat (Dune::BCRSMatrix) are contiguous, if this is not the case, cusparseSolver is expected to perform undefined behaviour
2020-03-13 08:21:59 -05:00
cusparseSolverStatus status = backend - > solve_system ( N , nnz , dim , static_cast < double * > ( & ( ( ( * mat ) [ 0 ] [ 0 ] [ 0 ] [ 0 ] ) ) ) , h_rows . data ( ) , h_cols . data ( ) , static_cast < double * > ( & ( b [ 0 ] [ 0 ] ) ) , wellContribs , result ) ;
2019-12-18 08:54:14 -06:00
switch ( status ) {
2019-12-18 08:50:09 -06:00
case cusparseSolverStatus : : CUSPARSE_SOLVER_SUCCESS :
//OpmLog::info("cusparseSolver converged");
break ;
case cusparseSolverStatus : : CUSPARSE_SOLVER_ANALYSIS_FAILED :
OpmLog : : warning ( " cusparseSolver could not analyse level information of matrix, perhaps there is still a 0.0 on the diagonal of a block on the diagonal " ) ;
break ;
case cusparseSolverStatus : : CUSPARSE_SOLVER_CREATE_PRECONDITIONER_FAILED :
OpmLog : : warning ( " cusparseSolver could not create preconditioner, perhaps there is still a 0.0 on the diagonal of a block on the diagonal " ) ;
break ;
default :
OpmLog : : warning ( " cusparseSolver returned unknown status code " ) ;
}
res . iterations = result . iterations ;
res . reduction = result . reduction ;
res . converged = result . converged ;
res . conv_rate = result . conv_rate ;
res . elapsed = result . elapsed ;
} else {
res . converged = false ;
}
2019-12-03 07:10:21 -06:00
}
template < class BridgeVector >
2019-12-18 08:54:14 -06:00
void BdaBridge : : get_result ( BridgeVector & x OPM_UNUSED ) {
if ( use_gpu ) {
2019-12-18 08:50:09 -06:00
backend - > post_process ( static_cast < double * > ( & ( x [ 0 ] [ 0 ] ) ) ) ;
}
2019-12-03 07:10:21 -06:00
}
2020-05-13 09:29:36 -05:00
# define INSTANTIATE_BDA_FUNCTIONS(n) \
template void BdaBridge : : solve_system \
( Dune : : BCRSMatrix < Opm : : MatrixBlock < double , n , n > , std : : allocator < Opm : : MatrixBlock < double , n , n > > > * , \
Dune : : BlockVector < Dune : : FieldVector < double , n > , std : : allocator < Dune : : FieldVector < double , n > > > & , \
WellContributions & , InverseOperatorResult & ) ; \
\
template void BdaBridge : : get_result \
( Dune : : BlockVector < Dune : : FieldVector < double , n > , std : : allocator < Dune : : FieldVector < double , n > > > & ) ; \
INSTANTIATE_BDA_FUNCTIONS ( 1 ) ;
INSTANTIATE_BDA_FUNCTIONS ( 2 ) ;
INSTANTIATE_BDA_FUNCTIONS ( 3 ) ;
INSTANTIATE_BDA_FUNCTIONS ( 4 ) ;
# undef INSTANTIATE_BDA_FUNCTIONS
2019-12-03 07:10:21 -06:00
}