Jordi Manyer Fuertes
Jordi Manyer Fuertes
I would have a look at what version of gmsh_jll is loaded, and if that changes depending on the packages you have.
This has been out-done by PR #73 . Closing this.
@ZiwenH I would say the point is only in one of the processors local meshes. In parallel, processors only store a portion of the mesh, not all of it. Otherwise...
It's not really my area, but in general I would advise creating a `DistributedCellField` that can represent that load.
We can probably find a way, but you should be more specific on what exactly you want to do. In short, the algorithm to locate arbitrary points in a mesh...
If the interface moves continuously between timepoints, you can probably take advantage of that: - At the first time step, you simply replicate the vector of points in all subdomains...
Hi @principejavier , sorry for the delay... I agree the mentioned code for `BoundaryTriangulation` is repeated quite a lot. The underlying issue is that although `BoundaryTriangulation` is defined in general,...
> @JordiManyer , @amartinhuertas , if you don't mind I will accept this PR to incorporate the development into master and I will open an issue to keep in mind...
This is what I've implemented for patch-based smoothers in [PR 7](https://github.com/gridap/GridapSolvers.jl/pull/7). It's probably not general enough, and only works for facets (`Df = Dc-1`). Quite inspired by what was done...