--- /srv/reproducible-results/rbuild-debian/r-b-build.WkJjGeW5/b1/deal.ii_9.5.1-3_amd64.changes
+++ /srv/reproducible-results/rbuild-debian/r-b-build.WkJjGeW5/b2/deal.ii_9.5.1-3_amd64.changes
├── Files
│ @@ -1,5 +1,5 @@
│
│ a25c67a78c22273cae13f5d80290ac1f 978174164 debug optional libdeal.ii-9.5.1-dbgsym_9.5.1-3_amd64.deb
│ 02c443b0ea183671636cab61bcaef8f6 86707720 libs optional libdeal.ii-9.5.1_9.5.1-3_amd64.deb
│ d2fc4ccf6d33ddc74b55778655e26de2 2142620 libdevel optional libdeal.ii-dev_9.5.1-3_amd64.deb
│ - 0c80572340b4f3e17968bf6ba9692d17 257673072 doc optional libdeal.ii-doc_9.5.1-3_all.deb
│ + 085f84744b4a814530b50ce0fdd08a00 257673512 doc optional libdeal.ii-doc_9.5.1-3_all.deb
├── libdeal.ii-doc_9.5.1-3_all.deb
│ ├── file list
│ │ @@ -1,3 +1,3 @@
│ │ -rw-r--r-- 0 0 0 4 2024-05-25 07:56:38.000000 debian-binary
│ │ --rw-r--r-- 0 0 0 261836 2024-05-25 07:56:38.000000 control.tar.xz
│ │ --rw-r--r-- 0 0 0 257411044 2024-05-25 07:56:38.000000 data.tar.xz
│ │ +-rw-r--r-- 0 0 0 261928 2024-05-25 07:56:38.000000 control.tar.xz
│ │ +-rw-r--r-- 0 0 0 257411392 2024-05-25 07:56:38.000000 data.tar.xz
│ ├── control.tar.xz
│ │ ├── control.tar
│ │ │ ├── ./control
│ │ │ │ @@ -1,13 +1,13 @@
│ │ │ │ Package: libdeal.ii-doc
│ │ │ │ Source: deal.ii
│ │ │ │ Version: 9.5.1-3
│ │ │ │ Architecture: all
│ │ │ │ Maintainer: Debian Science Maintainers In this example, Definition at line 95 of file block_info.h. 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 80 of file block_sparsity_pattern.h. The second approach outlined here is more general than the first, and will work equally well for both taped and tapeless auto-differentiable numbers. Definition at line 169 of file ad_helpers.h. The type in which we store the active FE index. Definition at line 537 of file dof_handler.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. Invalid index of the finite element to be used on a given cell. Definition at line 529 of file dof_handler.h. Invalid active FE index which will be used as a default value to determine whether a future FE index has been set or not. Definition at line 550 of file dof_handler.h. Like above but with separate bool flags. Like above but with separate bool flags. Like above but using separate bool flags. Like above but using separate bool flags. The same as above. The same as above. The same as above. The same as above. 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 module. 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 88 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 198 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 198 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 198 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 198 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 198 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 198 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 198 of file ginkgo_solver.h. A class implementing various grid reordering algorithms. For more information see the reordering module. Definition at line 38 of file grid_reordering.h. Definition at line 114 of file grid_reordering.cc. Implements LinearAlgebra::VectorSpaceVector< Number >. Definition at line 154 of file cuda_vector.h. Implements LinearAlgebra::VectorSpaceVector< double >. Definition at line 141 of file trilinos_epetra_vector.h. Definition at line 312 of file read_write_vector.h. Definition at line 341 of file read_write_vector.h. Definition at line 370 of file read_write_vector.h. Definition at line 400 of file read_write_vector.h. Definition at line 432 of file read_write_vector.h. Definition at line 465 of file read_write_vector.h. Definition at line 495 of file read_write_vector.h. Definition at line 524 of file read_write_vector.h. This function returns the number of elements stored. It is smaller or equal to the dimension of the vector space that is modeled by an object of this kind. This dimension is return by size(). Implements LinearAlgebra::VectorSpaceVector< Number >. Definition at line 197 of file trilinos_tpetra_vector.h. Implements LinearAlgebra::VectorSpaceVector< Number >. Definition at line 236 of file la_vector.h. Definition at line 312 of file read_write_vector.h. Definition at line 341 of file read_write_vector.h. Definition at line 370 of file read_write_vector.h. Definition at line 400 of file read_write_vector.h. Definition at line 432 of file read_write_vector.h. Definition at line 465 of file read_write_vector.h. Definition at line 495 of file read_write_vector.h. Definition at line 524 of file read_write_vector.h. This function returns the number of elements stored. It is smaller or equal to the dimension of the vector space that is modeled by an object of this kind. This dimension is return by size(). Implemented in LinearAlgebra::distributed::BlockVector< Number >, LinearAlgebra::distributed::Vector< Number, MemorySpace >, LinearAlgebra::EpetraWrappers::Vector, LinearAlgebra::CUDAWrappers::Vector< Number >, LinearAlgebra::Vector< Number >, and LinearAlgebra::TpetraWrappers::Vector< Number >. This method zeros the entries on ghost dofs, but does not touch locally owned DoFs. After calling this method, read access to ghost elements of the vector is forbidden and an exception is thrown. Only write access to ghost elements is allowed in this state. Implements LinearAlgebra::VectorSpaceVector< Number >. Definition at line 585 of file la_parallel_block_vector.h. This method zeros the entries on ghost dofs, but does not touch locally owned DoFs. After calling this method, read access to ghost elements of the vector is forbidden and an exception is thrown. Only write access to ghost elements is allowed in this state. Definition at line 715 of file la_parallel_vector.h. Implements LinearAlgebra::VectorSpaceVector< Number >. Definition at line 782 of file la_parallel_vector.h. Return the local size of the vector, i.e., the number of indices owned locally. 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
│ │ │ │ @@ -1037,15 +1037,15 @@
│ │ │ │
│ │ │ │
│ │ │ │ Initialize the data cache by computing the mapping support points for all cells (on all levels) of the given triangulation. Definition at line 139 of file mapping_q_cache.cc.solution
obtains the block structure needed to represent a finite element function on the DoFHandler. Similarly, all levels of mg_vector
will have the block structure needed on that level.
│ │ │ │ +
│ │ │ │
│ │ │ │ Member Typedef Documentation
│ │ │ │
│ │ │ │ ◆ map_value_type
│ │ │ │
│ │ │ │ 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.
│ │ │ │ +
│ │ │ │
│ │ │ │
│ │ │ │ Member Typedef Documentation
│ │ │ │
│ │ │ │ ◆ size_type
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classCellAccessor.html
│ │ │ │ @@ -3155,15 +3155,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ n_active_descendants()
│ │ │ │
│ │ │ │
│ │ │ │ -
│ │ │ │ +
│ │ │ │
│ │ │ │ Member Typedef Documentation
│ │ │ │
│ │ │ │ ◆ scalar_type
│ │ │ │
│ │ │ │
│ │ │ │ staticinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ max_refinement_depth()
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ using DoFHandler< dim, spacedim >::active_fe_index_type = types::fe_index
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ offset_type
│ │ │ │ @@ -870,15 +870,15 @@
│ │ │ │
│ │ │ │ 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()
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ invalid_active_fe_index
│ │ │ │ @@ -2688,15 +2688,15 @@
│ │ │ │ static
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ block_info_object
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFEEvaluation.html
│ │ │ │ @@ -1407,15 +1407,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ evaluate() [3/4]
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ gather_evaluate() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ integrate() [1/4]
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ integrate() [3/4]
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ integrate_scatter() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ dof_indices()
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ evaluate() [3/4]
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ gather_evaluate() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ integrate() [1/4]
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ integrate() [3/4]
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ integrate_scatter() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ dof_indices()
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │ const
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ jump_in_shape_gradients()
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │ const
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ jump_in_shape_hessians()
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │ const
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ jump_in_shape_3rd_derivatives()
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │ const
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ average_of_shape_values()
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │ const
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ average_of_shape_gradients()
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │ const
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ average_of_shape_hessians()
│ │ │ │
│ │ │ │
│ │ │ │ )
│ │ │ │ const
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_jump_in_function_values()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_values() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [2/2]
│ │ │ │
│ │ │ │ Detailed Description
│ │ │ │
│ │ │ │ class FE_ABF< dim >spacedim != dim
).
│ │ │ │ +
│ │ │ │ Interpolation
│ │ │ │ Node values on edges/faces
│ │ │ │ Interior node values
│ │ │ │ Generalized support points
│ │ │ │ @@ -1951,15 +1951,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ static std::mutex mutex
│ │ │ │
│ │ │ │ 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.Member Typedef Documentation
│ │ │ │
│ │ │ │ @@ -1849,15 +1849,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_values() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ -
│ │ │ │ +
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_values() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ -Left - \(2d,\,k=3\), right - \(3d,\,k=2\).
│ │ │ │ +
│ │ │ │
│ │ │ │ Member Typedef Documentation
│ │ │ │
│ │ │ │ ◆ map_value_type
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values() [1/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtual
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtual
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values()
│ │ │ │
│ │ │ │
│ │ │ │ private
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ exec_type
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverBicgstab.html
│ │ │ │ @@ -658,15 +658,15 @@
│ │ │ │
│ │ │ │
│ │ │ │ privateinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ exec_type
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverCG.html
│ │ │ │ @@ -658,15 +658,15 @@
│ │ │ │
│ │ │ │
│ │ │ │ privateinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ exec_type
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverCGS.html
│ │ │ │ @@ -659,15 +659,15 @@
│ │ │ │
│ │ │ │
│ │ │ │ privateinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ exec_type
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverFCG.html
│ │ │ │ @@ -661,15 +661,15 @@
│ │ │ │
│ │ │ │
│ │ │ │ privateinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ exec_type
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverGMRES.html
│ │ │ │ @@ -658,15 +658,15 @@
│ │ │ │
│ │ │ │
│ │ │ │ privateinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ exec_type
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverIR.html
│ │ │ │ @@ -659,15 +659,15 @@
│ │ │ │
│ │ │ │
│ │ │ │ privateinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ exec_type
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGridReordering.html
│ │ │ │ @@ -129,15 +129,15 @@
│ │ │ │
│ │ │ │
│ │ │ │ static void invert_all_cells_of_negative_grid (const std::vector< Point< spacedim > > &all_vertices, std::vector< CellData< dim > > &original_cells, const bool use_new_style_ordering=false)
│ │ │ │
│ │ │ │ Detailed Description
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ Member Function Documentation
│ │ │ │
│ │ │ │ ◆ reorder_cells()
│ │ │ │
│ │ │ │
│ │ │ │ -
│ │ │ │
│ │ │ │
│ │ │ │ original_cells An object that contains the data that describes the mesh.
│ │ │ │ use_new_style_ordering If true, then use the standard ordering of vertices within a cell. If false (the default), then use the "old-style" ordering of vertices within cells used by deal.II before version 5.2 and as explained in the documentation of this class.
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ invert_all_cells_of_negative_grid() [1/10]
│ │ │ │ @@ -236,15 +236,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ all_vertices The vertices of the mesh.
│ │ │ │ original_cells An object that contains the data that describes the mesh.
│ │ │ │ use_new_style_ordering If true, then use the standard ordering of vertices within a cell. If false (the default), then use the "old-style" ordering of vertices within cells used by deal.II before version 5.2 and as explained in the documentation of this class. ◆ invert_all_cells_of_negative_grid() [2/10]
│ │ │ │
│ │ │ │
│ │ │ │ inlineoverridevirtual
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │
│ │ │ │ inlineoverridevirtual
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import_elements() [2/10]
│ │ │ │ @@ -1120,15 +1120,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import_elements() [3/10]
│ │ │ │ @@ -1208,15 +1208,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import_elements() [4/10]
│ │ │ │ @@ -1292,15 +1292,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import_elements() [5/10]
│ │ │ │ @@ -1377,15 +1377,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import_elements() [6/10]
│ │ │ │ @@ -1465,15 +1465,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import_elements() [7/10]
│ │ │ │ @@ -1549,15 +1549,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import_elements() [8/10]
│ │ │ │ @@ -1633,15 +1633,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ size()
│ │ │ │ @@ -1676,15 +1676,15 @@
│ │ │ │ (
│ │ │ │ )
│ │ │ │ const
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ locally_owned_size()
│ │ │ │
│ │ │ │
│ │ │ │ inlineoverridevirtual
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │
│ │ │ │ inlineoverridevirtual
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │
│ │ │ │ inlineinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import() [3/9]
│ │ │ │ @@ -2724,15 +2724,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inlineinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import() [4/9]
│ │ │ │ @@ -2773,15 +2773,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inlineinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import() [5/9]
│ │ │ │ @@ -2820,15 +2820,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inlineinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import() [6/9]
│ │ │ │ @@ -2867,15 +2867,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inlineinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import() [7/9]
│ │ │ │ @@ -2916,15 +2916,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inlineinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import() [8/9]
│ │ │ │ @@ -2963,15 +2963,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inlineinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ import() [9/9]
│ │ │ │ @@ -3010,15 +3010,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inlineinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ n_elements()
│ │ │ │ @@ -3041,15 +3041,15 @@
│ │ │ │
│ │ │ │
│ │ │ │ inherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ locally_owned_size()
│ │ │ │
│ │ │ │
│ │ │ │ pure virtual
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ operator*()
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classLinearAlgebra_1_1distributed_1_1BlockVector.html
│ │ │ │ @@ -1373,15 +1373,15 @@
│ │ │ │ )
│ │ │ │ const
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ zero_out_ghost_values()
│ │ │ │
│ │ │ │
│ │ │ │ inlineoverridevirtual
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ )
│ │ │ │ const
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ zero_out_ghost_values()
│ │ │ │
│ │ │ │
│ │ │ │ inline
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ reinit() [8/8]
│ │ │ │ @@ -1845,15 +1845,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ inlineoverridevirtual
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ (
│ │ │ │ )
│ │ │ │ const
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ locally_owned_size()
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │ Mapping of vector fields, differential forms and gradients of vector fields
│ │ │ │
│ │ │ │ protectedvirtual
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtual
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values()
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │
│ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingC1.html
│ │ │ │ @@ -1162,15 +1162,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.)
│ │ │ │ +
│ │ │ │
│ │ │ │
│ │ │ │ @@ -1671,15 +1671,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ [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.)
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values()
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │
│ │ │ │ @@ -2320,15 +2320,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ [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.)
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_face_values() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ subscribe()
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │
│ │ │ │ @@ -1810,15 +1810,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ [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.)
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_face_values() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_immersed_surface_values()
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │
│ │ │ │ @@ -2272,15 +2272,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ [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.)
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_face_values() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ subscribe()
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │
│ │ │ │ @@ -1733,15 +1733,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ [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.)
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_face_values() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_immersed_surface_values()
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │
│ │ │ │ @@ -2533,15 +2533,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ [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.)
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_face_values() [2/2]
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ subscribe()
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │
│ │ │ │ @@ -1460,15 +1460,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ [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.)
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values()
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │
│ │ │ │ @@ -1623,15 +1623,15 @@
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ [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.)
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ get_subface_data()
│ │ │ │
│ │ │ │
│ │ │ │ protectedvirtualinherited
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ fill_fe_subface_values()
│ │ │ │
│ │ │ │ )
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │
│ │ │ │ -
│ │ │ │ +
│ │ │ │
│ │ │ │ ◆ initialize() [3/7]
│ │ │ │ @@ -1420,15 +1420,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.) |
Here, we have not gained very much, except that we do not need to set up empty blocks in the block system.
│ │ │ │Definition at line 111 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 758 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 696 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 781 of file matrix_block.h.
│ │ │ │ │ │ │ │Assemble local residuals into global residuals.
│ │ │ │The global residuals are expected as an FEVectors object. The local residuals are block vectors.
│ │ │ │Depending on whether the BlockInfo object was initialize with BlockInfo::initialize_local(), the comprehensive or block data model is used locally.
│ │ │ │In the block model, each of the blocks of the local vectors corresponds to the restriction of a single block of the system to this cell (see GlossBlock). Thus, the size of this local block is the number of degrees of freedom of the corresponding base element of the FESystem.
│ │ │ │ -Definition at line 111 of file assembler.h.
│ │ │ │Write input for ParameterHandler without comments or changed default values.
│ │ │ │Keep the order of the parameters as they have been declared.
│ │ │ │Write human readable output suitable to be read by ParameterHandler::parse_input() again.
│ │ │ │Write human readable output suitable to be read by ParameterHandler::parse_input() again.
│ │ │ │ -PRM
instead of Text
. PRM
instead of Text
. Write parameters as a LaTeX table.
│ │ │ │Write out declared parameters with description and possible values.
│ │ │ │Write out everything as an XML file suitable to be read by ParameterHandler::parse_input_from_xml() again.
│ │ │ │See the general documentation of this class for an example of output.
│ │ │ │Write out everything as a JSON file suitable to be read by ParameterHandler::parse_input_from_json() again.
│ │ │ │Write the content of ParameterHandler without comments or changed default values.
│ │ │ │Write the content of ParameterHandler without comments or changed default values.
│ │ │ │ -ShortPRM
instead of ShortText
. ShortPRM
instead of ShortText
. Write the content of ParameterHandler without comments or changed default values as a XML file.
│ │ │ │Write the content of ParameterHandler without comments or changed default values as a JSON file.
│ │ │ │Write the content of ParameterHandler without comments or changed default values as a LaTeX file.
│ │ │ │Return the local dimension of the vector, i.e. the number of elements stored on the present MPI process. For sequential vectors, this number is the same as size(), but for parallel vectors it may be smaller.
│ │ │ │To figure out which elements exactly are stored locally, use local_range() or locally_owned_elements().
│ │ │ │ -Definition at line 452 of file petsc_vector_base.cc.
│ │ │ │ │ │ │ │Return the value of the vector element with the largest negative value.
│ │ │ │ -Definition at line 753 of file petsc_vector_base.cc.
│ │ │ │ │ │ │ │Return the value of the vector element with the largest positive value.
│ │ │ │ -Definition at line 766 of file petsc_vector_base.cc.
│ │ │ │ │ │ │ │Return true
if the vector has no negative entries, i.e. all entries are zero or positive. This function is used, for example, to check whether refinement indicators are really all positive (or zero).
Definition at line 834 of file petsc_vector_base.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 369 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 440 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 342 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 467 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 548 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 315 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 405 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 576 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 611 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 265 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 521 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 494 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Constructor. This constructor is deprecated and ignores the MPI communicator argument. Use the other constructor instead.
│ │ │ │ - │ │ │ │ + │ │ │ │ │ │ │ │Definition at line 651 of file petsc_solver.cc.
│ │ │ │ │ │ │ │Return the local dimension of the vector, i.e. the number of elements stored on the present MPI process. For sequential vectors, this number is the same as size(), but for parallel vectors it may be smaller.
│ │ │ │To figure out which elements exactly are stored locally, use local_range() or locally_owned_elements().
│ │ │ │ -Definition at line 452 of file petsc_vector_base.cc.
│ │ │ │ │ │ │ │Return the value of the vector element with the largest negative value.
│ │ │ │ -Definition at line 753 of file petsc_vector_base.cc.
│ │ │ │ │ │ │ │Return the value of the vector element with the largest positive value.
│ │ │ │ -Definition at line 766 of file petsc_vector_base.cc.
│ │ │ │ │ │ │ │Return true
if the vector has no negative entries, i.e. all entries are zero or positive. This function is used, for example, to check whether refinement indicators are really all positive (or zero).
Definition at line 834 of file petsc_vector_base.cc.
│ │ │ │ │ │ │ │Write input for ParameterHandler without comments or changed default values.
│ │ │ │Keep the order of the parameters as they have been declared.
│ │ │ │Write human readable output suitable to be read by ParameterHandler::parse_input() again.
│ │ │ │Write human readable output suitable to be read by ParameterHandler::parse_input() again.
│ │ │ │ -PRM
instead of Text
. PRM
instead of Text
. Write parameters as a LaTeX table.
│ │ │ │Write out declared parameters with description and possible values.
│ │ │ │Write out everything as an XML file suitable to be read by ParameterHandler::parse_input_from_xml() again.
│ │ │ │See the general documentation of this class for an example of output.
│ │ │ │Write out everything as a JSON file suitable to be read by ParameterHandler::parse_input_from_json() again.
│ │ │ │Write the content of ParameterHandler without comments or changed default values.
│ │ │ │Write the content of ParameterHandler without comments or changed default values.
│ │ │ │ -ShortPRM
instead of ShortText
. ShortPRM
instead of ShortText
. Write the content of ParameterHandler without comments or changed default values as a XML file.
│ │ │ │Write the content of ParameterHandler without comments or changed default values as a JSON file.
│ │ │ │Write the content of ParameterHandler without comments or changed default values as a LaTeX file.
│ │ │ │Tell the particle where to store its properties (even if it does not own properties). Usually this is only done once per particle, but since the particle generator does not know about the properties we want to do it not at construction time. Another use for this function is after particle transfer to a new process.
│ │ │ │ -Definition at line 799 of file particle_accessor.h.
│ │ │ │ │ │ │ │Definition at line 823 of file particle_accessor.h.
│ │ │ │ │ │ │ │Callback function that should be called before every refinement and when writing checkpoints. This function is used to register pack_callback() with the triangulation. This function is used in step-70.
│ │ │ │ -Definition at line 2171 of file particle_handler.cc.
│ │ │ │ │ │ │ │Callback function that should be called after every refinement and after resuming from a checkpoint. This function is used to register unpack_callback() with the triangulation. This function is used in step-70.
│ │ │ │ -Definition at line 2233 of file particle_handler.cc.
│ │ │ │ │ │ │ │This piece of code will first traverse all paths in the list set up for file class MESH
. If it manages to open a file, it returns the istream
object. If not, it will try to append the first suffix of the suffix list and do the same. And so on. If no file is found in the end, an exception is thrown.
If you want to restrict your search to a certain mesh format, .inp
for instance, then either use "grid.inp"
in the code above or use the alternative find(const std::string&,const std::string&,const char*) function
Path lists are by default starting with the current directory ("./"
), followed optionally by a standard directory of deal.II. Use show() to find out the path list for a given class. Paths and suffixes can be added using the functions add_path() and add_suffix(), respectively.
"/"
, while suffixes should always start with a dot. These characters are not added automatically (allowing you to do some real file name editing).Definition at line 83 of file path_search.h.
│ │ │ │Fill a vector with all tensor elements.
│ │ │ │This function unrolls all tensor entries into a single, linearly numbered vector. As usual in C++, the rightmost index of the tensor marches fastest.
│ │ │ │ -The cubic polynomial space for the Adini element
│ │ │ │This space consists of the cubic space P3 augmented by the functions xy3 and x3y.
│ │ │ │The basis of the space is chosen to match the node functionals of the Adini element.
│ │ │ │ -Definition at line 44 of file polynomials_adini.h.
│ │ │ │Determine the orientation of the current entity described by its vertices vertices_1
relative to an entity described by vertices_0
. The two arrays given as arguments can be arrays of global vertex indices or local vertex indices, arrays of vertex locations, or arrays of any other objects identifying the vertices and the order in which they are encountered in a cell.
The size of the arrays, i.e., the template argument N
, must be equal to or larger than the number of vertices of the current entity. If it is larger, only those elements of the input and output arrays are read from or written to that correspond to valid vertex indices.
Definition at line 2894 of file reference_cell.h.
│ │ │ │ │ │ │ │Inverse function of compute_orientation(): Given a set of vertex-associated objects (such as vertex indices, locations, etc.) and a desired orientation permutation, return the permuted vertex information.
│ │ │ │The size of the input and output arrays, i.e., the template argument N
, must be equal to or larger than the number of vertices of the current entity. If it is larger, only those elements of the input and output arrays are read from or written to that correspond to valid vertex indices.
Definition at line 3022 of file reference_cell.h.
│ │ │ │ │ │ │ │An implementation of the transformation interface using the SLEPc Spectrum Folding. This transformation type has been removed in SLEPc 3.5.0 and thus cannot be used in the newer versions.
│ │ │ │ -Definition at line 211 of file slepc_spectral_transformation.h.
│ │ │ │A call to this function should store in dst
the result of \(J^{-1}\) applied to src
, i.e., J*dst = src
. It is the users responsibility to set up proper solvers and preconditioners inside this function.
std::function<void(const VectorType &ycur, const VectorType &fcur, const VectorType &rhs, VectorType & dst)> SUNDIALS::KINSOL< VectorType >::solve_jacobian_system | │ │ │ │
solve_with_jacobian
callback described below.solve_with_jacobian
callback described below.A function object that users may supply and that is intended to solve a linear system with the Jacobian matrix. This function will be called by KINSOL (possibly several times) after setup_jacobian() has been called at least once. KINSOL tries to do its best to call setup_jacobian() the minimum number of times. If convergence can be achieved without updating the Jacobian, then KINSOL does not call setup_jacobian() again. If, on the contrary, internal KINSOL convergence tests fail, then KINSOL calls setup_jacobian() again with updated vectors and coefficients so that successive calls to solve_jacobian_system() lead to better convergence in the Newton process.
│ │ │ │If you do not specify a solve_jacobian_system
or solve_with_jacobian
function, then only a fixed point iteration strategy can be used. Notice that this may not converge, or may converge very slowly.
A call to this function should store in dst
the result of \(J^{-1}\) applied to rhs
, i.e., \(J \cdot dst = rhs\). It is the user's responsibility to set up proper solvers and preconditioners inside this function (or in the setup_jacobian
callback above).
Arguments to the function are:
│ │ │ │[in] | ycur | The current \(y\) vector for the current KINSOL internal step. In the documentation above, this \(y\) vector is generally denoted by \(u\). |
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#2406, │ │ │ │ -which are diagonal elements of the scaling matrix such that \_form#2423 has │ │ │ │ -all components roughly the same magnitude when \_form#302 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#2386, │ │ │ │ +which are diagonal elements of the scaling matrix such that \_form#2408 has │ │ │ │ +all components roughly the same magnitude when \_form#257 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.
│ │ │ │Return a pointer to the first element of the underlying storage.
│ │ │ │ -Return a const pointer to the first element of the underlying storage.
│ │ │ │ -Return a pointer to the element past the end of the underlying storage.
│ │ │ │ -Return a const pointer to the element past the end of the underlying storage.
│ │ │ │ -Fill a vector with all tensor elements.
│ │ │ │This function unrolls all tensor entries into a single, linearly numbered vector. As usual in C++, the rightmost index of the tensor marches fastest.
│ │ │ │ -Return a pointer to the first element of the underlying storage.
│ │ │ │ -Return a const pointer to the first element of the underlying storage.
│ │ │ │ -Return a pointer to the element past the end of the underlying storage.
│ │ │ │ -Return a const pointer to the element past the end of the underlying storage.
│ │ │ │ -An object that represents a spawned thread. This object can be freely copied around in user space, and all instances will represent the same thread and can require to wait for its termination and access its return value.
│ │ │ │Threads can be abandoned, i.e. if you just call Threads::new_thread but don't care about the returned object, or if you assign the return Threads::Thread object to an object that subsequently goes out of scope, then the thread previously created will still continue to do work. You will simply not be able to access its return value any more, and it may also happen that your program terminates before the thread has finished its work.
│ │ │ │The default value of the template argument is void
, so if the function you are calling on a new thread has no return value, you can omit the template argument.
Definition at line 552 of file thread_management.h.
│ │ │ │A container for thread objects. Allows to add new thread objects and wait for them all together. The thread objects need to have the same return value for the called function.
│ │ │ │ -Definition at line 899 of file thread_management.h.
│ │ │ │Definition at line 736 of file trilinos_vector.h.
│ │ │ │ │ │ │ │Return the local dimension of the vector, i.e. the number of elements stored on the present MPI process. For sequential vectors, this number is the same as size(), but for parallel vectors it may be smaller.
│ │ │ │To figure out which elements exactly are stored locally, use local_range().
│ │ │ │If the vector contains ghost elements, they are included in this number.
│ │ │ │ -Constructor. process
is an object that provides information about what processes the current process wants to communicate with, and the data to be sent/received. comm
is the communicator on which this communication is to happen.
Run the consensus algorithm and return a vector of process ranks that have requested answers from the current process.
│ │ │ │ -process | Process to be run during consensus algorithm. |
comm | MPI Communicator |
Run the consensus algorithm and return a vector of process ranks that have requested answers from the current process.
│ │ │ │ -Implements Utilities::MPI::ConsensusAlgorithms::Interface< RequestType, AnswerType >.
│ │ │ │ │ │ │ │Run the consensus algorithm and return a vector of process ranks that have requested answers from the current process.
│ │ │ │ -process | Process to be run during consensus algorithm. |
comm | MPI Communicator |
Run the consensus algorithm and return a vector of process ranks that have requested answers from the current process.
│ │ │ │ -Implements Utilities::MPI::ConsensusAlgorithms::Interface< RequestType, AnswerType >.
│ │ │ │ │ │ │ │Run the consensus algorithm and return a vector of process ranks that have requested answers from the current process.
│ │ │ │ -process | Process to be run during consensus algorithm. |
comm | MPI Communicator. |
Run the consensus algorithm and return a vector of process ranks that have requested answers from the current process.
│ │ │ │ -Implements Utilities::MPI::ConsensusAlgorithms::Interface< RequestType, AnswerType >.
│ │ │ │ │ │ │ │Run the consensus algorithm and return a vector of process ranks that have requested answers from the current process.
│ │ │ │ -process | Process to be run during consensus algorithm. |
comm | MPI Communicator (ignored) |
Run the consensus algorithm and return a vector of process ranks that have requested answers from the current process.
│ │ │ │ -Implements Utilities::MPI::ConsensusAlgorithms::Interface< RequestType, AnswerType >.
│ │ │ │ │ │ │ │Run the consensus algorithm and return a vector of process ranks that have requested answers from the current process.
│ │ │ │ -Return the number of locally owned indices, i.e., local_range().second minus local_range().first. The returned numbers need to add up to the total number of indices when summed over all processes
│ │ │ │ -Deprecated constructor.
│ │ │ │ -Definition at line 9401 of file data_out_base.cc.
│ │ │ │ │ │ │ │Deprecated constructor.
│ │ │ │ -Definition at line 9420 of file data_out_base.cc.
│ │ │ │ │ │ │ │Deprecated constructor.
│ │ │ │ -Definition at line 9457 of file data_out_base.cc.
│ │ │ │ │ │ │ │Get the XDMF content associated with this entry. If the entry is not valid, this returns an empty string.
│ │ │ │ -Definition at line 9557 of file data_out_base.cc.
│ │ │ │ │ │ │ │Return an iterator to the next free slot for a single object. This function is only used by Triangulation::execute_refinement() in 3d.
│ │ │ │Return an iterator to the next free slot for a pair of objects. This function is only used by Triangulation::execute_refinement() in 3d.
│ │ │ │Load the triangulation saved with save() back in. Cell-based data that was saved with register_data_attach() can be read in with notify_ready_to_unpack() after calling load().
│ │ │ │ -Implemented in parallel::fullydistributed::Triangulation< dim, spacedim >, parallel::distributed::Triangulation< dim, spacedim >, and parallel::distributed::Triangulation< 1, spacedim >.
│ │ │ │ │ │ │ │Load the refinement information saved with save() back in. The mesh must contain the same coarse mesh that was used in save() before calling this function.
│ │ │ │You do not need to load with the same number of MPI processes that you saved with. Rather, if a mesh is loaded with a different number of MPI processes than used at the time of saving, the mesh is repartitioned that the number of cells is balanced among all processes. Individual repartitioning, e.g., based on the number of dofs or particles per cell, needs to be invoked manually by calling repartition() afterwards.
│ │ │ │Cell-based data that was saved with DistributedTriangulationBase::DataTransfer::register_data_attach() can be read in with DistributedTriangulationBase::DataTransfer::notify_ready_to_unpack() after calling load().
│ │ │ │ -Implements parallel::DistributedTriangulationBase< dim, spacedim >.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │Load the triangulation saved with save() back in. The mesh must be empty before calling this function.
│ │ │ │You need to load with the same number of MPI processes that you saved with, hence autopartition is disabled.
│ │ │ │Cell-based data that was saved with register_data_attach() can be read in with notify_ready_to_unpack() after calling load().
│ │ │ │ -Implements parallel::DistributedTriangulationBase< dim, spacedim >.
│ │ │ │ │ │ │ │Definition at line 742 of file fully_distributed_tria.cc.
│ │ │ │ │ │ │ │selected_dofs
has to have a length equal to all global degrees of freedom. Consequently, this does not scale to very large problems, and this is also why the function is deprecated. If you need the functionality of this function for parallel triangulations, then you need to use the other DoFTools::extract_boundary_dofs() function that returns its information via an IndexSet object. selected_dofs
has to have a length equal to all global degrees of freedom. Consequently, this does not scale to very large problems, and this is also why the function is deprecated. If you need the functionality of this function for parallel triangulations, then you need to use the other DoFTools::extract_boundary_dofs() function that returns its information via an IndexSet object. std::map
instead. std::map
instead. std::map
instead. std::map
instead. std_cxx20::identity_type
instead. std_cxx20::identity_type
instead. ShortPRM
instead of ShortText
. ShortPRM
instead of ShortText
. PRM
instead of Text
. PRM
instead of Text
. solve_with_jacobian
callback described below. solve_with_jacobian
callback described below. weight
signal instead which omits the base weight. You can invoke the old behavior by connecting a function to the signal that returns the base weight as follows. This function should be added in addition to the one that actually computes the weight. weight
signal instead which omits the base weight. You can invoke the old behavior by connecting a function to the signal that returns the base weight as follows. This function should be added in addition to the one that actually computes the weight. Definition at line 814 of file thread_management.h.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/group__Exceptions.html │ │ │ │ @@ -6436,15 +6436,15 @@ │ │ │ │ │ │ │ │ │ │ │ │Overload of the new_thread function for objects that can be converted to std::function<RT ()>, i.e. anything that can be called like a function object without arguments and returning an object of type RT (or void).
│ │ │ │ -Definition at line 731 of file thread_management.h.
│ │ │ │ │ │ │ │Overload of the new_thread function for non-member or static member functions.
│ │ │ │ -Definition at line 836 of file thread_management.h.
│ │ │ │ │ │ │ │Overload of the non-const new_thread function for member functions.
│ │ │ │ -Definition at line 857 of file thread_management.h.
│ │ │ │ │ │ │ │Overload of the new_thread function for const member functions.
│ │ │ │ -Definition at line 875 of file thread_management.h.
│ │ │ │ │ │ │ ││ │ │ │ Functions | |
template<typename MeshIteratorType > | |
constexpr std::size_t | Manifolds::n_default_points_per_cell () |
template<typename MeshIteratorType > | |
std::pair< std::array< Point< MeshIteratorType::AccessorType::space_dimension >, n_default_points_per_cell< MeshIteratorType >()>, std::array< double, n_default_points_per_cell< MeshIteratorType >()> > | Manifolds::get_default_points_and_weights (const MeshIteratorType &iterator, const bool with_interpolation=false) |
template<typename MeshIteratorType > | |
std::pair< std::array< Point< MeshIteratorType::AccessorType::space_dimension >, n_default_points_per_cell< MeshIteratorType >()>, std::array< double, n_default_points_per_cell< MeshIteratorType >()> > | Manifolds::get_default_points_and_weights (const MeshIteratorType &iterator, const bool with_interpolation=false) |
vtu
: .vtu
svg
: .svg
deal_II_intermediate
: .d2
. Definition at line 2497 of file data_out_base.cc.
│ │ │ │ │ │ │ │Extract all degrees of freedom which are at the boundary and belong to specified components of the solution. The function returns its results in the last non-default-valued parameter which contains true
if a degree of freedom is at the boundary and belongs to one of the selected components, and false
otherwise.
By specifying the boundary_ids
variable, you can select which boundary indicators the faces have to have on which the degrees of freedom are located that shall be extracted. If it is an empty list, then all boundary indicators are accepted.
The size of component_mask
(see GlossComponentMask) shall equal the number of components in the finite element used by dof
. The size of selected_dofs
shall equal dof_handler.n_dofs()
. Previous contents of this array are overwritten.
Using the usual convention, if a shape function is non-zero in more than one component (i.e. it is non-primitive), then the element in the component mask is used that corresponds to the first non-zero components. Elements in the mask corresponding to later components are ignored.
│ │ │ │ -selected_dofs
has to have a length equal to all global degrees of freedom. Consequently, this does not scale to very large problems, and this is also why the function is deprecated. If you need the functionality of this function for parallel triangulations, then you need to use the other DoFTools::extract_boundary_dofs() function that returns its information via an IndexSet object.selected_dofs
has to have a length equal to all global degrees of freedom. Consequently, this does not scale to very large problems, and this is also why the function is deprecated. If you need the functionality of this function for parallel triangulations, then you need to use the other DoFTools::extract_boundary_dofs() function that returns its information via an IndexSet object.[in] | dof_handler | The object that describes which degrees of freedom live on which cell. |
[in] | component_mask | A mask denoting the vector components of the finite element that should be considered (see also GlossComponentMask). |
[out] | selected_dofs | A vector of booleans that is returned and for which an element will be true if the corresponding index is a degree of freedom that is located on the boundary (and correspond to the selected vector components and boundary indicators, depending on the values of the component_mask and boundary_ids arguments). |
[in] | boundary_ids | If empty, this function extracts the indices of the degrees of freedom for all parts of the boundary. If it is a non- empty list, then the function only considers boundary faces with the boundary indicators listed in this argument. |
The same as the previous function, except that it returns its information via the third argument.
│ │ │ │ -Definition at line 572 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 1077 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 1124 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 1176 of file dof_tools.cc.
│ │ │ │ │ │ │ │Same as extract_locally_relevant_dofs() but for multigrid DoFs for the given level
.
Definition at line 1235 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 1363 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 2299 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 2320 of file dof_tools.cc.
│ │ │ │ │ │ │ │This is the opposite function to the one above. It generates a map where the keys are the support points of the degrees of freedom, while the values are the DoF indices. For a definition of support points, see this glossary entry.
│ │ │ │Since there is no natural order in the space of points (except for the 1d case), you have to provide a map with an explicitly specified comparator object. This function is therefore templatized on the comparator object. Previous content of the map object is deleted in this function.
│ │ │ │Just as with the function above, it is assumed that the finite element in use here actually supports the notion of support points of all its components.
│ │ │ │ -Given a list of vertices (typically obtained using Triangulation::get_vertices) as the first, and a list of vertex indices that characterize a single cell as the second argument, return the measure (area, volume) of this cell. If this is a real cell, then you can get the same result using cell->measure()
, but this function also works for cells that do not exist except that you make it up by naming its vertices from the list.
Definition at line 2187 of file grid_tools.cc.
│ │ │ │ │ │ │ │The residual of the divergence operator in weak form.
│ │ │ │ \[ - \int_Z │ │ │ │ \nabla v \cdot \mathbf u \,dx \] │ │ │ │
│ │ │ │This is the weak divergence operator and the test space should be at least H1. The trial functions may be discontinuous.
│ │ │ │ -Definition at line 126 of file divergence.h.
│ │ │ │ │ │ │ │The residual of the gradient operator in weak form.
│ │ │ │ \[ -\int_Z │ │ │ │ \nabla\cdot \mathbf v u \,dx \] │ │ │ │
│ │ │ │This is the weak gradient operator and the test space should be at least Hdiv. The trial functions may be discontinuous.
│ │ │ │ -Definition at line 230 of file divergence.h.
│ │ │ │ │ │ │ ││ │ │ │ Functions | |
template<typename MeshIteratorType > | |
constexpr std::size_t | n_default_points_per_cell () |
template<typename MeshIteratorType > | |
std::pair< std::array< Point< MeshIteratorType::AccessorType::space_dimension >, n_default_points_per_cell< MeshIteratorType >()>, std::array< double, n_default_points_per_cell< MeshIteratorType >()> > | get_default_points_and_weights (const MeshIteratorType &iterator, const bool with_interpolation=false) |
template<typename MeshIteratorType > | |
std::pair< std::array< Point< MeshIteratorType::AccessorType::space_dimension >, n_default_points_per_cell< MeshIteratorType >()>, std::array< double, n_default_points_per_cell< MeshIteratorType >()> > | get_default_points_and_weights (const MeshIteratorType &iterator, const bool with_interpolation=false) |
We collect here some helper functions used in the Manifold<dim,spacedim> classes.
│ │ │ │std::pair< std::array< Point< MeshIteratorType::AccessorType::space_dimension >, n_default_points_per_cell< MeshIteratorType >()>, std::array< double, n_default_points_per_cell< MeshIteratorType >()> > Manifolds::get_default_points_and_weights | │ │ │ │ +std::pair< std::array< Point< MeshIteratorType::AccessorType::space_dimension >, n_default_points_per_cell< MeshIteratorType >()>, std::array< double, n_default_points_per_cell< MeshIteratorType >()> > Manifolds::get_default_points_and_weights | │ │ │ │( | │ │ │ │ -const MeshIteratorType & | │ │ │ │ +const MeshIteratorType & | │ │ │ │iterator, | │ │ │ │
│ │ │ │ | │ │ │ │ - | const bool | │ │ │ │ -with_interpolation = false |
│ │ │ │ + const bool | │ │ │ │ +with_interpolation = false |
│ │ │ │
│ │ │ │ | ) | │ │ │ ││ │ │ │ |
If the library is configured to use multithreading, this function works in parallel.
│ │ │ │weight:
an optional weight for the computation of the mass matrix. If no weight is given, it is set to one. In case you want to specify component_mapping
and use the default argument for the coefficient you have to specify the (unused) coefficient argument as (const Function <spacedim,number> *const)nullptr
.component_mapping:
if the components in boundary_functions
and dof
do not coincide, this vector allows them to be remapped. If the vector is not empty, it has to have one entry for each component in dof
. This entry is the component number in boundary_functions
that should be used for this component in dof
. By default, no remapping is applied.using PETScWrappers::PreconditionerBase = typedef PreconditionBase | │ │ │ │
Alias for backwards-compatibility.
Alias for backwards-compatibility.
Definition at line 1167 of file petsc_precondition.h.
│ │ │ │ │ │ │ │[in] | axis | A unit vector that defines the axis of rotation |
[in] | angle | The rotation angle in radians |
Definition at line 1096 of file sparsity_tools.cc.
│ │ │ │ │ │ │ │Definition at line 214 of file mpi.cc.
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │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 "C \_form#5152 Interior Penalty Method │ │ │ │ +
We base this program on the \(C^0\) IP method presented by Susanne Brenner and Li-Yeng Sung in the paper "C \_form#4416 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 │ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/step_58.html │ │ │ │ @@ -566,16 +566,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#381" but more like "we've already done one third of the work necessary │ │ │ │ -for time step \_form#3059".)
│ │ │ │ + \_form#375" but more like "we've already done one third of the work necessary │ │ │ │ +for time step \_form#4226".) │ │ │ │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)} │ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/structDataOutBase_1_1VtkFlags.html │ │ │ │ @@ -172,15 +172,15 @@ │ │ │ │
using DataOutBase::VtkFlags::ZlibCompressionLevel = DataOutBase::CompressionLevel | │ │ │ │
A data type providing the different possible zlib compression levels. These map directly to constants defined by zlib.
│ │ │ │ -Definition at line 1167 of file data_out_base.h.
│ │ │ │ │ │ │ │A struct that provides the output type for the product of the value and derivatives of basis functions of the Scalar view and any Number
type.
Definition at line 234 of file fe_values.h.
│ │ │ │A struct that provides the output type for the product of the value and derivatives of basis functions of the SymmetricTensor view and any Number
type.
Definition at line 1526 of file fe_values.h.
│ │ │ │A struct that provides the output type for the product of the value and derivatives of basis functions of the Tensor view and any Number
type.
Definition at line 1872 of file fe_values.h.
│ │ │ │A struct that provides the output type for the product of the value and derivatives of basis functions of the Vector view and any Number
type.
Definition at line 821 of file fe_values.h.
│ │ │ │A data type providing the different possible zlib compression levels. These map directly to constants defined by zlib.
│ │ │ │ -Definition at line 1167 of file data_out_base.h.
│ │ │ │ │ │ │ │A data type providing the different possible zlib compression levels. These map directly to constants defined by zlib.
│ │ │ │ -Definition at line 1167 of file data_out_base.h.
│ │ │ │ │ │ │ │A structure that allows the transfer of cell data of type T
from one processor to another. It corresponds to a packed buffer that stores a vector of CellId and a vector of type T
.
This class facilitates the transfer by providing the save/load functions that are able to pack up the vector of CellId's and the associated data of type T
into a stream.
Type T
is assumed to be serializable by boost::serialization
(for example unsigned int
or std::vector<double>
).
Definition at line 3634 of file grid_tools.h.
│ │ │ │This signal is triggered for each cell during every automatic or manual repartitioning. It is intended to allow a weighted repartitioning of the domain to balance the computational load across processes in a different way than balancing the number of cells. Any connected function is expected to take an iterator to a cell, and a CellStatus argument that indicates whether this cell is going to be refined, coarsened or left untouched (see the documentation of the CellStatus enum for more information). The function is expected to return an unsigned integer, which is interpreted as the additional computational load of this cell.
│ │ │ │In serial and parallel shared applications, partitioning happens after refinement. So all cells will have the CELL_PERSIST
status.
In parallel distributed applications, partitioning happens during refinement. If this cell is going to be coarsened, the signal is called for the parent cell and you need to provide the weight of the future parent cell. If this cell is going to be refined, the function is called on all children while cell_iterator
refers to their parent cell. In this case, you need to pick a weight for each individual child based on information given by the parent cell.
If several functions are connected to this signal, their return values will be summed to calculate the final weight of a cell. This allows different parts of a larger code base to have their own functions computing the weight of a cell; for example in a code that does both finite element and particle computations on each cell, the code could separate the computation of a cell's weight into two functions, each implemented in their respective files, that provide the finite element-based and the particle-based weights.
│ │ │ │This function is used in step-68 and implicitly in step-75 using the parallel::CellWeights class.
│ │ │ │As a reference, a value of 1000 is added for every cell to the total weight. This means a signal return value of 1000 (resulting in a weight of 2000) means that it is twice as expensive for a process to handle this particular cell.
│ │ │ │ -weight
signal instead which omits the base weight. You can invoke the old behavior by connecting a function to the signal that returns the base weight as follows. This function should be added in addition to the one that actually computes the weight. weight
signal instead which omits the base weight. You can invoke the old behavior by connecting a function to the signal that returns the base weight as follows. This function should be added in addition to the one that actually computes the weight. using identity = std_cxx20::type_identity<T> | │ │ │ │
A using
declaration to make the std::identity_type class available under the name that deal.II has used for a long time.
std_cxx20::identity_type
instead. std_cxx20::identity_type
instead. Definition at line 345 of file template_constraints.h.
│ │ │ │ │ │ │ │mapping
argument should be replaced by a hp::MappingCollection in case of a DoFHandler with hp-capabilities. 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.