{"push_id":2553793772,"size":14,"distinct_size":14,"ref":"refs/heads/develop","head":"ea50776573f163acc58d63b6184cef51612f355d","before":"7bd03d46bad06c49403c9a3176ab96e76cf616a3","commits":[{"sha":"5c6bcf6a4e7aa2b41b3b29f2194bf5e3932ade77","author":{"name":"Matthias Mayr","email":"e4f1411f5dd6bae99ad6ca881cbdba7866025526@sandia.gov"},"message":"WIP (#2262): find coarse maps for 2-level scheme\n\nAssumption:\nEnforce perfect region-to-processor mapping, such that\nuncoupled aggregation and tentativeP result in a unsmoothed\nprolongator, that respects region interfaces.\n\nUse aggregates to build composite and quasiRegional maps on\ncoarse level. Note that regional coarse level map already exists\nsince it is just the RowMap() of the coarse level operator produced\nby MueLu.\n\nNote: We add a small perturbation in an off-diagonal entry of the\nDirichlet row to fool MueLu's Dirichlet detection. This will\nprobably not be necessary when using structured aggregation.","distinct":true,"url":"https://api.github.com/repos/trilinos/Trilinos/commits/5c6bcf6a4e7aa2b41b3b29f2194bf5e3932ade77"},{"sha":"dec93fb3a75c3b708c686e202ab27b7a7df4f308","author":{"name":"Matthias Mayr","email":"e4f1411f5dd6bae99ad6ca881cbdba7866025526@sandia.gov"},"message":"WIP (#2262): recursive V-cycle for regions MG\n\nRecursive implementation of V-cycle. Reproduces exact solution\nwith multigrid as a solver.\n\n- Added data structures for recursively formed mutli-level case.\n- Impose restrictions on the mesh to overcome issues of the\n  smoothed-aggregation tentative prolongator. See 'mk1DRegionFile.m'\n  for details. These restrictions should go away as soon as we use\n- Write final solution to MatrixMarket file and plot it in Matlab.","distinct":true,"url":"https://api.github.com/repos/trilinos/Trilinos/commits/dec93fb3a75c3b708c686e202ab27b7a7df4f308"},{"sha":"27e265fbbb7a21e3ea6b157002f4415499fec3aa","author":{"name":"Matthias Mayr","email":"e4f1411f5dd6bae99ad6ca881cbdba7866025526@sandia.gov"},"message":"WIP (#2262): fix compiler warnings","distinct":true,"url":"https://api.github.com/repos/trilinos/Trilinos/commits/27e265fbbb7a21e3ea6b157002f4415499fec3aa"},{"sha":"326c4b6b9a7e04e27a4e077c6efc72dfa1c67b48","author":{"name":"Matthias Mayr","email":"e4f1411f5dd6bae99ad6ca881cbdba7866025526@sandia.gov"},"message":"WIP (#2262): use struct. agg. and P for coarse GIDs\n\n- Using Luc's uncoupled structured aggregation to create\ntentative P.\n\n- For a two level scheme with only one group,\nwe can identify the pairs of duplicated GIDs on the\ncoarse level by looking at the prolongator, only.\nAggregates are not necessary anymore.\n\n- Added 2D test case 'caseFifteen' with perfect coarsening\nrate of 3h\n\nStatus:\n- works for 1D problems. Same results as before.\n\nToDo:\n- extend to 2D problems\n- extend to multilevel case\n- How are Dirichlet BCs treated?","distinct":true,"url":"https://api.github.com/repos/trilinos/Trilinos/commits/326c4b6b9a7e04e27a4e077c6efc72dfa1c67b48"},{"sha":"bab45ef3ec75cf914107bafb5d5ca12d48b06b41","author":{"name":"Matthias Mayr","email":"e4f1411f5dd6bae99ad6ca881cbdba7866025526@sandia.gov"},"message":"WIP (#2305): add 2D test with 3h coarsening\n\nAdded a two-dimensional test case 'caseFifteen' with a coarsening by\n3h to figure out how to use Luc's uncoupled structured aggregation.","distinct":true,"url":"https://api.github.com/repos/trilinos/Trilinos/commits/bab45ef3ec75cf914107bafb5d5ca12d48b06b41"},{"sha":"ecdbe090ddd24cc8bafd0786f86aaf41eeeabffd","author":{"name":"Matthias Mayr","email":"e4f1411f5dd6bae99ad6ca881cbdba7866025526@sandia.gov"},"message":"xml: add missing 'CoarseMap' factory","distinct":true,"url":"https://api.github.com/repos/trilinos/Trilinos/commits/ecdbe090ddd24cc8bafd0786f86aaf41eeeabffd"},{"sha":"ac6e16a33f7cb6f0a3bef9d848e954c60515b6d9","author":{"name":"Matthias Mayr","email":"e4f1411f5dd6bae99ad6ca881cbdba7866025526@sandia.gov"},"message":"WIP (#2305): fix quasiReg map on coarse level\n\nFix identification of duplicates in the quasiRegional map on the\ncoarse level.\n\nThough, still a bug in identifying duplicate pairings on the fine level.","distinct":true,"url":"https://api.github.com/repos/trilinos/Trilinos/commits/ac6e16a33f7cb6f0a3bef9d848e954c60515b6d9"},{"sha":"17a5e42fc09a9e70849e676ab951d00c3fca95cc","author":{"name":"Matthias Mayr","email":"e4f1411f5dd6bae99ad6ca881cbdba7866025526@sandia.gov"},"message":"WIP (#2305): enhance plotting of solution\n\nmove plotting to separate function to also accont for plotting\nof two-dimensional problems.\n\nnote: WIP. Need to fix the ordering of values in the solution vector\nto correspond to ascending GIDs rather than to processors.","distinct":true,"url":"https://api.github.com/repos/trilinos/Trilinos/commits/17a5e42fc09a9e70849e676ab951d00c3fca95cc"},{"sha":"9918fa0c78fdd79165f851250a69065811920601","author":{"name":"Matthias Mayr","email":"e4f1411f5dd6bae99ad6ca881cbdba7866025526@sandia.gov"},"message":"WIP (#2305): fixed coarse level quasiRegional map\n\n- rewrote creation of quasiRegional map on coarse level, s.t. the ordering of the entries in\n  the quasiRegional map corresponds to the ordering in the regional map.\n- added some more 2D test cases\n- removed some map screen output\n\nStatus: Problems that satisfy all of these properties work:\n- square domains\n- equally sized squared regions\n- same number of regions in x- and y-direction\n\nNote: Dirichlet values and local number of nodes per direction for structured aggregation\nmust be hardcoded (for now).","distinct":true,"url":"https://api.github.com/repos/trilinos/Trilinos/commits/9918fa0c78fdd79165f851250a69065811920601"},{"sha":"4dee48e614f323a07277a7d075cd85e9cd6dc8e6","author":{"name":"Matthias Mayr","email":"e4f1411f5dd6bae99ad6ca881cbdba7866025526@sandia.gov"},"message":"WIP (#2305): remove outdated code\n\nPreliminary code for the identification of duplicated pairs of coarse level interface\nGIDs has been removed. We now rely on the strategy ECoarseMapReconstruction::prolongator_based_importer.","distinct":true,"url":"https://api.github.com/repos/trilinos/Trilinos/commits/4dee48e614f323a07277a7d075cd85e9cd6dc8e6"},{"sha":"891c63825eb5f5510882b1e3c43df5074b2ebe75","author":{"name":"Matthias Mayr","email":"e4f1411f5dd6bae99ad6ca881cbdba7866025526@sandia.gov"},"message":"WIP (#2305): add comments and documentation","distinct":true,"url":"https://api.github.com/repos/trilinos/Trilinos/commits/891c63825eb5f5510882b1e3c43df5074b2ebe75"},{"sha":"2e7475e3eb71e687ee6b9e9441147aef28cee9d2","author":{"name":"Matthias Mayr","email":"e4f1411f5dd6bae99ad6ca881cbdba7866025526@sandia.gov"},"message":"add new testcase","distinct":true,"url":"https://api.github.com/repos/trilinos/Trilinos/commits/2e7475e3eb71e687ee6b9e9441147aef28cee9d2"},{"sha":"f26149715d3e0bbe882e0318985e96ef56762fad","author":{"name":"Matthias Mayr","email":"e4f1411f5dd6bae99ad6ca881cbdba7866025526@sandia.gov"},"message":"HHG: do not build outdated code by Max","distinct":true,"url":"https://api.github.com/repos/trilinos/Trilinos/commits/f26149715d3e0bbe882e0318985e96ef56762fad"},{"sha":"ea50776573f163acc58d63b6184cef51612f355d","author":{"name":"Matthias Mayr","email":"e4f1411f5dd6bae99ad6ca881cbdba7866025526@sandia.gov"},"message":"WIP (#2262): remove aggregate-based strategy\n\nRemove the first implementation based on aggregates as this requires\naggregate information in a way, that is non-typical.\nIn particular, we relied on the root node ID, which seems to have no\ntrue meaning at any other place in MueLu and rather exists for bookkeeping\nreasons only.\n\nNow, we use a prolongator-based approach for identification of coarse-level duplicates.\n\nThis commit reverts changes to central MueLu routines, such that we now can merge\nwith the develop branch again without messing with MueLu.","distinct":true,"url":"https://api.github.com/repos/trilinos/Trilinos/commits/ea50776573f163acc58d63b6184cef51612f355d"}]}
{"actor":{"display_login":"mayrmt"}}