Luca Heltai
Luca Heltai
In the test, the number of faces that deal.II returns is `102`. The output contains the correct number (110). We (@nicola-giuliani and I) are trying to understand why some raw_quads...
PR #10174 reminded us that there is a problem in the fast algorithm, so we had to resort to the slow function ``` return find_active_cell_around_point(mapping, mesh, p, marked_vertices); ``` in...
This PR enables constraints in KINSOL. May go in 10.0 if it's too late for 9.3. @bangerth ?
Currently we support CGAL versions > 5.0. From 5.0 onwards, cgal is a header only library. While this should simplify its detection and installation, there are issues in the ways...
- [x] Make sure `cgal_triangulation_to_dealii_triangulation` works with c3t3 - [x] Extract boundary mesh `dealii::Triangulation` to `CGAL::Surface_mesh` - [x] Create a deal.II triangulation from any CGAL supported file - [x] Create...
GridTools::find_active_cell_around_point(tria,p,marked_vertices) fails in a case like this  because if marked_vertices is not empty the algorithm does the following: - searches the closes vertex (V5 in this case) - searches...
When creating a co-dimension one grid like this one: deal.II fails with this assertion: ~~~ -------------------------------------------------------- An error occurred in line of file in function void dealii::Triangulation::create_triangulation(const std::vector&, const std::vector&,...
This is a draft PR that I would like to use as a discussion a class that can be used for general coupling operators. I would like to compute bilinear...
_From [[email protected]](https://code.google.com/u/111126369971033778052/) on August 22, 2014 14:29:52_ FE_DGQ and FE_Nedelec use a scheme whereby they defer construction of embedding and/or restriction matrices until they are in fact needed. The guard...