Thanks Denis!
2017-11-30 17:31 GMT-05:00 Denis Davydov :
> Hi Bruno,
>
> AFAIK, there is a simple solution: make initial vector (or subspace)
> perpendicular to those constrained entries.
> That is, if you do Lancoz, set random initial vector and then zero out
> constrained DoFs.
> Then being Kry
Hi Bruno,
AFAIK, there is a simple solution: make initial vector (or subspace)
perpendicular to those constrained entries.
That is, if you do Lancoz, set random initial vector and then zero out
constrained DoFs.
Then being Krylov-based method it should form subspaces {x, Ax, A^2x,...}
orthogo
May the same bug exist for the complex arithmetic case?
When using the PETSc wrappers as in step-36 (installed with PetscScalar =
complex) and using MappingCollection as discussed before. I now try:
//static std::map bval;
static std::map bval;
ZeroFunction
Hello everyone!
This is deal.II newsletter #13.
It automatically reports recently merged features and discussions about the
deal.II finite element library.
## Below you find a list of recently proposed or merged features:
#5558: Avoid MPI calls in destructors with exceptions. (proposed by drwe
>> Then you have to simplify your problem as much as possible until we
>> can reproduce it.
>
> I am not sure of the best way to do it, as a have a rather large program and
> I need it to build the system matrix. In your experience, saving the
> matrices
> to files and then just load them would be
Hi all,
In step-36, there is an explanation on how Dirichlet boundary conditions
introduce spurious eigenvalues because some dofs are constrained. However,
there is no mention of hanging nodes. So I am wondering if I can treat them
as shown for the Dirichlet boundary, i.e, the only difference
Deal all,
Sorry for the late reply. I had some urgent matters to solve, and had to
put this investigation to a halt for a while.
> Then you have to simplify your problem as much as possible until we
> can reproduce it.
I am not sure of the best way to do it, as a have a rather large program
and
