-
Notifications
You must be signed in to change notification settings - Fork 86
/
lower_trs_kernels.cpp
108 lines (85 loc) · 3.77 KB
/
lower_trs_kernels.cpp
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
/*******************************<GINKGO LICENSE>******************************
Copyright (c) 2017-2019, the Ginkgo authors
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.
******************************<GINKGO LICENSE>*******************************/
#include "core/solver/lower_trs_kernels.hpp"
#include <memory>
#include <ginkgo/core/base/exception_helpers.hpp>
#include <ginkgo/core/base/math.hpp>
#include <ginkgo/core/base/types.hpp>
#include <ginkgo/core/matrix/csr.hpp>
#include <ginkgo/core/matrix/dense.hpp>
namespace gko {
namespace kernels {
namespace reference {
/**
* @brief The LOWER_TRS solver namespace.
*
* @ingroup lower_trs
*/
namespace lower_trs {
void clear(std::shared_ptr<const ReferenceExecutor> exec)
{
// This clear kernel is here to allow for a more sophisticated
// implementation as for other executors.
}
template <typename ValueType, typename IndexType>
void generate(std::shared_ptr<const ReferenceExecutor> exec,
const matrix::Csr<ValueType, IndexType> *matrix,
const gko::size_type num_rhs)
{
// This generate kernel is here to allow for a more sophisticated
// implementation as for other executors. This kernel would perform the
// "analysis" phase for the triangular matrix.
}
GKO_INSTANTIATE_FOR_EACH_VALUE_AND_INDEX_TYPE(
GKO_DECLARE_LOWER_TRS_GENERATE_KERNEL);
template <typename ValueType, typename IndexType>
void solve(std::shared_ptr<const ReferenceExecutor> exec,
const matrix::Csr<ValueType, IndexType> *matrix,
const matrix::Dense<ValueType> *b, matrix::Dense<ValueType> *x)
{
auto row_ptrs = matrix->get_const_row_ptrs();
auto col_idxs = matrix->get_const_col_idxs();
auto vals = matrix->get_const_values();
for (size_type j = 0; j < b->get_size()[1]; ++j) {
for (size_type row = 0; row < matrix->get_size()[0]; ++row) {
x->at(row, j) = b->at(row, j) / vals[row_ptrs[row + 1] - 1];
for (size_type k = row_ptrs[row]; k < row_ptrs[row + 1]; ++k) {
auto col = col_idxs[k];
if (col < row) {
x->at(row, j) +=
-vals[k] * x->at(col, j) / vals[row_ptrs[row + 1] - 1];
}
}
}
}
}
GKO_INSTANTIATE_FOR_EACH_VALUE_AND_INDEX_TYPE(
GKO_DECLARE_LOWER_TRS_SOLVE_KERNEL);
} // namespace lower_trs
} // namespace reference
} // namespace kernels
} // namespace gko