--- /srv/reproducible-results/rbuild-debian/r-b-build.DujqFyR9/b1/deal.ii_9.7.1-1~exp1_amd64.changes
+++ /srv/reproducible-results/rbuild-debian/r-b-build.DujqFyR9/b2/deal.ii_9.7.1-1~exp1_amd64.changes
├── Files
│ @@ -1,5 +1,5 @@
│
│ 3a447173ad3968dd31aee15f99f7e5b0 1137585904 debug optional libdeal.ii-9.7.1-dbgsym_9.7.1-1~exp1_amd64.deb
│ 3322c630181b4d1d57c7023149e8a8cb 94246352 libs optional libdeal.ii-9.7.1_9.7.1-1~exp1_amd64.deb
│ e754043c07369556363f43d4bed2ca86 2290500 libdevel optional libdeal.ii-dev_9.7.1-1~exp1_amd64.deb
│ - 23e5fee4405e66cca97e6da22df43bc3 287748500 doc optional libdeal.ii-doc_9.7.1-1~exp1_all.deb
│ + f2d931031c795ba17ebe119078638b0d 287749580 doc optional libdeal.ii-doc_9.7.1-1~exp1_all.deb
├── libdeal.ii-doc_9.7.1-1~exp1_all.deb
│ ├── file list
│ │ @@ -1,3 +1,3 @@
│ │ -rw-r--r-- 0 0 0 4 2025-09-14 18:41:34.000000 debian-binary
│ │ --rw-r--r-- 0 0 0 271488 2025-09-14 18:41:34.000000 control.tar.xz
│ │ --rw-r--r-- 0 0 0 287476820 2025-09-14 18:41:34.000000 data.tar.xz
│ │ +-rw-r--r-- 0 0 0 271584 2025-09-14 18:41:34.000000 control.tar.xz
│ │ +-rw-r--r-- 0 0 0 287477804 2025-09-14 18:41:34.000000 data.tar.xz
│ ├── control.tar.xz
│ │ ├── control.tar
│ │ │ ├── ./control
│ │ │ │ @@ -1,13 +1,13 @@
│ │ │ │ Package: libdeal.ii-doc
│ │ │ │ Source: deal.ii
│ │ │ │ Version: 9.7.1-1~exp1
│ │ │ │ Architecture: all
│ │ │ │ Maintainer: Debian Science Maintainers Constructor. The supplied IndexSet defines for which indices this object will store constraints. In a calculation with a DoFHandler object based on parallel::distributed::Triangulation or parallel::shared::Triangulation, one should use the set of locally relevant DoFs (see GlossLocallyRelevantDof). The given IndexSet allows the AffineConstraints container to save memory by just not caring about degrees of freedom that are not of importance to the current processor. In contrast, in parallel computations, if you do not provide such an index set (here, or using the reinit() function that takes such an argument), the current object will allocate memory proportional to the total number of degrees of freedom (accumulated over all processes), which is clearly wasteful and not efficient – and should be considered a bug. Definition at line 2343 of file affine_constraints.h. clear() the AffineConstraints object and supply an IndexSet that describes for which degrees of freedom this object can store constraints. See the discussion in the documentation of the constructor of this class that takes a single index set as argument. This function copies the content of If, for example, the filter represents the range This function provides an easy way to create a AffineConstraints for certain vector components in a vector-valued problem from a full AffineConstraints, i.e. extracting a diagonal subblock from a larger AffineConstraints. The block is specified by the IndexSet argument. This is the base class for block versions of the sparsity pattern and dynamic sparsity pattern classes. It has not much functionality, but only administrates an array of sparsity pattern objects and delegates work to them. It has mostly the same interface as has the SparsityPattern, and DynamicSparsityPattern, and simply transforms calls to its member functions to calls to the respective member functions of the member sparsity patterns. The largest difference between the SparsityPattern and DynamicSparsityPattern classes and this class is that mostly, the matrices have different properties and you will want to work on the blocks making up the matrix rather than the whole matrix. You can access the different blocks using the Attention: this object is not automatically notified if the size of one of its subobjects' size is changed. After you initialize the sizes of the subobjects, you will therefore have to call the You will in general not want to use this class, but one of the derived classes. Definition at line 79 of file block_sparsity_pattern.h. For each locally owned cell, set the active finite element index to the corresponding value given in The vector Active FE indices will only be set for locally owned cells. Ghost and artificial cells will be ignored; no active FE index will be assigned to them. To exchange active FE indices on ghost cells, call distribute_dofs() afterwards. For each locally relevant cell, extract the active finite element index and fill the vector As we do not know the active FE index on artificial cells, they are set to the invalid value numbers::invalid_fe_index. For DoFHandler objects without hp-capabilities, the vector will consist of zeros, indicating that all cells use the same finite element. In hp-mode, the values may be different, though. The returned vector has as many entries as there are active cells. Return MPI communicator used by the underlying triangulation. Return the normal in a given quadrature point. The normal points in outwards direction as seen from the first cell of this interface. The same as above. The same as above. The same as above. Implementation of Arnold-Boffi-Falk (ABF) elements, conforming with the space Hdiv. These elements generate vector fields with normal components continuous between mesh cells. These elements are based on an article from Arnold, Boffi and Falk: Quadrilateral H(div) finite elements, SIAM J. Numer. Anal. Vol.42, No.6, pp.2429-2451 In this article, the authors demonstrate that the usual RT elements and also BDM and other proposed finite dimensional subspaces of H(div) do not work properly on arbitrary FE grids. I.e. the convergence rates deteriorate on these meshes. As a solution the authors propose the ABF elements, which are implemented in this class. This class is not implemented for the codimension one case ( The interpolation operators associated with the RT element are constructed such that interpolation and computing the divergence are commuting operations. We require this from interpolating arbitrary functions as well as the restriction matrices. It can be achieved by two interpolation schemes, the simplified one in FE_RaviartThomasNodal and the original one here: On edges or faces, the node values are the moments of the normal component of the interpolated function with respect to the traces of the RT polynomials. Since the normal trace of the RT space of degree k on an edge/face is the space Qk, the moments are taken with respect to this space. Higher order RT spaces have interior nodes. These are moments taken with respect to the gradient of functions in Qk on the cell (this space is the matching space for RTk in a mixed formulation). The Brezzi-Douglas-Marini element. The matching pressure space for FE_BDM of order k is the element FE_DGP of order k-1. The BDM element of order Additionally, for order greater or equal 2, we have additional p(p-1), the number of vector valued polynomials in Pp, interior degrees of freedom. These are the vector function values in the first p(p-1)/2 of the p2 Gauss points in the cell. Definition at line 87 of file fe_rt_bubbles.h. Ginkgo matrix data structure. First template parameter is for storing the array of the non-zeros of the matrix. The second is for the row pointers and the column indices. Definition at line 195 of file ginkgo_solver.h. Ginkgo matrix data structure. First template parameter is for storing the array of the non-zeros of the matrix. The second is for the row pointers and the column indices. Definition at line 195 of file ginkgo_solver.h. Ginkgo matrix data structure. First template parameter is for storing the array of the non-zeros of the matrix. The second is for the row pointers and the column indices. Definition at line 195 of file ginkgo_solver.h. Ginkgo matrix data structure. First template parameter is for storing the array of the non-zeros of the matrix. The second is for the row pointers and the column indices. Definition at line 195 of file ginkgo_solver.h. Ginkgo matrix data structure. First template parameter is for storing the array of the non-zeros of the matrix. The second is for the row pointers and the column indices. Definition at line 195 of file ginkgo_solver.h. Ginkgo matrix data structure. First template parameter is for storing the array of the non-zeros of the matrix. The second is for the row pointers and the column indices. Definition at line 195 of file ginkgo_solver.h. Ginkgo matrix data structure. First template parameter is for storing the array of the non-zeros of the matrix. The second is for the row pointers and the column indices. Definition at line 195 of file ginkgo_solver.h. Remove and return the last element of the last range. This function throws an exception if the IndexSet is empty. Definition at line 561 of file index_set.cc. Remove and return the first element of the first range. This function throws an exception if the IndexSet is empty. Definition at line 579 of file index_set.cc. Equivalent to the set of functions above, except that this one takes a quadrature collection for hp-finite element dof handlers. Equivalent to the set of functions above, except that this one takes a quadrature collection for hp-finite element dof handlers. Equivalent to the set of functions above, except that this one takes a quadrature collection for hp-finite element dof handlers. Definition at line 203 of file error_estimator_1d.cc. Equivalent to the set of functions above, except that this one takes a quadrature collection for hp-finite element dof handlers. Definition at line 570 of file error_estimator_1d.cc. Definition at line 345 of file trilinos_epetra_vector.h. Definition at line 304 of file read_write_vector.h. Definition at line 333 of file read_write_vector.h. Definition at line 363 of file read_write_vector.h. Definition at line 395 of file read_write_vector.h. Definition at line 427 of file read_write_vector.h. Definition at line 456 of file read_write_vector.h. Definition at line 513 of file trilinos_tpetra_vector.h. Definition at line 729 of file la_parallel_vector.h. Definition at line 788 of file la_parallel_vector.h.
│ │ │ │ inlineexplicit
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ AffineConstraints() [3/5]
│ │ │ │ @@ -879,15 +879,15 @@
│ │ │ │ const IndexSet &
│ │ │ │ locally_stored_constraints )
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ reinit() [3/3]
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ constraints_in with DoFs that are element of the IndexSet filter. Elements that are not present in the IndexSet are ignored. All DoFs will be transformed to local index space of the filter, both the constrained DoFs and the other DoFs these entries are constrained to. The local index space of the filter is a contiguous numbering of all (global) DoFs that are elements in the filter.[10,20), and the constraints object constraints_in includes the global indices {7,13,14}, the indices {3,4} are added to the calling constraints object (since 13 and 14 are elements in the filter and element 13 is the fourth element in the index, and 14 is the fifth).
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ add_constraint()
│ │ │ │
│ │ │ │ #include <deal.II/lac/block_sparsity_pattern.h>Detailed Description
│ │ │ │
│ │ │ │ class BlockSparsityPatternBase< SparsityPatternType >block(row,col) function.collect_sizes() function of this class! Note that, of course, all sub-matrices in a (block-)row have to have the same number of rows, and that all sub-matrices in a (block-)column have to have the same number of columns.
│ │ │ │ +
│ │ │ │
│ │ │ │
│ │ │ │ 
active_fe_indices.active_fe_indices needs to have as many entries as there are active cells. The FE indices must be in the order in which we iterate over active cells. Vector entries corresponding to active cells that are not locally owned are ignored.
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_active_fe_indices() [1/2]
│ │ │ │
│ │ │ │ active_fe_indices in the order in which we iterate over active cells. This vector is resized, if necessary.
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ set_future_fe_indices()
│ │ │ │
│ │ │ │ (
│ │ │ │ )
│ │ │ │ const
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ prepare_for_serialization_of_active_fe_indices()
│ │ │ │
│ │ │ │ q_point_index )
│ │ │ │ const
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │
│ │ │ │ update_normal_vectors flag must be an element of the list of UpdateFlags that you passed to the constructor of this object. See The interplay of UpdateFlags, Mapping, and FiniteElement in FEValues for more information. ◆ normal_vector()
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFEInterfaceViews_1_1Vector.html
│ │ │ │ @@ -572,15 +572,15 @@
│ │ │ │
│ │ │ │ )
│ │ │ │ const
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ jump_in_hessians()
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │ const
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ jump_in_third_derivatives()
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │ const
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_function_values()
│ │ │ │
│ │ │ │ #include <deal.II/fe/fe_abf.h>Detailed Description
│ │ │ │
│ │ │ │ class FE_ABF< dim >spacedim != dim).
│ │ │ │ +
│ │ │ │ Interpolation
│ │ │ │ Node values on edges/faces
│ │ │ │ Interior node values
│ │ │ │ Generalized support points
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFE__BDM.html
│ │ │ │ @@ -113,16 +113,16 @@
│ │ │ │ #include <deal.II/fe/fe_bdm.h>Detailed Description
│ │ │ │
│ │ │ │ class FE_BDM< dim >Degrees of freedom
│ │ │ │ -
│ │ │ │ -
│ │ │ │ +
│ │ │ │ +
│ │ │ │ p has p+1 degrees of freedom on each face. These are implemented as the function values in the p+1 Gauss points on each face.sp
│ │ │ │ 000023a0: 6163 6564 696d 2021 3d20 6469 6d3c 2f63 acedim != dim)..
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ -Left - \(2d,\,k=3\), right - \(3d,\,k=2\).
│ │ │ │ +
│ │ │ │
│ │ │ │ 
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ exec_type
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverBicgstab.html
│ │ │ │ @@ -664,15 +664,15 @@
│ │ │ │
│ │ │ │
│ │ │ │ privateinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ exec_type
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverCG.html
│ │ │ │ @@ -664,15 +664,15 @@
│ │ │ │
│ │ │ │
│ │ │ │ privateinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ exec_type
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverCGS.html
│ │ │ │ @@ -665,15 +665,15 @@
│ │ │ │
│ │ │ │
│ │ │ │ privateinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ exec_type
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverFCG.html
│ │ │ │ @@ -667,15 +667,15 @@
│ │ │ │
│ │ │ │
│ │ │ │ privateinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ exec_type
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverGMRES.html
│ │ │ │ @@ -664,15 +664,15 @@
│ │ │ │
│ │ │ │
│ │ │ │ privateinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ exec_type
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverIR.html
│ │ │ │ @@ -665,15 +665,15 @@
│ │ │ │
│ │ │ │
│ │ │ │ privateinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ exec_type
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classIndexSet.html
│ │ │ │ @@ -1300,15 +1300,15 @@
│ │ │ │ (
│ │ │ │ )
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ pop_front()
│ │ │ │ @@ -1321,15 +1321,15 @@
│ │ │ │ (
│ │ │ │ )
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_index_vector()
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classKellyErrorEstimator.html
│ │ │ │ @@ -835,15 +835,15 @@
│ │ │ │
│ │ │ │
│ │ │ │ static
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ estimate() [7/10]
│ │ │ │
│ │ │ │
│ │ │ │ static
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ estimate() [10/10]
│ │ │ │
│ │ │ │
│ │ │ │ static
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ estimate() [7/10]
│ │ │ │ @@ -1093,15 +1093,15 @@
│ │ │ │
│ │ │ │
│ │ │ │ static
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ estimate() [10/10]
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1EpetraWrappers_1_1Vector.html
│ │ │ │ @@ -746,15 +746,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ operator()() [1/2]
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1ReadWriteVector.html
│ │ │ │ @@ -1038,15 +1038,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import_elements() [2/8]
│ │ │ │ @@ -1126,15 +1126,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import_elements() [3/8]
│ │ │ │ @@ -1210,15 +1210,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import_elements() [4/8]
│ │ │ │ @@ -1295,15 +1295,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import_elements() [5/8]
│ │ │ │ @@ -1383,15 +1383,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import_elements() [6/8]
│ │ │ │ @@ -1467,15 +1467,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ size()
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1TpetraWrappers_1_1Vector.html
│ │ │ │ @@ -998,15 +998,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import_elements() [3/3]
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ operator()() [1/2]
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1distributed_1_1Vector.html
│ │ │ │ @@ -1568,15 +1568,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ operator*=()
│ │ │ │ @@ -1737,15 +1737,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ operator*()
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMapping.html
│ │ │ │ @@ -147,15 +147,15 @@
│ │ │ │ \sum_{q}
│ │ │ │ \hat u(\hat{\mathbf x}_q)
│ │ │ │ \underbrace{\left|\text{det}J(\hat{\mathbf x}_q)\right| w_q}_{=:
│ │ │ │ \text{JxW}_q}.
│ │ │ │ \]
│ │ │ │
Here, the weights \(\text{JxW}_q\) of each quadrature point (where JxW mnemonically stands for Jacobian times Quadrature Weights) take the role of the \(dx\) in the original integral. Consequently, they appear in all code that computes integrals approximated by quadrature, and are accessed by FEValues::JxW().
│ │ │ │ -The transformation of vector fields or differential forms (gradients of scalar functions) \(\mathbf v\), and gradients of vector fields \(\mathbf T\) follows the general form
│ │ │ ││ │ │ │ \[ │ │ │ │ \mathbf v(\mathbf x) = \mathbf A(\hat{\mathbf x}) │ │ │ │ \hat{\mathbf v}(\hat{\mathbf x}), │ │ │ │ \qquad │ │ │ │ @@ -1720,15 +1720,15 @@ │ │ │ │ \frac{1}{\text{det}\;J(\hat{\mathbf x})} │ │ │ │ J(\hat{\mathbf x}) \hat{\mathbf T}(\hat{\mathbf x}) │ │ │ │ J(\hat{\mathbf x})^{-1}. │ │ │ │ \] │ │ │ │
│ │ │ │ │ │ │ │ │ │ │ │ -| [in] | input | An array (or part of an array) of input objects that should be mapped. |
| [in] | kind | The kind of mapping to be applied. |
| [in] | internal | A pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to. |
| [out] | output | An array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.) |
| [in] | input | An array (or part of an array) of input objects that should be mapped. |
| [in] | kind | The kind of mapping to be applied. |
| [in] | internal | A pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to. |
| [out] | output | An array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.) |
| [in] | input | An array (or part of an array) of input objects that should be mapped. |
| [in] | kind | The kind of mapping to be applied. |
| [in] | internal | A pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to. |
| [out] | output | An array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.) |
| [in] | input | An array (or part of an array) of input objects that should be mapped. |
| [in] | kind | The kind of mapping to be applied. |
| [in] | internal | A pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to. |
| [out] | output | An array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.) |
| [in] | input | An array (or part of an array) of input objects that should be mapped. |
| [in] | kind | The kind of mapping to be applied. |
| [in] | internal | A pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to. |
| [out] | output | An array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.) |
| [in] | input | An array (or part of an array) of input objects that should be mapped. |
| [in] | kind | The kind of mapping to be applied. |
| [in] | internal | A pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to. |
| [out] | output | An array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.) |
| [in] | input | An array (or part of an array) of input objects that should be mapped. |
| [in] | kind | The kind of mapping to be applied. |
| [in] | internal | A pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to. |
| [out] | output | An array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.) |
| [in] | input | An array (or part of an array) of input objects that should be mapped. |
| [in] | kind | The kind of mapping to be applied. |
| [in] | internal | A pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to. |
| [out] | output | An array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.) |
| [in] | input | An array (or part of an array) of input objects that should be mapped. |
| [in] | kind | The kind of mapping to be applied. |
| [in] | internal | A pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to. |
| [out] | output | An array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.) |
| [in] | input | An array (or part of an array) of input objects that should be mapped. |
| [in] | kind | The kind of mapping to be applied. |
| [in] | internal | A pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to. |
| [out] | output | An array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.) |
| [in] | input | An array (or part of an array) of input objects that should be mapped. |
| [in] | kind | The kind of mapping to be applied. |
| [in] | internal | A pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to. |
| [out] | output | An array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.) |
| [in] | input | An array (or part of an array) of input objects that should be mapped. |
| [in] | kind | The kind of mapping to be applied. |
| [in] | internal | A pointer to an object of type Mapping::InternalDataBase that contains information previously stored by the mapping. The object pointed to was created by the get_data(), get_face_data(), or get_subface_data() function, and will have been updated as part of a call to fill_fe_values(), fill_fe_face_values(), or fill_fe_subface_values() for the current cell, before calling the current function. In other words, this object also represents with respect to which cell the transformation should be applied to. |
| [out] | output | An array (or part of an array) into which the transformed objects should be placed. (Note that the array view is const, but the tensors it points to are not.) |
#include <deal.II/lac/matrix_block.h>
A wrapper around a matrix object, storing the coordinates in a block matrix as well.
│ │ │ │This class is an alternative to BlockMatrixBase, if you only want to generate a single block of the system, not the whole system. Using the add() functions of this class, it is possible to use the standard assembling functions used for block matrices, but only enter in one of the blocks and still avoiding the index computations involved. The reason for this class is, that we may need a different number of matrices for different blocks in a block system. For example, a preconditioner for the Oseen system can be built as a block system, where the pressure block is of the form M-1FA-1 with M the pressure mass matrix, A the pressure Laplacian and F the advection diffusion operator applied to the pressure space. Since only a single matrix is needed for the other blocks, using BlockSparseMatrix or similar would be a waste of memory.
│ │ │ │While the add() functions make a MatrixBlock appear like a block matrix for assembling, the functions vmult(), Tvmult(), vmult_add(), and Tvmult_add() make it behave like a MatrixType, when it comes to applying it to a vector. This behavior allows us to store MatrixBlock objects in vectors, for instance in MGLevelObject without extracting the matrix first.
│ │ │ │Definition at line 92 of file matrix_block.h.
│ │ │ │
Add all elements in a FullMatrix into sparse matrix locations given by indices. This function assumes a quadratic sparse matrix and a quadratic full_matrix. The global locations are translated into locations in this block and ExcBlockIndexMismatch is thrown, if the global index does not point into the block referred to by row and column.
elide_zero_values is currently ignored.elide_zero_values is currently ignored.The optional parameter elide_zero_values can be used to specify whether zero values should be added anyway or these should be filtered away and only non-zero data is added. The default value is true, i.e., zero values won't be added into the matrix.
Definition at line 737 of file matrix_block.h.
│ │ │ │ │ │ │ │Add all elements in a FullMatrix into global locations given by row_indices and col_indices, respectively. The global locations are translated into locations in this block and ExcBlockIndexMismatch is thrown, if the global index does not point into the block referred to by row and column.
elide_zero_values is currently ignored.elide_zero_values is currently ignored.The optional parameter elide_zero_values can be used to specify whether zero values should be added anyway or these should be filtered away and only non-zero data is added. The default value is true, i.e., zero values won't be added into the matrix.
Definition at line 675 of file matrix_block.h.
│ │ │ │ │ │ │ │Set several elements in the specified row of the matrix with column indices as given by col_indices to the respective value. This is the function doing the actual work for the ones adding full matrices. The global locations row_index and col_indices are translated into locations in this block and ExcBlockIndexMismatch is thrown, if the global index does not point into the block referred to by row and column.
elide_zero_values is currently ignored.elide_zero_values is currently ignored.The optional parameter elide_zero_values can be used to specify whether zero values should be added anyway or these should be filtered away and only non-zero data is added. The default value is true, i.e., zero values won't be added into the matrix.
Definition at line 760 of file matrix_block.h.
│ │ │ │ │ │ │ │#include <deal.II/meshworker/simple.h>
Assemble local matrices into level matrices without using block structure.
│ │ │ │ -│ │ │ │ Public Member Functions | |
| MGMatrixSimple (double threshold=1.e-12) | |
│ │ │ │ Public Member Functions | |
| void | initialize (const BlockInfo *block_info, AnyData &residuals) |
| │ │ │ │ inline | │ │ │ │ │ │ │ │|
Delete the object pointed to and set the pointer to nullptr. Note that unlike what the documentation of the class describes, this function actually deletes the object pointed to. That is, this function assumes a ObserverPointer's ownership of the object pointed to.
│ │ │ │ -Definition at line 435 of file observer_pointer.h.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 368 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 439 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 341 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 466 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 547 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 314 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 404 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 575 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 610 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 264 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 520 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 493 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 650 of file petsc_solver.cc.
│ │ │ │ │ │ │ │| std::function<void(const real_type t, VectorType &y)> PETScWrappers::TimeStepper< VectorType, PMatrixType, AMatrixType >::distribute | │ │ │ │
update_constrained_components, but is deprecated. Use update_constrained_components instead. update_constrained_components, but is deprecated. Use update_constrained_components instead. Definition at line 621 of file petsc_ts.h.
│ │ │ │ │ │ │ │| std::function<void(const real_type t, const unsigned int step, const VectorType &y, bool &resize)> PETScWrappers::TimeStepper< VectorType, PMatrixType, AMatrixType >::decide_for_coarsening_and_refinement | │ │ │ │
decide_and_prepare_for_remeshing except that it returns the decision whether or not to stop operations via the last reference argument of the function object instead of a plain return value. This callback is deprecated. Use decide_and_prepare_for_remeshing instead. decide_and_prepare_for_remeshing except that it returns the decision whether or not to stop operations via the last reference argument of the function object instead of a plain return value. This callback is deprecated. Use decide_and_prepare_for_remeshing instead. Definition at line 656 of file petsc_ts.h.
│ │ │ │ │ │ │ │| std::function<void(const std::vector<VectorType> &all_in, std::vector<VectorType> &all_out)> PETScWrappers::TimeStepper< VectorType, PMatrixType, AMatrixType >::interpolate | │ │ │ │
transfer_solution_vectors_to_new_mesh, but is deprecated. Use transfer_solution_vectors_to_new_mesh instead. transfer_solution_vectors_to_new_mesh, but is deprecated. Use transfer_solution_vectors_to_new_mesh instead. Definition at line 688 of file petsc_ts.h.
│ │ │ │ │ │ │ │The elements of this enum are used to inform functions how a specific cell is going to change. This is used in the course of transferring data from one mesh to a refined or coarsened version of the mesh, for example. Note that this may me different than the refine_flag() and coarsen_flag() set on a cell, for example in parallel calculations, because of refinement constraints that an individual machine does not see.
Definition at line 2248 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2255 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2262 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2269 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │| const Point<spacedim> PolarManifold< dim, spacedim >::center | │ │ │ │
The center of the spherical coordinate system.
│ │ │ │ -Definition at line 153 of file manifold_lib.h.
│ │ │ │ │ │ │ │Compute the quadrature points on the cell if the given quadrature formula is used on face face_no. For further details, see the general doc for this class.
Compute the cell quadrature formula corresponding to using quadrature on face face_no. For further details, see the general doc for this class.
Definition at line 1104 of file qprojector.cc.
│ │ │ │ │ │ │ │Compute the cell quadrature formula corresponding to using quadrature on face face_no taking into account the orientation of the face. For further details, see the general doc for this class.
Definition at line 319 of file qprojector.cc.
│ │ │ │ │ │ │ │Compute the quadrature points on the cell if the given quadrature formula is used on face face_no, subface number subface_no corresponding to RefineCase::Type ref_case. The last argument is only used in 3d.
Compute the cell quadrature formula corresponding to using quadrature on subface subface_no of face face_no with RefinementCase<dim-1> ref_case. The last argument is only used in 3d.
Definition at line 1121 of file qprojector.cc.
│ │ │ │ │ │ │ │Compute the cell quadrature formula corresponding to using quadrature on subface subface_no of face face_no with SubfaceCase<dim> ref_case. The last argument is only used in 3d.
Definition at line 442 of file qprojector.cc.
│ │ │ │ │ │ │ │Static function to generate an offset object for a given face of a cell with the given face orientation, flip and rotation. This function of course is only allowed if dim>=2, and the face orientation, flip and rotation are ignored if the space dimension equals 2.
The last argument denotes the number of quadrature points the lower-dimensional face quadrature formula (the one that has been projected onto the faces) has.
│ │ │ │ -Definition at line 874 of file qprojector.cc.
│ │ │ │ │ │ │ │Compute an offset object for the given face number and orientation, taking into account the possibility of different quadrature rules being used on each face.
│ │ │ │ -Definition at line 914 of file qprojector.cc.
│ │ │ │ │ │ │ │Static function to generate an offset object for a given subface of a cell with the given face orientation, flip and rotation. This function of course is only allowed if dim>=2, and the face orientation, flip and rotation are ignored if the space dimension equals 2.
The last but one argument denotes the number of quadrature points the lower-dimensional face quadrature formula (the one that has been projected onto the faces) has.
│ │ │ │Through the last argument anisotropic refinement can be respected.
│ │ │ │ -Definition at line 961 of file qprojector.cc.
│ │ │ │ │ │ │ │| std::function<VectorType &()> SUNDIALS::KINSOL< VectorType >::get_solution_scaling | │ │ │ │
A function object that users may supply and that is intended to return a vector whose components are the weights used by KINSOL to compute the vector norm of the solution. The implementation of this function is optional, and it is used only if implemented.
│ │ │ │ -The intent for this scaling factor is for problems in which the different components of a solution have vastly different numerical magnitudes – typically because they have different physical units and represent different things. For example, if one were to solve a nonlinear Stokes problem, the solution vector has components that correspond to velocities and other components that correspond to pressures. These have different physical units and depending on which units one chooses, they may have roughly comparable numerical sizes or maybe they don't. To give just one example, in simulations of flow in the Earth's interior, one has velocities on the order of maybe ten centimeters per year, and pressures up to around 100 GPa. If one expresses this in SI units, this corresponds to velocities of around \(0.000,000,003=3 \times 10^{-9}\) m/s, and pressures around \(10^9 \text{kg}/\text{m}/\text{s}^2\), i.e., vastly different. In such cases, computing the \(l_2\) norm of a solution-type vector (e.g., the difference between the previous and the current solution) makes no sense because the norm will either be dominated by the velocity components or the pressure components. The scaling vector this function returns is intended to provide each component of the solution with a scaling factor that is generally chosen as the inverse of a "typical velocity" or "typical pressure" so that upon multiplication of a vector component by the corresponding scaling vector component, one obtains a number that is of order of magnitude of one (i.e., a reasonably small multiple of one times the typical velocity/pressure). The KINSOL manual states this as follows: "The user should supply values \_form#2705, │ │ │ │ -which are diagonal elements of the scaling matrix such that \_form#2723 has │ │ │ │ -all components roughly the same magnitude when \_form#321 is close to a │ │ │ │ +
The intent for this scaling factor is for problems in which the different components of a solution have vastly different numerical magnitudes – typically because they have different physical units and represent different things. For example, if one were to solve a nonlinear Stokes problem, the solution vector has components that correspond to velocities and other components that correspond to pressures. These have different physical units and depending on which units one chooses, they may have roughly comparable numerical sizes or maybe they don't. To give just one example, in simulations of flow in the Earth's interior, one has velocities on the order of maybe ten centimeters per year, and pressures up to around 100 GPa. If one expresses this in SI units, this corresponds to velocities of around \(0.000,000,003=3 \times 10^{-9}\) m/s, and pressures around \(10^9 \text{kg}/\text{m}/\text{s}^2\), i.e., vastly different. In such cases, computing the \(l_2\) norm of a solution-type vector (e.g., the difference between the previous and the current solution) makes no sense because the norm will either be dominated by the velocity components or the pressure components. The scaling vector this function returns is intended to provide each component of the solution with a scaling factor that is generally chosen as the inverse of a "typical velocity" or "typical pressure" so that upon multiplication of a vector component by the corresponding scaling vector component, one obtains a number that is of order of magnitude of one (i.e., a reasonably small multiple of one times the typical velocity/pressure). The KINSOL manual states this as follows: "The user should supply values \_form#2653, │ │ │ │ +which are diagonal elements of the scaling matrix such that \_form#2692 has │ │ │ │ +all components roughly the same magnitude when \_form#211 is close to a │ │ │ │ solution".
│ │ │ │If no function is provided to a KINSOL object, then this is interpreted as implicitly saying that all of these scaling factors should be considered as one.
│ │ │ │| using Triangulation< dim, spacedim >::CellStatus = ::CellStatus | │ │ │ │
The elements of this enum are used to inform functions how a specific cell is going to change. This is used in the course of transferring data from one mesh to a refined or coarsened version of the mesh, for example. Note that this may me different than the refine_flag() and coarsen_flag() set on a cell, for example in parallel calculations, because of refinement constraints that an individual machine does not see.
Definition at line 2248 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2255 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2262 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2269 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 767 of file trilinos_vector.h.
│ │ │ │ │ │ │ │Definition at line 61 of file mpi_remote_point_evaluation.cc.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │The elements of this enum are used to inform functions how a specific cell is going to change. This is used in the course of transferring data from one mesh to a refined or coarsened version of the mesh, for example. Note that this may me different than the refine_flag() and coarsen_flag() set on a cell, for example in parallel calculations, because of refinement constraints that an individual machine does not see.
Definition at line 2248 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2255 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2262 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2269 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │The elements of this enum are used to inform functions how a specific cell is going to change. This is used in the course of transferring data from one mesh to a refined or coarsened version of the mesh, for example. Note that this may me different than the refine_flag() and coarsen_flag() set on a cell, for example in parallel calculations, because of refinement constraints that an individual machine does not see.
Definition at line 2248 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2255 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2262 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2269 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │The elements of this enum are used to inform functions how a specific cell is going to change. This is used in the course of transferring data from one mesh to a refined or coarsened version of the mesh, for example. Note that this may me different than the refine_flag() and coarsen_flag() set on a cell, for example in parallel calculations, because of refinement constraints that an individual machine does not see.
Definition at line 2248 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2255 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2262 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2269 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │The elements of this enum are used to inform functions how a specific cell is going to change. This is used in the course of transferring data from one mesh to a refined or coarsened version of the mesh, for example. Note that this may me different than the refine_flag() and coarsen_flag() set on a cell, for example in parallel calculations, because of refinement constraints that an individual machine does not see.
Definition at line 2248 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2255 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2262 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2269 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │The elements of this enum are used to inform functions how a specific cell is going to change. This is used in the course of transferring data from one mesh to a refined or coarsened version of the mesh, for example. Note that this may me different than the refine_flag() and coarsen_flag() set on a cell, for example in parallel calculations, because of refinement constraints that an individual machine does not see.
Definition at line 2248 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2255 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2262 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2269 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │The elements of this enum are used to inform functions how a specific cell is going to change. This is used in the course of transferring data from one mesh to a refined or coarsened version of the mesh, for example. Note that this may me different than the refine_flag() and coarsen_flag() set on a cell, for example in parallel calculations, because of refinement constraints that an individual machine does not see.
Definition at line 2248 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2255 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2262 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Definition at line 2269 of file tria.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │std::map instead. std::map instead. std::map instead. std::map instead. std_cxx20::type_identity instead. decide_and_prepare_for_remeshing except that it returns the decision whether or not to stop operations via the last reference argument of the function object instead of a plain return value. This callback is deprecated. Use decide_and_prepare_for_remeshing instead. decide_and_prepare_for_remeshing except that it returns the decision whether or not to stop operations via the last reference argument of the function object instead of a plain return value. This callback is deprecated. Use decide_and_prepare_for_remeshing instead. update_constrained_components, but is deprecated. Use update_constrained_components instead. update_constrained_components, but is deprecated. Use update_constrained_components instead. transfer_solution_vectors_to_new_mesh, but is deprecated. Use transfer_solution_vectors_to_new_mesh instead. transfer_solution_vectors_to_new_mesh, but is deprecated. Use transfer_solution_vectors_to_new_mesh instead. Simplified interface for loop() if specialized for integration, using the virtual functions in LocalIntegrator.
│ │ │ │ -Same as above.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 1556 of file dof_tools.cc.
│ │ │ │ │ │ │ │Same as above.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 1582 of file dof_tools.cc.
│ │ │ │ │ │ │ │Extract the set of global DoF indices that are active on the current DoFHandler. For regular DoFHandlers, these are all DoF indices, but for DoFHandler objects built on parallel::distributed::Triangulation this set is a superset of DoFHandler::locally_owned_dofs() and contains all DoF indices that live on all locally owned cells (including on the interface to ghost cells). However, it does not contain the DoF indices that are exclusively defined on ghost or artificial cells (see the glossary).
│ │ │ │The degrees of freedom identified by this function equal those obtained from the dof_indices_with_subdomain_association() function when called with the locally owned subdomain id.
│ │ │ │ -Definition at line 1107 of file dof_tools.cc.
│ │ │ │ │ │ │ │Same function as above but for a certain (multigrid-)level. This function returns all DoF indices that live on all locally owned cells (including on the interface to ghost cells) on the given level.
│ │ │ │ -Definition at line 1154 of file dof_tools.cc.
│ │ │ │ │ │ │ │Extract the set of global DoF indices that are active on the current DoFHandler. For regular DoFHandlers, these are all DoF indices, but for DoFHandler objects built on parallel::distributed::Triangulation this set is the union of DoFHandler::locally_owned_dofs() and the DoF indices on all ghost cells. In essence, it is the DoF indices on all cells that are not artificial (see the glossary).
│ │ │ │ -Definition at line 1204 of file dof_tools.cc.
│ │ │ │ │ │ │ │Same as extract_locally_relevant_dofs() but for multigrid DoFs for the given level.
Definition at line 1260 of file dof_tools.cc.
│ │ │ │ │ │ │ │For each active cell of a DoFHandler, extract the active finite element index and fill the vector given as second argument. This vector is assumed to have as many entries as there are active cells.
│ │ │ │For DoFHandler objects without hp-capabilities given as first argument, the returned vector will consist of only zeros, indicating that all cells use the same finite element. In hp-mode, the values may be different, though.
│ │ │ │As we do not know the active FE index on artificial cells, we set them to the invalid value numbers::invalid_fe_index.
│ │ │ │ -Definition at line 1679 of file dof_tools.cc.
│ │ │ │ │ │ │ │A version of the function of same name that returns the map via its third argument. This function is deprecated.
std::map instead. A version of the function of same name that returns the map via its third argument. This function is deprecated.
std::map instead. Definition at line 2617 of file dof_tools.cc.
│ │ │ │ │ │ │ │A version of the function of same name that returns the map via its third argument. This function is deprecated.
std::map instead. A version of the function of same name that returns the map via its third argument. This function is deprecated.
std::map instead. Definition at line 2638 of file dof_tools.cc.
│ │ │ │ │ │ │ │Given a triangulation and a list of cells whose children have become distorted as a result of mesh refinement, try to fix these cells up by moving the center node around.
│ │ │ │The function returns a list of cells with distorted children that couldn't be fixed up for whatever reason. The returned list is therefore a subset of the input argument.
│ │ │ │For a definition of the concept of distorted cells, see the glossary entry. The first argument passed to the current function is typically the exception thrown by the Triangulation::execute_coarsening_and_refinement function.
│ │ │ │ -Definition at line 2754 of file grid_tools.cc.
│ │ │ │ │ │ │ │Definition at line 1135 of file sparsity_tools.cc.
│ │ │ │ │ │ │ │| using parallel::distributed::SolutionTransfer = typedef ::SolutionTransfer<dim, VectorType, spacedim> | │ │ │ │
Definition at line 33 of file solution_transfer.h.
│ │ │ │ │ │ │ │| using types::geometric_entity_type = typedef std::uint8_t | │ │ │ │
The type used to denote geometric entity types.
│ │ │ │ -| using SmartPointer = ObserverPointer<T, P> | │ │ │ │
A type alias for the ObserverPointer class that makes sure the previous name of the class, SmartPointer, continues to be available.
│ │ │ │ -Definition at line 285 of file observer_pointer.h.
│ │ │ │ │ │ │ │The same trick with the mixed system does not work here, because we would end up with both Dirichlet and Neumann boundary conditions for \(u\), but none for \(v\).
│ │ │ │The solution to this conundrum arrived with the Discontinuous Galerkin method wave in the 1990s and early 2000s: In much the same way as one can use discontinuous shape functions for the Laplace equation by penalizing the size of the discontinuity to obtain a scheme for an equation that has one derivative on each shape function, we can use a scheme that uses continuous (but not \(C^1\) continuous) shape functions and penalize the jump in the derivative to obtain a scheme for an equation that has two derivatives on each shape function. In analogy to the Interior Penalty (IP) method for the Laplace equation, this scheme for the biharmonic equation is typically called the \(C^0\) IP (or C0IP) method, since it uses \(C^0\) (continuous but not continuously differentiable) shape functions with an interior penalty formulation.
│ │ │ │It is worth noting that the C0IP method is not the only one that has been developed for the biharmonic equation. step-82 shows an alternative method.
│ │ │ │We base this program on the \(C^0\) IP method presented by Susanne Brenner and Li-Yeng Sung in the paper " \_form#1734 Interior Penalty Method │ │ │ │ +
We base this program on the \(C^0\) IP method presented by Susanne Brenner and Li-Yeng Sung in the paper " \_form#1711 Interior Penalty Method │ │ │ │ for Linear Fourth Order Boundary Value Problems on polygonal │ │ │ │ domains" [Brenner2005] where the method is derived for the biharmonic equation with "clamped" boundary conditions.
│ │ │ │As mentioned, this method relies on the use of \(C^0\) Lagrange finite elements where the \(C^1\) continuity requirement is relaxed and has been replaced with interior penalty techniques. To derive this method, we consider a \(C^0\) shape function \(v_h\) which vanishes on \(\partial\Omega\). We introduce notation \( \mathbb{F} \) as the set of all faces of \(\mathbb{T}\), \( \mathbb{F}^b \) as the set of boundary faces, and \( \mathbb{F}^i \) as the set of interior faces for use further down below. Since the higher order derivatives of \(v_h\) have two values on each interface \(e\in \mathbb{F}\) (shared by the two cells \(K_{+},K_{-} \in \mathbb{T}\)), we cope with this discontinuity by defining the following single-valued functions on \(e\):
│ │ │ │ \begin{align*} │ │ │ │ \jump{\frac{\partial^k v_h}{\partial \mathbf n^k}} │ │ │ │ &= │ │ │ │ \frac{\partial^k v_h|_{K_+}}{\partial \mathbf n^k} \bigg |_e │ │ │ │ ├── html2text {} │ │ │ │ │ @@ -181,15 +181,15 @@ │ │ │ │ │ (C^0\) IP (or C0IP) method, since it uses \(C^0\) (continuous but not │ │ │ │ │ continuously differentiable) shape functions with an interior penalty │ │ │ │ │ formulation. │ │ │ │ │ It is worth noting that the C0IP method is not the only one that has been │ │ │ │ │ developed for the biharmonic equation. step-82 shows an alternative method. │ │ │ │ │ **** Derivation of the C0IP method **** │ │ │ │ │ We base this program on the \(C^0\) IP method presented by Susanne Brenner and │ │ │ │ │ -Li-Yeng Sung in the paper " \_form#1734 Interior Penalty Method for Linear │ │ │ │ │ +Li-Yeng Sung in the paper " \_form#1711 Interior Penalty Method for Linear │ │ │ │ │ Fourth Order Boundary Value Problems on polygonal domains" [Brenner2005] where │ │ │ │ │ the method is derived for the biharmonic equation with "clamped" boundary │ │ │ │ │ conditions. │ │ │ │ │ As mentioned, this method relies on the use of \(C^0\) Lagrange finite elements │ │ │ │ │ where the \(C^1\) continuity requirement is relaxed and has been replaced with │ │ │ │ │ interior penalty techniques. To derive this method, we consider a \(C^0\) shape │ │ │ │ │ function \(v_h\) which vanishes on \(\partial\Omega\). We introduce notation \ │ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/step_58.html │ │ │ │ @@ -568,16 +568,16 @@ │ │ │ │ \left(\psi^{(n,2)}+\psi^{(n,1)}\right)\right] │ │ │ │ + │ │ │ │ V \left[\frac 12 \left(\psi^{(n,2)}+\psi^{(n,1)}\right)\right] = 0. │ │ │ │ \end{align*} │ │ │ │
│ │ │ │Here, the "previous" solution \(\psi^{(n,1)}\) (or the "initial │ │ │ │ condition" for this part of the time step) is the output of the first phase rotation half-step; the output of the current step will be denoted by \(\psi^{(n,2)}\). \(k_{n+1}=t_{n+1}-t_n\) is the length of the time step. (One could argue whether \(\psi^{(n,1)}\) and \(\psi^{(n,1)}\) live at time step \(n\) or \(n+1\) and what their upper indices should be. This is a philosophical discussion without practical impact, and one might think of \(\psi^{(n,1)}\) as something like \(\psi^{(n+\tfrac 13)}\), and \(\psi^{(n,2)}\) as \(\psi^{(n+\tfrac 23)}\) if that helps clarify things – though, again \(n+\frac 13\) is not to be understood as "one third time step after │ │ │ │ - \_form#397" but more like "we've already done one third of the work necessary │ │ │ │ -for time step \_form#3325".)
│ │ │ │ + \_form#392" but more like "we've already done one third of the work necessary │ │ │ │ +for time step \_form#4243".) │ │ │ │If we multiply the whole equation with \(k_{n+1}\) and sort terms with the unknown \(\psi^{(n+1,2)}\) to the left and those with the known \(\psi^{(n,2)}\) to the right, then we obtain the following (spatial) partial differential equation that needs to be solved in each time step:
│ │ │ │ \begin{align*} │ │ │ │ -i\psi^{(n,2)} │ │ │ │ - │ │ │ │ \frac 14 k_{n+1} \Delta \psi^{(n,2)} │ │ │ │ + │ │ │ │ \frac 12 k_{n+1} V \psi^{(n,2)} │ │ │ │ ├── html2text {} │ │ │ │ │ @@ -378,16 +378,16 @@ │ │ │ │ │ step; the output of the current step will be denoted by \(\psi^{(n,2)}\). \(k_ │ │ │ │ │ {n+1}=t_{n+1}-t_n\) is the length of the time step. (One could argue whether \ │ │ │ │ │ (\psi^{(n,1)}\) and \(\psi^{(n,1)}\) live at time step \(n\) or \(n+1\) and │ │ │ │ │ what their upper indices should be. This is a philosophical discussion without │ │ │ │ │ practical impact, and one might think of \(\psi^{(n,1)}\) as something like \ │ │ │ │ │ (\psi^{(n+\tfrac 13)}\), and \(\psi^{(n,2)}\) as \(\psi^{(n+\tfrac 23)}\) if │ │ │ │ │ that helps clarify things – though, again \(n+\frac 13\) is not to be │ │ │ │ │ -understood as "one third time step after \_form#397" but more like "we've │ │ │ │ │ -already done one third of the work necessary for time step \_form#3325".) │ │ │ │ │ +understood as "one third time step after \_form#392" but more like "we've │ │ │ │ │ +already done one third of the work necessary for time step \_form#4243".) │ │ │ │ │ If we multiply the whole equation with \(k_{n+1}\) and sort terms with the │ │ │ │ │ unknown \(\psi^{(n+1,2)}\) to the left and those with the known \(\psi^{ │ │ │ │ │ (n,2)}\) to the right, then we obtain the following (spatial) partial │ │ │ │ │ differential equation that needs to be solved in each time step: │ │ │ │ │ \begin{align*} -i\psi^{(n,2)} - \frac 14 k_{n+1} \Delta \psi^{(n,2)} + \frac 12 │ │ │ │ │ k_{n+1} V \psi^{(n,2)} = -i\psi^{(n,1)} + \frac 14 k_{n+1} \Delta \psi^{(n,1)} │ │ │ │ │ - \frac 12 k_{n+1} V \psi^{(n,1)}. \end{align*} │ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/structSolverGMRES_1_1AdditionalData.html │ │ │ │ @@ -209,15 +209,15 @@ │ │ │ │
| unsigned int SolverGMRES< VectorType >::AdditionalData::max_n_tmp_vectors | │ │ │ │
Maximum number of temporary vectors. Together with max_basis_size, this parameter controls the size of the Arnoldi basis, which corresponds to max_n_tmp_vectors-2 as used in previous versions of the deal.II library. SolverGMRES assumes that there are at least three temporary vectors, so this value must be greater than or equal to three. If both this variable and max_basis_size are set to a non-zero value, the choice in max_basis_size takes precedence.
│ │ │ │ -Definition at line 454 of file solver_gmres.h.
│ │ │ │ │ │ │ │mapping argument should be replaced by a hp::MappingCollection in case of a DoFHandler with hp-capabilities. Restriction matrices are missing.
│ │ │ │ -The 3d version exhibits some numerical instabilities, in particular for higher order
│ │ │ │ +Restriction matrices are missing.
│ │ │ │ +The 3d version exhibits some numerical instabilities, in particular for higher order
│ │ │ │elide_zero_values is currently ignored. elide_zero_values is currently ignored. elide_zero_values is currently ignored. elide_zero_values is currently ignored. elide_zero_values is currently ignored. elide_zero_values is currently ignored.