Morpheus 1.0.0
Dynamic matrix type and algorithms for sparse matrices
Loading...
Searching...
No Matches
Csr/Serial/Morpheus_Multiply_Impl.hpp
1
24#ifndef MORPHEUS_CSR_SERIAL_MULTIPLY_IMPL_HPP
25#define MORPHEUS_CSR_SERIAL_MULTIPLY_IMPL_HPP
26
27#include <Morpheus_Macros.hpp>
28#if defined(MORPHEUS_ENABLE_SERIAL)
29
30#include <Morpheus_SpaceTraits.hpp>
31#include <Morpheus_FormatTraits.hpp>
32#include <Morpheus_FormatTags.hpp>
33#include <Morpheus_Spaces.hpp>
34
35namespace Morpheus {
36namespace Impl {
37
38template <typename ExecSpace, typename Matrix, typename Vector>
39inline void multiply(
40 const Matrix& A, const Vector& x, Vector& y, const bool init,
41 typename std::enable_if_t<
42 Morpheus::is_csr_matrix_format_container_v<Matrix> &&
43 Morpheus::is_dense_vector_format_container_v<Vector> &&
44 Morpheus::has_custom_backend_v<ExecSpace> &&
45 Morpheus::has_serial_execution_space_v<ExecSpace> &&
46 Morpheus::has_access_v<ExecSpace, Matrix, Vector>>* = nullptr) {
47 using size_type = typename Matrix::size_type;
48 using index_type = typename Matrix::index_type;
49 using value_type = typename Matrix::value_type;
50
51 for (size_type i = 0; i < A.nrows(); i++) {
52 value_type sum = init ? value_type(0) : y[i];
53 for (index_type jj = A.crow_offsets(i); jj < A.crow_offsets(i + 1); jj++) {
54 sum += A.cvalues(jj) * x[A.ccolumn_indices(jj)];
55 }
56 y[i] = sum;
57 }
58}
59
60} // namespace Impl
61} // namespace Morpheus
62
63#endif // MORPHEUS_ENABLE_SERIAL
64#endif // MORPHEUS_CSR_SERIAL_MULTIPLY_IMPL_HPP
Generic Morpheus interfaces.
Definition: dummy.cpp:24