mirror of
https://github.com/OPM/opm-simulators.git
synced 2025-02-25 18:55:30 -06:00
Added some missing header files.
This commit is contained in:
parent
dea49a5406
commit
9c28b485ef
@ -172,6 +172,8 @@ if(CUDA_FOUND)
|
|||||||
list (APPEND PUBLIC_HEADER_FILES opm/simulators/linalg/cuistl/detail/has_function.hpp)
|
list (APPEND PUBLIC_HEADER_FILES opm/simulators/linalg/cuistl/detail/has_function.hpp)
|
||||||
list (APPEND PUBLIC_HEADER_FILES opm/simulators/linalg/cuistl/detail/preconditioner_should_call_post_pre.hpp)
|
list (APPEND PUBLIC_HEADER_FILES opm/simulators/linalg/cuistl/detail/preconditioner_should_call_post_pre.hpp)
|
||||||
list (APPEND PUBLIC_HEADER_FILES opm/simulators/linalg/cuistl/PreconditionerAdapter.hpp)
|
list (APPEND PUBLIC_HEADER_FILES opm/simulators/linalg/cuistl/PreconditionerAdapter.hpp)
|
||||||
|
list (APPEND PUBLIC_HEADER_FILES opm/simulators/linalg/cuistl/CuSeqILU0.hpp)
|
||||||
|
list (APPEND PUBLIC_HEADER_FILES opm/simulators/linalg/cuistl/detail/fix_zero_diagonal.hpp)
|
||||||
list (APPEND PUBLIC_HEADER_FILES opm/simulators/linalg/cuistl/PreconditionerConvertFieldTypeAdapter.hpp)
|
list (APPEND PUBLIC_HEADER_FILES opm/simulators/linalg/cuistl/PreconditionerConvertFieldTypeAdapter.hpp)
|
||||||
|
|
||||||
|
|
||||||
|
134
opm/simulators/linalg/cuistl/CuSeqILU0.hpp
Normal file
134
opm/simulators/linalg/cuistl/CuSeqILU0.hpp
Normal file
@ -0,0 +1,134 @@
|
|||||||
|
/*
|
||||||
|
Copyright 2022-2023 SINTEF AS
|
||||||
|
|
||||||
|
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/>.
|
||||||
|
*/
|
||||||
|
#ifndef OPM_CUSEQILU0_HPP
|
||||||
|
#define OPM_CUSEQILU0_HPP
|
||||||
|
|
||||||
|
#include <dune/istl/preconditioner.hh>
|
||||||
|
#include <opm/simulators/linalg/PreconditionerWithUpdate.hpp>
|
||||||
|
#include <opm/simulators/linalg/cuistl/CuSparseMatrix.hpp>
|
||||||
|
#include <opm/simulators/linalg/cuistl/detail/CuMatrixDescription.hpp>
|
||||||
|
#include <opm/simulators/linalg/cuistl/detail/CuSparseHandle.hpp>
|
||||||
|
#include <opm/simulators/linalg/cuistl/detail/CuSparseResource.hpp>
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
namespace Opm::cuistl
|
||||||
|
{
|
||||||
|
//! \brief Sequential ILU0 preconditioner on the GPU through the CuSparse library.
|
||||||
|
//!
|
||||||
|
//! This implementation calls the CuSparse functions, which in turn essentially
|
||||||
|
//! does a level decomposition to get some parallelism.
|
||||||
|
//!
|
||||||
|
//! \note This is not expected to be a fast preconditioner.
|
||||||
|
//!
|
||||||
|
//! \tparam M The matrix type to operate on
|
||||||
|
//! \tparam X Type of the update
|
||||||
|
//! \tparam Y Type of the defect
|
||||||
|
//! \tparam l Ignored. Just there to have the same number of template arguments
|
||||||
|
//! as other preconditioners.
|
||||||
|
//!
|
||||||
|
//! \note We assume X and Y are both CuVector<real_type>, but we leave them as template
|
||||||
|
//! arguments in case of future additions.
|
||||||
|
template <class M, class X, class Y, int l = 1>
|
||||||
|
class CuSeqILU0 : public Dune::PreconditionerWithUpdate<X, Y>
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
//! \brief The matrix type the preconditioner is for.
|
||||||
|
using matrix_type = typename std::remove_const<M>::type ;
|
||||||
|
//! \brief The domain type of the preconditioner.
|
||||||
|
using domain_type = X;
|
||||||
|
//! \brief The range type of the preconditioner.
|
||||||
|
using range_type = Y;
|
||||||
|
//! \brief The field type of the preconditioner.
|
||||||
|
using field_type = typename X::field_type;
|
||||||
|
|
||||||
|
//! \brief Constructor.
|
||||||
|
//!
|
||||||
|
//! Constructor gets all parameters to operate the prec.
|
||||||
|
//! \param A The matrix to operate on.
|
||||||
|
//! \param w The relaxation factor.
|
||||||
|
//!
|
||||||
|
CuSeqILU0(const M& A, field_type w);
|
||||||
|
|
||||||
|
//! \brief Prepare the preconditioner.
|
||||||
|
//! \note Does nothing at the time being.
|
||||||
|
virtual void pre(X& x, Y& b) override;
|
||||||
|
|
||||||
|
//! \brief Apply the preconditoner.
|
||||||
|
virtual void apply(X& v, const Y& d) override;
|
||||||
|
|
||||||
|
//! \brief Post processing
|
||||||
|
//! \note Does nothing at the moment
|
||||||
|
virtual void post(X& x) override;
|
||||||
|
|
||||||
|
//! Category of the preconditioner (see SolverCategory::Category)
|
||||||
|
virtual Dune::SolverCategory::Category category() const override;
|
||||||
|
|
||||||
|
//! \brief Updates the matrix data.
|
||||||
|
virtual void update() override;
|
||||||
|
|
||||||
|
|
||||||
|
//! \returns false
|
||||||
|
static constexpr bool shouldCallPre()
|
||||||
|
{
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
//! \returns false
|
||||||
|
static constexpr bool shouldCallPost()
|
||||||
|
{
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
private:
|
||||||
|
//! \brief Reference to the underlying matrix
|
||||||
|
const M& m_underlyingMatrix;
|
||||||
|
//! \brief The relaxation factor to use.
|
||||||
|
field_type m_w;
|
||||||
|
|
||||||
|
//! This is the storage for the LU composition.
|
||||||
|
//! Initially this will have the values of A, but will be
|
||||||
|
//! modified in the constructor to be the proper LU decomposition.
|
||||||
|
CuSparseMatrix<field_type> m_LU;
|
||||||
|
|
||||||
|
CuVector<field_type> m_temporaryStorage;
|
||||||
|
|
||||||
|
|
||||||
|
detail::CuSparseMatrixDescriptionPtr m_descriptionL;
|
||||||
|
detail::CuSparseMatrixDescriptionPtr m_descriptionU;
|
||||||
|
detail::CuSparseResource<bsrsv2Info_t> m_infoL;
|
||||||
|
detail::CuSparseResource<bsrsv2Info_t> m_infoU;
|
||||||
|
detail::CuSparseResource<bsrilu02Info_t> m_infoM;
|
||||||
|
|
||||||
|
std::unique_ptr<CuVector<field_type>> m_buffer;
|
||||||
|
detail::CuSparseHandle& m_cuSparseHandle;
|
||||||
|
|
||||||
|
bool m_analyzisDone = false;
|
||||||
|
|
||||||
|
void analyzeMatrix();
|
||||||
|
size_t findBufferSize();
|
||||||
|
|
||||||
|
void createILU();
|
||||||
|
|
||||||
|
void updateILUConfiguration();
|
||||||
|
};
|
||||||
|
} // end namespace Opm::cuistl
|
||||||
|
|
||||||
|
#endif
|
88
opm/simulators/linalg/cuistl/detail/fix_zero_diagonal.hpp
Normal file
88
opm/simulators/linalg/cuistl/detail/fix_zero_diagonal.hpp
Normal file
@ -0,0 +1,88 @@
|
|||||||
|
/*
|
||||||
|
Copyright 2022-2023 SINTEF AS
|
||||||
|
|
||||||
|
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/>.
|
||||||
|
*/
|
||||||
|
#ifndef OPM_FIXZERODIAGONAL_HEADER_INCLUDED
|
||||||
|
#define OPM_FIXZERODIAGONAL_HEADER_INCLUDED
|
||||||
|
|
||||||
|
#include <limits>
|
||||||
|
#include <vector>
|
||||||
|
|
||||||
|
//#define CUISTL_ASSUME_NON_ZERO_DIAGONAL 1
|
||||||
|
namespace Opm::cuistl::detail
|
||||||
|
{
|
||||||
|
template <class Matrix>
|
||||||
|
std::vector<typename Matrix::field_type>
|
||||||
|
fixZeroDiagonal(const Matrix& matrix,
|
||||||
|
const typename Matrix::field_type replacementValue
|
||||||
|
= std::numeric_limits<typename Matrix::field_type>::epsilon())
|
||||||
|
{
|
||||||
|
using field_type = typename Matrix::field_type;
|
||||||
|
std::vector<field_type> nonZeroes(matrix.nonzeroes() * Matrix::block_type::cols * Matrix::block_type::cols, 0.0);
|
||||||
|
|
||||||
|
const auto dataPointer = static_cast<const field_type*>(&(matrix[0][0][0][0]));
|
||||||
|
std::copy(dataPointer, dataPointer + nonZeroes.size(), nonZeroes.begin());
|
||||||
|
|
||||||
|
// TODO: Is there a neater way of accessing the underlying CRS structure?
|
||||||
|
size_t currentNonzeroPointer = 0u;
|
||||||
|
for (auto row = matrix.begin(); row != matrix.end(); ++row) {
|
||||||
|
for (auto column = row->begin(); column != row->end(); ++column) {
|
||||||
|
if (column.index() == row.index()) {
|
||||||
|
for (int component = 0; component < Matrix::block_type::cols; ++component) {
|
||||||
|
const auto index = currentNonzeroPointer + Matrix::block_type::cols * component + component;
|
||||||
|
if (nonZeroes[index] == 0) {
|
||||||
|
nonZeroes[index] = replacementValue;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
currentNonzeroPointer += 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return nonZeroes;
|
||||||
|
}
|
||||||
|
|
||||||
|
#ifdef CUISTL_ASSUME_NON_ZERO_DIAGONAL
|
||||||
|
template <class Matrix>
|
||||||
|
const Matrix&
|
||||||
|
#else
|
||||||
|
template <class Matrix>
|
||||||
|
const Matrix&
|
||||||
|
#endif
|
||||||
|
makeMatrixWithNonzeroDiagonal(const Matrix& matrix,
|
||||||
|
const typename Matrix::field_type replacementValue
|
||||||
|
= std::numeric_limits<typename Matrix::field_type>::epsilon())
|
||||||
|
{
|
||||||
|
#ifdef CUISTL_ASSUME_NON_ZERO_DIAGONAL
|
||||||
|
return matrix;
|
||||||
|
#else
|
||||||
|
auto& newMatrix = const_cast<Matrix&>(matrix);
|
||||||
|
// TODO: Is this fast enough?
|
||||||
|
for (size_t row = 0; row < newMatrix.N(); ++row) {
|
||||||
|
for (size_t component = 0; component < Matrix::block_type::cols; ++component) {
|
||||||
|
if (newMatrix[row][row][component][component] == 0) {
|
||||||
|
newMatrix[row][row][component][component] = replacementValue;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return newMatrix;
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
} // namespace Opm::cuistl::impl
|
||||||
|
|
||||||
|
#endif
|
Loading…
Reference in New Issue
Block a user