27template <
typename number>
38template <
typename number>
51template <
typename number>
57 typename std::vector<number>::const_iterator i;
58 typename std::vector<number>::const_iterator e;
61 for (i =
diagonal.begin(); i != e; ++i)
66 for (i = left.begin(); i != e; ++i)
71 for (i = right.begin(); i != e; ++i)
79template <
typename number>
83 const bool adding)
const
98 typename std::vector<number>::const_iterator d =
diagonal.begin();
99 typename std::vector<number>::const_iterator r = right.begin();
103 typename std::vector<number>::const_iterator l = left.begin();
112 w(0) += (*d) * v(0) + (*r) * v(1);
116 for (
size_type i = 1; i < e; ++i, ++d, ++r, ++l)
117 w(i) += (*l) * v(i - 1) + (*d) * v(i) + (*r) * v(i + 1);
119 w(e) += (*l) * v(e - 1) + (*d) * v(e);
123 w(0) = (*d) * v(0) + (*r) * v(1);
126 for (
size_type i = 1; i < e; ++i, ++d, ++r, ++l)
127 w(i) = (*l) * v(i - 1) + (*d) * v(i) + (*r) * v(i + 1);
128 w(e) = (*l) * v(e - 1) + (*d) * v(e);
133template <
typename number>
143template <
typename number>
147 const bool adding)
const
158 typename std::vector<number>::const_iterator d =
diagonal.begin();
159 typename std::vector<number>::const_iterator r = right.begin();
160 typename std::vector<number>::const_iterator l = left.begin();
168 w(0) += (*d) * v(0) + (*l) * v(1);
171 for (
size_type i = 1; i < e; ++i, ++d, ++r, ++l)
172 w(i) += (*l) * v(i + 1) + (*d) * v(i) + (*r) * v(i - 1);
173 w(e) += (*d) * v(e) + (*r) * v(e - 1);
177 w(0) = (*d) * v(0) + (*l) * v(1);
180 for (
size_type i = 1; i < e; ++i, ++d, ++r, ++l)
181 w(i) = (*l) * v(i + 1) + (*d) * v(i) + (*r) * v(i - 1);
182 w(e) = (*d) * v(e) + (*r) * v(e - 1);
188template <
typename number>
198template <
typename number>
206 typename std::vector<number>::const_iterator d =
diagonal.begin();
207 typename std::vector<number>::const_iterator r = right.begin();
208 typename std::vector<number>::const_iterator l = left.begin();
214 number result = w(0) * ((*d) * v(0) + (*r) * v(1));
217 for (
size_type i = 1; i < e; ++i, ++d, ++r, ++l)
218 result += w(i) * ((*l) * v(i - 1) + (*d) * v(i) + (*r) * v(i + 1));
219 result += w(e) * ((*l) * v(e - 1) + (*d) * v(e));
225template <
typename number>
229 return matrix_scalar_product(v, v);
234template <
typename number>
238#ifdef DEAL_II_WITH_LAPACK
248 static_cast<number *
>(
nullptr),
250 static_cast<number *
>(
nullptr),
262template <
typename number>
283#ifdef DEAL_II_WITH_COMPLEX_VALUES
void Tvmult_add(Vector< number > &w, const Vector< number > &v) const
void vmult(Vector< number > &w, const Vector< number > &v, const bool adding=false) const
number matrix_norm_square(const Vector< number > &v) const
void reinit(size_type n, bool symmetric=false)
void vmult_add(Vector< number > &w, const Vector< number > &v) const
void compute_eigenvalues()
void Tvmult(Vector< number > &w, const Vector< number > &v, const bool adding=false) const
number eigenvalue(const size_type i) const
TridiagonalMatrix(size_type n=0, bool symmetric=false)
number matrix_scalar_product(const Vector< number > &u, const Vector< number > &v) const
#define DEAL_II_NAMESPACE_OPEN
#define DEAL_II_NAMESPACE_CLOSE
static ::ExceptionBase & ExcNotImplemented()
#define Assert(cond, exc)
#define AssertIndexRange(index, range)
static ::ExceptionBase & ExcInternalError()
static ::ExceptionBase & ExcNeedsLAPACK()
static ::ExceptionBase & ExcDimensionMismatch(std::size_t arg1, std::size_t arg2)
static ::ExceptionBase & ExcState(State arg1)
#define AssertThrow(cond, exc)
void stev(const char *, const ::types::blas_int *, number1 *, number2 *, number3 *, const ::types::blas_int *, number4 *, ::types::blas_int *)
@ matrix
Contents is actually a matrix.
@ eigenvalues
Eigenvalue vector is filled.
@ symmetric
Matrix is symmetric.
@ diagonal
Matrix is diagonal.
static const types::blas_int one
::VectorizedArray< Number, width > abs(const ::VectorizedArray< Number, width > &)