From: David Wells Date: Mon, 20 May 2019 19:55:38 +0000 (-0400) Subject: Improve a few 9.1 changelog entries. X-Git-Tag: v9.1.0~5^2 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=8d4aeeeae1492882975307ac590cd5f2c4f7edc1;p=dealii.git Improve a few 9.1 changelog entries. 1. Add a link to GinkgoWrappers::SolverBase 2. Fix description of Subscriptor changes 3. delete some duplicate changelog entries 4. Use %Function where appropriate 5. Minor grammar fixes --- diff --git a/doc/news/9.0.1-vs-9.1.0.h b/doc/news/9.0.1-vs-9.1.0.h index 15cea0a2c2..281901251d 100644 --- a/doc/news/9.0.1-vs-9.1.0.h +++ b/doc/news/9.0.1-vs-9.1.0.h @@ -90,7 +90,7 @@ inconvenience this causes.
  • - Changed: The constructor for Subscriptor requires providing a pointer to a boolean + Changed: Subscriptor::subscribe() requires providing a pointer to a boolean that can be used to signal validity of the object pointed to by the subscribing object.
    @@ -327,10 +327,11 @@ inconvenience this causes.
  • New: Support for Ginkgo, a high-performance numerical linear algebra library - has been added. Ginkgo provides advanced highly optimized linear solvers, - matrix formats and an abstraction to easily create linear operators on both - the cpu and the gpu. The deal.II's Ginkgo interface can currently be used to - solve linear systems using Krylov solvers with the cuda and OpenMP paradigms. + has been added with classes inheriting from GinkgoWrappers::SolverBase. Ginkgo + provides advanced highly optimized linear solvers, matrix formats and an + abstraction to easily create linear operators on both the cpu and the gpu. The + deal.II's Ginkgo interface can currently be used to solve linear systems using + Krylov solvers with the cuda and OpenMP paradigms.
    (Ginkgo developers, 2019/01/30)
    • @@ -370,7 +371,7 @@ inconvenience this causes.
  • - New: Function FiniteElement::compare_for_domination() inspects two + New: %Function FiniteElement::compare_for_domination() inspects two FiniteElement objects upon FiniteElementDomination, and uses a codim parameter that determines in which subspace we actually compare them.
    @@ -644,15 +645,6 @@ inconvenience this causes. (Luca Heltai, 2019/04/11)
    • -
  • - New: Member function hp::FECollection::find_dominated_fe_extended() - returns the index of the least dominating finite element out of a given - set of indices. If none was found, the search will be extended on the - complete collection. -
    - (Marc Fehling, 2019/04/08) -
    • -
  • New: Member function hp::FECollection::find_dominating_fe_extended() returns the index of the most dominating finite element out of a given @@ -662,14 +654,6 @@ inconvenience this causes. (Marc Fehling, 2019/04/08)
    • -
  • - New: Member function hp::FECollection::find_dominated_fe() - returns the index of the least dominating finite element out of a given - set of indices. -
    - (Marc Fehling, 2019/04/08) -
    • -
  • New: Member function hp::FECollection::find_dominating_fe() returns the index of the most dominating finite element out of a given @@ -910,7 +894,7 @@ inconvenience this causes.
  • - New: Function GridTools::guess_point_owner(), which uses a covering rtree + New: %Function GridTools::guess_point_owner(), which uses a covering rtree to guess which processes own the points of the given vector of points.
    (Giovanni Alzetta, 2019/02/25) @@ -948,7 +932,7 @@ inconvenience this causes.
  • - New: Function MGConstrainedDoFs::make_no_normal_flux_constraints which adds + New: %Function MGConstrainedDoFs::make_no_normal_flux_constraints() which adds functionality for no normal flux constraints during geometric mutigrid computations. Currently, this function is limited to meshes with no normal flux boundaries normal to the x-, y-, or z-axis. @@ -1039,7 +1023,7 @@ inconvenience this causes.
  • - Changed: Function GridGenerator::general_cell() can now generate + Changed: %Function GridGenerator::general_cell() can now generate a cell of dimension `dim` inside a space of dimension `spacedim` with `dim <= spacedim`
    @@ -1140,7 +1124,7 @@ inconvenience this causes.
  • - New: Function GridTools::build_global_description_tree which exchanges a given + New: %Function GridTools::build_global_description_tree which exchanges a given vector of bounding boxes on all processes and uses the result to build an Rtree with packing algorithm.
    @@ -1694,13 +1678,6 @@ inconvenience this causes. (Bruno Turcksin, 2018/08/01)
    • -
  • - Added support for high-order VTU output by using newly - introduced Lagrange VTK cells. -
    - (Alexander Grayver, 2018/08/01) -
    • -
  • Added support for high-order VTK output by using newly introduced Lagrange VTK cells. @@ -1852,10 +1829,11 @@ inconvenience this causes.
  • - Fixed: TrilinosWrappers::MPI::Vector::reinit check now checks if - parallel_partitioner is_ascending_and_one_to_one before calling - make_trilinos_map because make_trilinos_map may be able to make - a linear map if is_ascending_and_one_to_one is true. + Fixed: TrilinosWrappers::MPI::Vector::reinit now checks if + IndexSet::is_ascending_and_one_to_one is `true` for + TrilinosWrappers::MPI::Vector::parallel partitioner before calling + IndexSet::make_trilinos_map because IndexSet::make_trilinos_map may be able + to make a linear map if the property holds.
    (Joshua Hanophy, 2018/06/16)