From 429dd7a870ee051bc990f6e10f9245126e355421 Mon Sep 17 00:00:00 2001 From: guido Date: Wed, 24 May 2000 22:28:57 +0000 Subject: [PATCH] sorted in time git-svn-id: https://svn.dealii.org/trunk@2940 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/doc/news/2000/c-3-0.html | 391 ++++++++++++++++--------------- 1 file changed, 207 insertions(+), 184 deletions(-) diff --git a/deal.II/doc/news/2000/c-3-0.html b/deal.II/doc/news/2000/c-3-0.html index e1c996a325..9ee78dc386 100644 --- a/deal.II/doc/news/2000/c-3-0.html +++ b/deal.II/doc/news/2000/c-3-0.html @@ -13,6 +13,15 @@

General

    +

  1. + Improved: Dependence on the files forward_declarations.h has been widely + removed to improve compilation time +
    + (GK 2000/05/24) +

    + +

  2. Fix: configure now uses config.guess to determine the @@ -26,19 +35,6 @@

    base

      -

    1. - New multithreading scheme is implemented. -
      - (WB 2000/04/13) -

      - -

    2. - Improved: Subscriptor prints the - real class name if a subscribed object is deleted. -
      - (GK 2000/04/12) -

      -

    3. New: There is now a function invert (Tensor<2,dim>) that returns the inverse of a tensor of @@ -46,70 +42,37 @@
      (WB 2000/04/14)

      -
    - - -

    lac

    - -

    1. - Change: the solver classes in LAC lost their first template - argument. Their names are now - SolverXX<VECTOR>, where - XX denotes the name of the solver - (e.g. CG, GMRES, etc). Furthermore, the - inheritance from Solver was made private - to reflect the logical structure. + New multithreading scheme is implemented.
      - (GK 2000/04/25) + (WB 2000/04/13)

    2. - New: EigenInverse implements inverse - iteration by Wieland. + Improved: Subscriptor prints the + real class name if a subscribed object is deleted.
      - (GK 2000/04/20) + (GK 2000/04/12)

      +
    -

  3. - New: EigenPower implements power - method by von Mises -
    - (GK 2000/04/19) -

    -

  4. - New: PreconditionBlockSSOR::set_omega - allows to change the relaxation parameter. -
    - (GK 2000/04/12) -

    -

  5. - Fix: SolverCG counts steps properly. -
    - (GK 2000/04/25) -

    +

    lac

    +

    1. - New: SolverXX: There is a virtual function - print_vectors called in every step. It is void in the - solver itself but can be used to print intermediate iteration - vectors. + New: Class PreconditionBlockJacobi
      - (GK 2000/04/05) -

      + (GK 2000/05/24)

    2. - New: there are now functions Vector::swap - and BlockVector::swap, as well as - global functions swap(u,v) that - exchange the data of two vectors without needing a temporary - vector and without copying around data. Their run-time is - therefore independent of the length of the vectors. + New: SolverControl has an interface + to ParameterHandler, definining and + reading parameters from a file automatically.
      - (WB 2000/05/02) + (GK 2000/05/24)

    3. @@ -128,25 +91,6 @@ (WB 2000/05/08)

      -

    4. - New: SwappableVector: Class that - allows to swap out the data of a vector to disk and reload it - later on. It also has a function to preload the data before its - use in a separate thread if the library is configured for - multi-threading. -
      - (WB 2000/05/03) -

      - -

    5. - Fix: the ``copy-like'' constructor of - SparsityPattern that copies another - object and adds some off-diagonals had a bug that caused an - exception in some cases. This is now fixed. -
      - (WB 2000/05/04) -

      -

    6. Fix: the FullMatrix::mmult and @@ -168,114 +112,148 @@
      (WB 2000/05/05)

      -
    - - -

    deal.II

    - -

    1. - New: DataOut::clear_data_vectors - allows to re-use an object without deleting the DoFHandler + Fix: the ``copy-like'' constructor of + SparsityPattern that copies another + object and adds some off-diagonals had a bug that caused an + exception in some cases. This is now fixed.
      - (GK 2000/04/05) + (WB 2000/05/04)

    2. - New: class DoFPrintSolverStep prints - intermediate vectors of a solver as finite element functions using - DataOut. + New: SwappableVector: Class that + allows to swap out the data of a vector to disk and reload it + later on. It also has a function to preload the data before its + use in a separate thread if the library is configured for + multi-threading.
      - (GK 2000/04/05) + (WB 2000/05/03)

    3. - New: class GradientEstimator - estimates the norm of the gradient on each cell from finite - difference approximations. + New: there are now functions Vector::swap + and BlockVector::swap, as well as + global functions swap(u,v) that + exchange the data of two vectors without needing a temporary + vector and without copying around data. Their run-time is + therefore independent of the length of the vectors.
      - (WB 2000/04/14) + (WB 2000/05/02)

    4. - New: DoFTools::extract_boundary_dofs - finds all degrees of freedom which are at the boundary and belong to - specified components. + Fix: SolverCG counts steps properly.
      - (WB 2000/04/17) + (GK 2000/04/25)

    5. - New: DoFTools::compute_intergrid_constraints - allows to use different discretization grids for different - variables. + Change: the solver classes in LAC lost their first template + argument. Their names are now + SolverXX<VECTOR>, where + XX denotes the name of the solver + (e.g. CG, GMRES, etc). Furthermore, the + inheritance from Solver was made private + to reflect the logical structure.
      - (WB 2000/04/15) + (GK 2000/04/25)

      -

    6. - New: IntergridMap::get_{source,destination}_grid - functions return the grids for which the map was created. +

    7. + New: EigenInverse implements inverse + iteration by Wieland.
      - (WB 2000/04/19) + (GK 2000/04/20)

      -

    8. - Fix: FESystem::reinit() generated - an exception if update_support_points - was set. +

    9. + New: EigenPower implements power + method by von Mises
      - (WB 2000/05/10) + (GK 2000/04/19)

      -

    10. - Change: the return value of - DoFHandler::max_couplings_between_dofs () - is bounded by DoFHandler::n_dofs(). +

    11. + New: PreconditionBlockSSOR::set_omega + allows to change the relaxation parameter.
      - (Ralf Hartmann 2000/05/11) + (GK 2000/04/12)

      -

    12. - New: FEValuesBase::get_cell () - returns present cell. +

    13. + New: SolverXX: There is a virtual function + print_vectors called in every step. It is void in the + solver itself but can be used to print intermediate iteration + vectors.
      - (Ralf Hartmann 2000/05/11) + (GK 2000/04/05)

      -

    14. - New: DoFTools::extract_hanging_node_dofs () - identifies nodes that will be constrained by hanging node constraints. +

    + + + +

    deal.II

    + +
      +

    1. + Changed: FE_DGx::restriction is + not an interpolation any more but a local projection which is + more reasonable for DG elements.
      - (WB 2000/05/12) + (Ralf Hartmann 2000/05/22)

      -

    2. - New: DoFRenumbering::sort_selected_dofs_back () - sorts selected degrees of freedom to the end of the index - range. +

    3. + Changed: enum + MeshSmoothing is moved into the + Triangulation class.
      - (WB 2000/05/12) + (Ralf Hartmann 2000/05/18)

    4. - Change: DoFTools::make_hanging_node_constraints () - does not use the user flags any more, and can thus run in - parallel more than once. -
      - (WB 2000/05/15) + New: Triangulation::patch_level_1 + is a new mesh smoothing. A mesh of patch level 1 consists of + patches, i.e. they consists of cells that are all refined at + least once.

      -

    5. - Extended: DoFTools::make_sparsity_pattern () - now accepts a template parameter as sparsity pattern. This - allows to use this function for the usual - SparsityPattern, or for - BlockSparsityPattern arguments. -
      - (WB 2000/05/15) +

      + Changed: As follows from the existence of this new smoothing, + maximum_smoothing will include this + smoothing. +

      + +

      + (Ralf Hartmann 2000/05/18) +

      + +

    6. + Changed: the + MatrixTools::apply_boundary_values + now uses a much faster algorithm when working on matrices with + symmetric sparsity patterns. On the other hand, it does no more + eliminate whole rows when a matrix has a non-symmetric sparsity + pattern, or if the user (through a new flag) tells the function + that this is not necessary, for example if the matrix itself is + non-symmetric. +

      + +

      + For symmetric sparsity patterns, the algorithm now eliminates + each boundary value in O(m*log(m)) steps instead of + O(N*log(m)), where N=number of rows of the matrix, and m=number + of entries per row. Note that m is roughly constant, + irrespective of N, so the old algorithm became slower with + finer grids, while the new one is O(1) for each boundary degree + of freedom. +

      + +

      + (John Burnell, WB 2000/05/17)

    7. @@ -306,7 +284,7 @@ Several functions in ConstraintMatrix.
      - (WB 2000/05/16 and later) + (WB 2000/05/16 ...)

    8. @@ -318,62 +296,107 @@ (John Burnell, WB 2000/05/16)

      -

    9. - Changed: the - MatrixTools::apply_boundary_values - now uses a much faster algorithm when working on matrices with - symmetric sparsity patterns. On the other hand, it does no more - eliminate whole rows when a matrix has a non-symmetric sparsity - pattern, or if the user (through a new flag) tells the function - that this is not necessary, for example if the matrix itself is - non-symmetric. +

    10. + Change: DoFTools::make_hanging_node_constraints () + does not use the user flags any more, and can thus run in + parallel more than once. +
      + (WB 2000/05/15)

      -

      - For symmetric sparsity patterns, the algorithm now eliminates - each boundary value in O(m*log(m)) steps instead of - O(N*log(m)), where N=number of rows of the matrix, and m=number - of entries per row. Note that m is roughly constant, - irrespective of N, so the old algorithm became slower with - finer grids, while the new one is O(1) for each boundary degree - of freedom. +

    11. + Extended: DoFTools::make_sparsity_pattern () + now accepts a template parameter as sparsity pattern. This + allows to use this function for the usual + SparsityPattern, or for + BlockSparsityPattern arguments. +
      + (WB 2000/05/15)

      -

      - (John Burnell, WB 2000/05/17) +

    12. + New: DoFTools::extract_hanging_node_dofs () + identifies nodes that will be constrained by hanging node constraints. +
      + (WB 2000/05/12)

      -

    13. - Changed: enum - MeshSmoothing is moved into the - Triangulation class. +

    14. + New: DoFRenumbering::sort_selected_dofs_back () + sorts selected degrees of freedom to the end of the index + range.
      - (Ralf Hartmann 2000/05/18) + (WB 2000/05/12)

    15. - New: Triangulation::patch_level_1 - is a new mesh smoothing. A mesh of patch level 1 consists of - patches, i.e. they consists of cells that are all refined at - least once. + Change: the return value of + DoFHandler::max_couplings_between_dofs () + is bounded by DoFHandler::n_dofs(). +
      + (Ralf Hartmann 2000/05/11)

      -

      - Changed: As follows from the existence of this new smoothing, - maximum_smoothing will include this - smoothing. +

    16. + New: FEValuesBase::get_cell () + returns present cell. +
      + (Ralf Hartmann 2000/05/11)

      -

      - (Ralf Hartmann 2000/05/18) +

    17. + Fix: FESystem::reinit() generated + an exception if update_support_points + was set. +
      + (WB 2000/05/10)

    18. - Changed: FE_DGx::restriction is - not an interpolation any more but a local projection which is - more reasonable for DG elements. + New: DataOut::clear_data_vectors + allows to re-use an object without deleting the DoFHandler
      - (Ralf Hartmann 2000/05/22) + (GK 2000/04/05) +

      + +

    19. + New: class DoFPrintSolverStep prints + intermediate vectors of a solver as finite element functions using + DataOut. +
      + (GK 2000/04/05) +

      + +

    20. + New: DoFTools::extract_boundary_dofs + finds all degrees of freedom which are at the boundary and belong to + specified components. +
      + (WB 2000/04/17) +

      + +

    21. + New: DoFTools::compute_intergrid_constraints + allows to use different discretization grids for different + variables. +
      + (WB 2000/04/15) +

      + +

    22. + New: class GradientEstimator + estimates the norm of the gradient on each cell from finite + difference approximations. +
      + (WB 2000/04/14) +

      + +

    23. + New: IntergridMap::get_{source,destination}_grid + functions return the grids for which the map was created. +
      + (WB 2000/04/19)

    -- 2.39.5