|
Reference documentation for deal.II version 9.2.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\}}\)
Go to the documentation of this file.
27 template <
typename number>
38 template <
typename number>
51 template <
typename number>
57 typename std::vector<number>::const_iterator i;
58 typename std::vector<number>::const_iterator
e;
62 if (std::abs(*i) != 0.)
66 for (i = left.begin(); i !=
e; ++i)
67 if (std::abs(*i) != 0.)
71 for (i = right.begin(); i !=
e; ++i)
72 if (std::abs(*i) != 0.)
79 template <
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);
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);
127 w(i) = (*l) * v(i - 1) + (*d) * v(i) + (*r) * v(i + 1);
128 w(
e) = (*l) * v(
e - 1) + (*d) * v(
e);
133 template <
typename number>
143 template <
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);
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);
181 w(i) = (*l) * v(i + 1) + (*d) * v(i) + (*r) * v(i - 1);
182 w(
e) = (*d) * v(
e) + (*r) * v(
e - 1);
188 template <
typename number>
198 template <
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));
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));
225 template <
typename number>
229 return matrix_scalar_product(v, v);
234 template <
typename number>
238 #ifdef DEAL_II_WITH_LAPACK
248 static_cast<number *
>(
nullptr),
250 static_cast<number *
>(
nullptr),
262 template <
typename number>
283 #ifdef DEAL_II_WITH_COMPLEX_VALUES
@ diagonal
Matrix is diagonal.
void reinit(size_type n, bool symmetric=false)
void Tvmult_add(Vector< number > &w, const Vector< number > &v) const
static ::ExceptionBase & ExcNotImplemented()
void compute_eigenvalues()
#define AssertIndexRange(index, range)
SymmetricTensor< 2, dim, Number > e(const Tensor< 2, dim, Number > &F)
SymmetricTensor< 2, dim, Number > d(const Tensor< 2, dim, Number > &F, const Tensor< 2, dim, Number > &dF_dt)
number matrix_scalar_product(const Vector< number > &u, const Vector< number > &v) const
static const types::blas_int one
Tensor< 2, dim, Number > w(const Tensor< 2, dim, Number > &F, const Tensor< 2, dim, Number > &dF_dt)
void vmult(Vector< number > &w, const Vector< number > &v, const bool adding=false) const
@ symmetric
Matrix is symmetric.
number matrix_norm_square(const Vector< number > &v) const
@ eigenvalues
Eigenvalue vector is filled.
#define DEAL_II_NAMESPACE_OPEN
Tensor< 2, dim, Number > l(const Tensor< 2, dim, Number > &F, const Tensor< 2, dim, Number > &dF_dt)
@ matrix
Contents is actually a matrix.
number eigenvalue(const size_type i) const
TridiagonalMatrix(size_type n=0, bool symmetric=false)
void stev(const char *, const ::types::blas_int *, number1 *, number2 *, number3 *, const ::types::blas_int *, number4 *, ::types::blas_int *)
static ::ExceptionBase & ExcInternalError()
#define Assert(cond, exc)
void Tvmult(Vector< number > &w, const Vector< number > &v, const bool adding=false) const
void vmult_add(Vector< number > &w, const Vector< number > &v) const
static ::ExceptionBase & ExcDimensionMismatch(std::size_t arg1, std::size_t arg2)
#define DEAL_II_NAMESPACE_CLOSE
static ::ExceptionBase & ExcState(State arg1)
static ::ExceptionBase & ExcNeedsLAPACK()
#define AssertThrow(cond, exc)