-
Notifications
You must be signed in to change notification settings - Fork 708
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
MGTwoLevelTransferNonNested: simplices with multiple components
- Loading branch information
Showing
16 changed files
with
269 additions
and
71 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
160 changes: 160 additions & 0 deletions
160
tests/multigrid-global-coarsening/non_nested_multigrid_05.cc
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,160 @@ | ||
| // // --------------------------------------------------------------------- | ||
| // // | ||
| // // Copyright (C) 2020 - 2023 by the deal.II authors | ||
| // // | ||
| // // This file is part of the deal.II library. | ||
| // // | ||
| // // The deal.II library is free software; you can use it, redistribute | ||
| // // it, and/or modify it under the terms of the GNU Lesser General | ||
| // // Public License as published by the Free Software Foundation; either | ||
| // // version 2.1 of the License, or (at your option) any later version. | ||
| // // The full text of the license can be found in the file LICENSE.md at | ||
| // // the top level directory of deal.II. | ||
| // // | ||
| // // --------------------------------------------------------------------- | ||
|
|
||
|
|
||
| /** | ||
| * Test global-coarsening multigrid for a uniformly refined mesh both for | ||
| * simplicial elements and multiple components. | ||
| */ | ||
|
|
||
| #include <deal.II/fe/fe_system.h> | ||
|
|
||
| #include <deal.II/grid/grid_tools.h> | ||
|
|
||
| #include "multigrid_util.h" | ||
|
|
||
| template <int dim, int n_components = 1, typename Number = double> | ||
| void | ||
| test(const unsigned int n_refinements, | ||
| const unsigned int fe_degree_fine, | ||
| const double factor) | ||
| { | ||
| using VectorType = LinearAlgebra::distributed::Vector<Number>; | ||
|
|
||
| const unsigned int min_level = 0; | ||
| const unsigned int max_level = n_refinements; | ||
|
|
||
| MGLevelObject<Triangulation<dim>> triangulations(min_level, max_level); | ||
| MGLevelObject<DoFHandler<dim>> dof_handlers(min_level, max_level); | ||
| MGLevelObject<AffineConstraints<Number>> constraints(min_level, max_level); | ||
| MGLevelObject<std::unique_ptr<Mapping<dim>>> mappings(min_level, max_level); | ||
| MGLevelObject<std::shared_ptr<MGTwoLevelTransferNonNested<dim, VectorType>>> | ||
| transfers(min_level, max_level); | ||
| MGLevelObject<Operator<dim, n_components, Number>> operators(min_level, | ||
| max_level); | ||
|
|
||
|
|
||
| // set up levels | ||
| for (auto l = min_level; l <= max_level; ++l) | ||
| { | ||
| auto &tria = triangulations[l]; | ||
| auto &dof_handler = dof_handlers[l]; | ||
| auto &constraint = constraints[l]; | ||
| auto &op = operators[l]; | ||
|
|
||
| std::unique_ptr<FESystem<dim>> fe = | ||
| std::make_unique<FESystem<dim>>(FE_SimplexP<dim>(fe_degree_fine), | ||
| n_components); | ||
| std::unique_ptr<Quadrature<dim>> quad = | ||
| std::make_unique<QGaussSimplex<dim>>(fe_degree_fine + 1); | ||
| std::unique_ptr<Mapping<dim>> _mapping = | ||
| std::make_unique<MappingFE<dim>>(FE_SimplexP<dim>(fe_degree_fine)); | ||
|
|
||
| mappings[l] = _mapping->clone(); | ||
|
|
||
| // set up triangulation | ||
| Triangulation<dim> tria_tmp; | ||
| GridGenerator::hyper_cube(tria_tmp, -1.0, 1.0); | ||
| tria_tmp.refine_global(l); | ||
|
|
||
| GridGenerator::convert_hypercube_to_simplex_mesh(tria_tmp, tria); | ||
| GridTools::distort_random(factor, | ||
| tria, | ||
| true, | ||
| boost::random::mt19937::default_seed); | ||
|
|
||
| // set up dofhandler | ||
| dof_handler.reinit(tria); | ||
| dof_handler.distribute_dofs(*fe); | ||
|
|
||
| // set up constraints | ||
| IndexSet locally_relevant_dofs; | ||
| DoFTools::extract_locally_relevant_dofs(dof_handler, | ||
| locally_relevant_dofs); | ||
| constraint.reinit(locally_relevant_dofs); | ||
| VectorTools::interpolate_boundary_values(*_mapping, | ||
| dof_handler, | ||
| 0, | ||
| Functions::ZeroFunction<dim>( | ||
| n_components), | ||
| constraint); | ||
| constraint.close(); | ||
|
|
||
| // set up operator | ||
| op.reinit(*_mapping, dof_handler, *quad, constraint); | ||
| } | ||
|
|
||
| // set up transfer operator | ||
| for (unsigned int l = min_level; l < max_level; ++l) | ||
| { | ||
| transfers[l + 1] = | ||
| std::make_shared<MGTwoLevelTransferNonNested<dim, VectorType>>(); | ||
| transfers[l + 1]->reinit(dof_handlers[l + 1], | ||
| dof_handlers[l], | ||
| *mappings[l + 1], | ||
| *mappings[l], | ||
| constraints[l + 1], | ||
| constraints[l]); | ||
| } | ||
|
|
||
| MGTransferGlobalCoarsening<dim, VectorType> transfer( | ||
| transfers, | ||
| [&](const auto l, auto &vec) { operators[l].initialize_dof_vector(vec); }); | ||
|
|
||
|
|
||
| GMGParameters mg_data; // TODO | ||
|
|
||
| VectorType dst, src; | ||
| operators[max_level].initialize_dof_vector(dst); | ||
| operators[max_level].initialize_dof_vector(src); | ||
|
|
||
| operators[max_level].rhs(src); | ||
|
|
||
| ReductionControl solver_control( | ||
| mg_data.maxiter, mg_data.abstol, mg_data.reltol, false, false); | ||
|
|
||
| mg_solve(solver_control, | ||
| dst, | ||
| src, | ||
| mg_data, | ||
| dof_handlers[max_level], | ||
| operators[max_level], | ||
| operators, | ||
| transfer); | ||
|
|
||
| deallog << dim << ' ' << fe_degree_fine << ' ' << n_refinements << ' ' | ||
| << n_components << ' ' << "simplex" << ' ' | ||
| << solver_control.last_step() << std::endl; | ||
| } | ||
|
|
||
| int | ||
| main(int argc, char **argv) | ||
| { | ||
| Utilities::MPI::MPI_InitFinalize mpi_initialization(argc, argv, 1); | ||
| MPILogInitAll all; | ||
|
|
||
| deallog.precision(8); | ||
| static constexpr unsigned int dim = 2; | ||
| static constexpr unsigned int max_simplex_degree = 2; | ||
|
|
||
| const double factor = .36; | ||
| for (unsigned int n_refinements = 2; n_refinements <= 3; ++n_refinements) | ||
| for (unsigned int degree = 1; degree <= max_simplex_degree; ++degree) | ||
| test<dim, 1>(n_refinements, degree, factor); | ||
|
|
||
| for (unsigned int n_refinements = 2; n_refinements <= 3; ++n_refinements) | ||
| for (unsigned int degree = 1; degree <= max_simplex_degree; ++degree) | ||
| test<dim, dim>(n_refinements, degree, factor); | ||
| } |
Oops, something went wrong.