deal.II version 9.7.0
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\) \(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\) \(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\) \(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
Loading...
Searching...
No Matches
trilinos_tpetra_sparse_matrix.cc
Go to the documentation of this file.
1// ------------------------------------------------------------------------
2//
3// SPDX-License-Identifier: LGPL-2.1-or-later
4// Copyright (C) 2023 - 2024 by the deal.II authors
5//
6// This file is part of the deal.II library.
7//
8// Part of the source code is dual licensed under Apache-2.0 WITH
9// LLVM-exception OR LGPL-2.1-or-later. Detailed license information
10// governing the source code and code contributions can be found in
11// LICENSE.md and CONTRIBUTING.md at the top level directory of deal.II.
12//
13// ------------------------------------------------------------------------
14
15#include <deal.II/base/config.h>
16
17#ifdef DEAL_II_TRILINOS_WITH_TPETRA
18
19# include <deal.II/lac/trilinos_tpetra_sparse_matrix.templates.h>
20
21DEAL_II_NAMESPACE_OPEN
22
23# ifndef DOXYGEN
24// explicit instantiations
25namespace LinearAlgebra
26{
27 namespace TpetraWrappers
28 {
29 template class SparseMatrix<double, MemorySpace::Host>;
30
31 template void
32 SparseMatrix<double, MemorySpace::Host>::reinit(
33 const IndexSet &parallel_partitioning,
34 const ::DynamicSparsityPattern &sparsity_pattern,
35 const MPI_Comm communicator,
36 const bool exchange_data);
37
38 template void
39 SparseMatrix<double, MemorySpace::Host>::reinit(
40 const IndexSet &row_parallel_partitioning,
41 const IndexSet &col_parallel_partitioning,
42 const ::DynamicSparsityPattern &sparsity_pattern,
43 const MPI_Comm communicator,
44 const bool exchange_data);
45
46 template void
47 SparseMatrix<double, MemorySpace::Host>::reinit(
48 const ::DynamicSparsityPattern &);
49
50 template void
51 SparseMatrix<double, MemorySpace::Host>::vmult(
52 Vector<double, MemorySpace::Host> &dst,
53 const Vector<double, MemorySpace::Host> &src) const;
54
55 template void
56 SparseMatrix<double, MemorySpace::Host>::Tvmult(
57 Vector<double, MemorySpace::Host> &dst,
58 const Vector<double, MemorySpace::Host> &src) const;
59
60 template void
61 SparseMatrix<double, MemorySpace::Host>::vmult_add(
62 Vector<double, MemorySpace::Host> &dst,
63 const Vector<double, MemorySpace::Host> &src) const;
64
65 template void
66 SparseMatrix<double, MemorySpace::Host>::Tvmult_add(
67 Vector<double, MemorySpace::Host> &dst,
68 const Vector<double, MemorySpace::Host> &src) const;
69
70 template void
71 SparseMatrix<double, MemorySpace::Host>::vmult(
72 ::Vector<double> &dst,
73 const ::Vector<double> &src) const;
74
75 template void
76 SparseMatrix<double, MemorySpace::Host>::Tvmult(
77 ::Vector<double> &dst,
78 const ::Vector<double> &src) const;
79
80 template void
81 SparseMatrix<double, MemorySpace::Host>::vmult_add(
82 ::Vector<double> &dst,
83 const ::Vector<double> &src) const;
84
85 template void
86 SparseMatrix<double, MemorySpace::Host>::Tvmult_add(
87 ::Vector<double> &dst,
88 const ::Vector<double> &src) const;
89
90 template class SparseMatrix<double, MemorySpace::Default>;
91
92 template void
93 SparseMatrix<double, MemorySpace::Default>::reinit(
94 const IndexSet &parallel_partitioning,
95 const ::DynamicSparsityPattern &sparsity_pattern,
96 const MPI_Comm communicator,
97 const bool exchange_data);
98
99 template void
100 SparseMatrix<double, MemorySpace::Default>::reinit(
101 const IndexSet &row_parallel_partitioning,
102 const IndexSet &col_parallel_partitioning,
103 const ::DynamicSparsityPattern &sparsity_pattern,
104 const MPI_Comm communicator,
105 const bool exchange_data);
106
107 template void
108 SparseMatrix<double, MemorySpace::Default>::reinit(
109 const ::DynamicSparsityPattern &);
110
111 template void
112 SparseMatrix<double, MemorySpace::Default>::vmult(
113 Vector<double, MemorySpace::Default> &dst,
114 const Vector<double, MemorySpace::Default> &src) const;
115
116 template void
117 SparseMatrix<double, MemorySpace::Default>::Tvmult(
118 Vector<double, MemorySpace::Default> &dst,
119 const Vector<double, MemorySpace::Default> &src) const;
120
121 template void
122 SparseMatrix<double, MemorySpace::Default>::vmult_add(
123 Vector<double, MemorySpace::Default> &dst,
124 const Vector<double, MemorySpace::Default> &src) const;
125
126 template void
127 SparseMatrix<double, MemorySpace::Default>::Tvmult_add(
128 Vector<double, MemorySpace::Default> &dst,
129 const Vector<double, MemorySpace::Default> &src) const;
130
131 template void
132 SparseMatrix<double, MemorySpace::Default>::vmult(
133 ::Vector<double> &dst,
134 const ::Vector<double> &src) const;
135
136 template void
137 SparseMatrix<double, MemorySpace::Default>::Tvmult(
138 ::Vector<double> &dst,
139 const ::Vector<double> &src) const;
140
141 template void
142 SparseMatrix<double, MemorySpace::Default>::vmult_add(
143 ::Vector<double> &dst,
144 const ::Vector<double> &src) const;
145
146 template void
147 SparseMatrix<double, MemorySpace::Default>::Tvmult_add(
148 ::Vector<double> &dst,
149 const ::Vector<double> &src) const;
150 } // namespace TpetraWrappers
151} // namespace LinearAlgebra
152# endif // DOXYGEN
153
154DEAL_II_NAMESPACE_CLOSE
155
156#endif // DEAL_II_TRILINOS_WITH_TPETRA
LinearAlgebra::TpetraWrappers::SparseMatrix::Tvmult
void Tvmult(InputVectorType &dst, const InputVectorType &src) const
LinearAlgebra::TpetraWrappers::SparseMatrix::reinit
void reinit(const SparsityPatternType &sparsity_pattern)
LinearAlgebra::TpetraWrappers::SparseMatrix::vmult
void vmult(InputVectorType &dst, const InputVectorType &src) const
LinearAlgebra::TpetraWrappers::SparseMatrix::Tvmult_add
void Tvmult_add(InputVectorType &dst, const InputVectorType &src) const
LinearAlgebra::TpetraWrappers::SparseMatrix::vmult_add
void vmult_add(InputVectorType &dst, const InputVectorType &src) const
DEAL_II_NAMESPACE_OPEN
#define DEAL_II_NAMESPACE_OPEN
Definition config.h:40
DEAL_II_NAMESPACE_CLOSE
#define DEAL_II_NAMESPACE_CLOSE
Definition config.h:41