[deal.II] Lecture 31.65(Picard iteration)

Hi all, I have a question in the lecture 31.65 that is about Picard iteration. In the lecture, the professor doesn't include system_matrix.reinit (sparsity_pattern), system_rhs.reinit (dof_handler.n_dofs()), and solution.reinit (dof_handler.n_dofs()) in assemble_system(). However, I was wor

[deal.II] Isoparametric testing

I'm trying to test the convergence rates of isoparametric elements for the Poisson equation. To do this I have a circular domain and an exact solution. My understanding is that with linear mappings I should not get optimal convergence in the L2 and H1 norms for elements higher than degree 1. Ho

[deal.II] Isoparametric testing

I'm trying to test the convergence rates of isoparametric elements for the Poisson equation. To do this I have a circular domain and an exact solution. My understanding is that with linear mappings I should not get optimal convergence in the L2 and H1 norms for elements higher than degree 1. Ho

Re: [deal.II] bug in program only with adaptive mesh refinement

> > OK, so F_i would then be (f(u),\varphi_i), right? > > I think the question is whether you do or do not apply > ConstraintMatrix::condense to F. I never really know whether you do or > do not have to do that when you want to use F that way, so I typically > just assemble the (scalar number)

[deal.II] Re: any suggestion how to run same code repeatedly with different boundary condition ?

Thank you !! solve the problem with the second method! I really appreciate this! Jaekwang Kim 2017년 3월 4일 토요일 오후 1시 37분 40초 UTC-6, Jean-Paul Pelteret 님의 말: > > Hi Jaekwang, > > The error message is pointing you to the fact that when you call run() a > second time you end up trying to rebuild

[deal.II] Re: Question regarding P:D:Tria

Hello Daniel, Thanks for the prompt reply. Yes, I thought about this as deal.ii uses P4est which does not support anisotropic refinement. I wanted to confirm that this was indeed the case and I am not missing something. Thanks again for the clarification. On Sunday, March 5, 2017 at 7:48:56

[deal.II] Re: Question regarding P:D:Tria

Rajat, I am using the GridGenerator::hyper_rectangle function to create a > rectangular grid with 1000 X 500 X 1 (0.5 million) elements. > > My question is: - since the coarsest mesh contains 0.5 million elements, > does that mean all the processors have 0.5 million elements? > (I think the ans

[deal.II] Re: Access specific element within a distributed triangulation

Seyed, > But is it necessary to #include ? > Since deal.II won't recognize functions such as MPI_Comm_rank > (MPI_COMM_WORLD, > &myrank) for instance or MPI_Reduce. > Is it implemented in Utilities::MPI::something ? > If you are usi

Re: [deal.II] can we bring variables from outside class...?

Hi, the simplest solution would be just parametrize BoundaryValues constructor. It would look like: template class BoundaryValues : public Function { double param; public: BoundaryValues (double param) : Function() { this->param = param; } virtual double value (const Point &p, c