17 #ifndef __deal2__precondition_block_base_h 18 #define __deal2__precondition_block_base_h 21 #include <deal.II/base/config.h> 23 #include <deal.II/base/subscriptor.h> 24 #include <deal.II/base/smartpointer.h> 25 #include <deal.II/base/memory_consumption.h> 26 #include <deal.II/lac/householder.h> 27 #include <deal.II/lac/lapack_full_matrix.h> 34 template <
typename number>
class Vector;
55 template <
typename number>
118 void reinit(
unsigned int nblocks, size_type blocksize,
bool compress,
169 unsigned int size()
const;
177 number
el(size_type i, size_type j)
const;
183 template <
typename number2>
190 template <
typename number2>
362 template <
typename number>
375 template <
typename number>
393 template <
typename number>
441 std::vector<FullMatrix<number> >
450 std::vector<FullMatrix<number> >
460 std::vector<LAPACKFullMatrix<number> >
472 template <
typename number>
480 template <
typename number>
481 template <
typename number2>
509 template <
typename number>
510 template <
typename number2>
538 template <
typename number>
551 template <
typename number>
564 template <
typename number>
577 template <
typename number>
592 template <
typename number>
607 template <
typename number>
622 template <
typename number>
637 template <
typename number>
652 template <
typename number>
660 template <
typename number>
668 template <
typename number>
676 template <
typename number>
684 template <
typename number>
688 deallog <<
"PreconditionBlockBase: " <<
size() <<
" blocks; ";
692 unsigned int kermin = 100000000, kermax = 0;
693 double sigmin = 1.e300, sigmax= -1.e300;
694 double kappamin = 1.e300, kappamax= -1.e300;
704 const double co = sm/s0;
706 if (kermin > k) kermin = k-1;
707 if (kermax < k) kermax = k-1;
708 if (s0 < sigmin) sigmin = s0;
709 if (sm > sigmax) sigmax = sm;
710 if (co < kappamin) kappamin = co;
711 if (co > kappamax) kappamax = co;
713 deallog <<
"dim ker [" << kermin <<
':' << kermax
714 <<
"] sigma [" << sigmin <<
':' << sigmax
715 <<
"] kappa [" << kappamin <<
':' << kappamax <<
']' << std::endl;
731 template <
typename number>
736 std::size_t mem =
sizeof(*this);
745 DEAL_II_NAMESPACE_CLOSE
void inverse_Tvmult(size_type i, Vector< number2 > &dst, const Vector< number2 > &src) const
number singular_value(const size_type i) const
bool store_diagonals() const
types::global_dof_index size_type
DeclException0(ExcDiagonalsNotStored)
#define AssertIndexRange(index, range)
unsigned int size() const
void inverses_computed(bool are_they)
std::vector< FullMatrix< number > > var_diagonal
FullMatrix< number > & inverse(size_type i)
PreconditionBlockBase(bool store_diagonals=false, Inversion method=gauss_jordan)
unsigned int global_dof_index
#define Assert(cond, exc)
number el(size_type i, size_type j) const
std::size_t memory_consumption(const T &t)
bool same_diagonal() const
::ExceptionBase & ExcIndexRange(int arg1, int arg2, int arg3)
std::vector< FullMatrix< number > > var_inverse_full
void reinit(unsigned int nblocks, size_type blocksize, bool compress, Inversion method=gauss_jordan)
void log_statistics() const
unsigned int n_diagonal_blocks
std::size_t memory_consumption() const
std::vector< LAPACKFullMatrix< number > > var_inverse_svd
LAPACKFullMatrix< number > & inverse_svd(size_type i)
Householder< number > & inverse_householder(size_type i)
::ExceptionBase & ExcNotImplemented()
std::vector< Householder< number > > var_inverse_householder
bool inverses_ready() const
FullMatrix< number > & diagonal(size_type i)
unsigned int n_cols() const
void inverse_vmult(size_type i, Vector< number2 > &dst, const Vector< number2 > &src) const