Re: [deal.II] Adaptive mesh refinement and solution transfer

Yang: I am trying to solve a Laplace problem and refine the mesh adaptively. I am using a CG solver with a symmetric Multigrid preconditioner. I plan to transfer the solution on the initial mesh to the refined mesh, and then use the interpolated solution as the initial guess in the iterati

[deal.II] Re: Clemson Computational Math Seminar: Bruno Blais - Feb 4

Hi all, I am sorry for messing up the title. The talk is of course given on Monday by Matthias as written in the body of the email. Best, Timo On Fri, Mar 25, 2022 at 1:11 PM Timo Heister wrote: > > Hi all, > > I would like to announce the following seminar talk in our Clemson > Computational M

[deal.II] Clemson Computational Math Seminar: Bruno Blais - Feb 4

Hi all, I would like to announce the following seminar talk in our Clemson Computational Math seminar that is related to deal.II. If you are interested, feel free to join using the zoom link below. Date and time: Monday, March 28 at 11:15am Eastern time Speaker: Matthias Maier (Texas A&M Universi

Re: [deal.II] Re: range-based loop over cells

Niklas, You can take a look here but basically if a class defines the begin() and end() iterators, you can do a range-based loop. That's just the C++11 standard. Best, Bruno Le ven. 25 mars 2022 à 08:21, Niklas Fehn a écrit : > so this is

[deal.II] Re: range-based loop over cells

so this is common C++ knowledge, it is not documented in deal.II? simon...@gmail.com schrieb am Donnerstag, 24. März 2022 um 14:21:13 UTC+1: > No, sorry... All cells. Just starting at level 0. Got confused by this > line: > > Triangulation >