| #
20e8089b
|
| 24-Feb-2016 |
Toby Isaac <tisaac@uchicago.edu> |
DMP4est: simplify DMForestTemplate() interface
Now when you want to create dmAdapted from dm, just call
DMForestTemplate(dm,MPI_COMM_NULL,&dmAdapted).
If you called DMSetUp(dmAdapted) right af
DMP4est: simplify DMForestTemplate() interface
Now when you want to create dmAdapted from dm, just call
DMForestTemplate(dm,MPI_COMM_NULL,&dmAdapted).
If you called DMSetUp(dmAdapted) right after this, the topology of dmAdapted would essentially be a copy of dm, but you can do things like set adaptivity labels, change the overlap, and change the partitioning before calling set up, and then all of those changes will be executed in DMSetUp().
show more ...
|
| #
ba936b91
|
| 23-Feb-2016 |
Toby Isaac <tisaac@uchicago.edu> |
WIP: Simplify/correct adaptivity interface for DMForest
|
| #
6b4bea12
|
| 23-Feb-2016 |
Mark Adams <mfadams@lbl.gov> |
Merge branch 'tisaac/dmforest' of bitbucket.org:petsc/petsc into tisaac/dmforest
|
| #
ebdf65a2
|
| 23-Feb-2016 |
Toby Isaac <tisaac@uchicago.edu> |
DMForest: switch adaptivity from an array of markers to label
Now that labels are general, it makes more sense
|
| #
27d4645f
|
| 23-Feb-2016 |
Toby Isaac <tisaac@uchicago.edu> |
DMForest: added DMIsForest() and DMForestRegisterType()
|
| #
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 ...
|
| #
a0452a8e
|
| 12-Nov-2015 |
Toby Isaac <tisaac@uchicago.edu> |
DMP4est: work on coarsening
1) We want the coarse mesh to inherit as many options as possible from the parent, so there is now a DMForestTemplate() method for this type of operation
2) Partitioning
DMP4est: work on coarsening
1) We want the coarse mesh to inherit as many options as possible from the parent, so there is now a DMForestTemplate() method for this type of operation
2) Partitioning for coarsening is a major p4est option, so I added it to the DMP4est interface
show more ...
|
| #
56ba9f64
|
| 12-Nov-2015 |
Toby Isaac <tisaac@uchicago.edu> |
DMForest: introduce initial refinement level.
The idea being that, when a minimum and an initial refinement level are specified, then a hierarchy is created that spans them, much like -dm_plex_refin
DMForest: introduce initial refinement level.
The idea being that, when a minimum and an initial refinement level are specified, then a hierarchy is created that spans them, much like -dm_plex_refine_hierarchy.
show more ...
|
| #
c7eeac06
|
| 22-Oct-2014 |
Toby Isaac <tisaac@ices.utexas.edu> |
DMForest: completion of most interface routines.
|
| #
db4d5e8c
|
| 22-Oct-2014 |
Toby Isaac <tisaac@ices.utexas.edu> |
Forest: try a minimal class
|
| #
3616b93e
|
| 21-Oct-2014 |
Toby Isaac <tisaac@ices.utexas.edu> |
DMForest: start impl with struct definition
|
| #
c9aa14a7
|
| 21-Oct-2014 |
Toby Isaac <tisaac@ices.utexas.edu> |
Started DMForest interface
|