-
## Rationale
We really need the ability to mark along boundaries for refinement/coarsening.
## Description
See above
## Impact
None - new capability
-
Activities:
1. Evaluate current solver technologies for high aspect ratio meshes.
2. Develop improved coarsening and preconditioning techniques.
3. Evaluate possible algorithmic discretization approac…
-
Hi @ddemidov ,
I am using AMGCL to solve a 2D linear elasticity problem. It has a 2 $\times$ 2 block structure and works fine without nullspace vectors. But when I pass the coordinates to the solver,…
-
I tried to instantiate the matrix-free stuff with `std::complex` vectors, and utterly failed :-) Some of the minor edits necessary are captured in #16717, but the major blocker is that in `mg_transfer…
-
Hello, thanks for you excellent work!
I started the coarsening process from SMPL template with 6890 vertices and could get graphs of nine different resolutions, but I have no idea how to get the …
-
The functionnality available in [GriddedData.py](https://github.com/lesommer/codes/blob/master/GriddedData.py) for coarsening a 2d field or reorganizing an array for building statistics out from value…
-
Currently, we create completely new solution arrays when refining and coarsening (the solver).
- Can we instead just insert/erase some solution data to save memory allocations and some time?
- Is i…
-
Hi,
I am interested in building a DG code using MFEM at its core, specifically targeting conformal Tetrahedron adaption. Ideally this would be dynamic where the mesh would be refined or coarsened i…
-
APF warning: 3 empty parts
This issue has always puzzled me. Is SCOREC/core designed to function properly when parts get emptied? In my experience this warning always leads to a crash somewhere. …
-
## 🚀 Feature
Support graph pooling operation on cliques.
## Motivation
Graph coarsening is common in tasks where we try to extract graph features from different scales. Usually, the input graph…