| 6aa884bb | 25-Jan-2016 |
Toby Isaac <tisaac@uchicago.edu> |
ts ex11: start mesh conversion code
Doesn't work yet. All plex<->p4est code has assumed no ghost cells thus
far. I still conjecture the FV can be implemented just as efficiently
without ghost cell
ts ex11: start mesh conversion code
Doesn't work yet. All plex<->p4est code has assumed no ghost cells thus
far. I still conjecture the FV can be implemented just as efficiently
without ghost cells, but my options right now are (a) try to replace
ghost cells, then address plex<->p4est fv concerns, or (b) make
plex<->p4est fv work for ghost cells. Given the time constraints, I'm
going to go for the latter and hope that I can convince people that
removing ghost cells is worthwhile in the future.
show more ...
|
| 36cda41c | 20-Dec-2015 |
Toby Isaac <tisaac@uchicago.edu> |
DMP4est: fix symmetry operations
- DMP8est face orientation table had a missing minus sign
- I had the order of the DihedralCompose operands reversed. It's tough
to keep track of covariant/contra
DMP4est: fix symmetry operations
- DMP8est face orientation table had a missing minus sign
- I had the order of the DihedralCompose operands reversed. It's tough
to keep track of covariant/contravariant sometimes.
show more ...
|
| 7a8872f4 | 11-Dec-2015 |
Toby Isaac <tisaac@uchicago.edu> |
DMP4est: fix DMPforestLabelsInitialize()
For non-cells, I was always taking the "it's on the outside of the tree"
path, instead of checking whether the points were in the interior of the
tree first. |
| bb2ed840 | 24-Nov-2015 |
Toby Isaac <tisaac@uchicago.edu> |
DMP4est: implement hierarchical transfer SFs
Each cell creates a list of the points in its closure that have dofs in
the scheme, and a PetscSFNode is created for each point in that closure.
Then, th
DMP4est: implement hierarchical transfer SFs
Each cell creates a list of the points in its closure that have dofs in
the scheme, and a PetscSFNode is created for each point in that closure.
Then, the coarse mesh is transfered to overlap the first, so that cell
overlap from fine to coarse can be determined. Then, in looping over
the closure lists of the fine cells, we can match fine points to their
containing coarse points, which allows construction of a point-transer
SF, which can then be expanded into a dof transfer SF.
WIP DMP4est: repartitioning coarse to match fine
WIP DMP4est: factor out coarse/fine overlap code
WIP DMP4est: finally on the right track with the transfer PetscSF
DMP4est: finished DMPforetGetCellCoveringSF
WIP DMP4est: use the covering cells to compute the transfer SF
DMP4est: first completion of DMPforestGetTransferSF()
show more ...
|
| 438c3a38 | 23-Nov-2015 |
Toby Isaac <tisaac@uchicago.edu> |
DMP4est: initialize labels from baseDM
This part is made easy by the fact the the base DM is redundant: it's
just a question of finding the right coarse cell to look up. Inheriting
labels from a co
DMP4est: initialize labels from baseDM
This part is made easy by the fact the the base DM is redundant: it's
just a question of finding the right coarse cell to look up. Inheriting
labels from a coarse/fine DM will require setting up the intergrid
transfer SF's.
show more ...
|
| 9a81d013 | 20-Nov-2015 |
Toby Isaac <tisaac@uchicago.edu> |
DMP4est: ex12 almost runs clean.
- I had to fix some function namings in the DMP4est implementation.
- Every p4est connectivity needs a geometry in our implementation.
- Create DMShareDiscretization
DMP4est: ex12 almost runs clean.
- I had to fix some function namings in the DMP4est implementation.
- Every p4est connectivity needs a geometry in our implementation.
- Create DMShareDiscretization to indicate that a second DM is
essentially a different representation of the same data as the first,
and to allow them to have the same PetscDS related data.
There is still a problem with reference counting related to
{SNES,KSP,PC}->dm to work out.
show more ...
|