--- /srv/rebuilderd/tmp/rebuilderdQ27or2/inputs/libdeal.ii-doc_9.6.2-4_all.deb +++ /srv/rebuilderd/tmp/rebuilderdQ27or2/out/libdeal.ii-doc_9.6.2-4_all.deb ├── file list │ @@ -1,3 +1,3 @@ │ -rw-r--r-- 0 0 0 4 2025-06-30 07:29:44.000000 debian-binary │ --rw-r--r-- 0 0 0 270620 2025-06-30 07:29:44.000000 control.tar.xz │ --rw-r--r-- 0 0 0 285964360 2025-06-30 07:29:44.000000 data.tar.xz │ +-rw-r--r-- 0 0 0 270628 2025-06-30 07:29:44.000000 control.tar.xz │ +-rw-r--r-- 0 0 0 285963480 2025-06-30 07:29:44.000000 data.tar.xz ├── control.tar.xz │ ├── control.tar │ │ ├── ./control │ │ │ @@ -1,13 +1,13 @@ │ │ │ Package: libdeal.ii-doc │ │ │ Source: deal.ii │ │ │ Version: 9.6.2-4 │ │ │ Architecture: all │ │ │ Maintainer: Debian Science Maintainers │ │ │ -Installed-Size: 644712 │ │ │ +Installed-Size: 644713 │ │ │ Depends: fonts-mathjax-extras, libjs-mathjax │ │ │ Section: doc │ │ │ Priority: optional │ │ │ Multi-Arch: foreign │ │ │ Homepage: http://www.dealii.org/ │ │ │ Description: Differential Equations Analysis Library - html doc. and examples │ │ │ deal.II is a C++ program library targeted at the computational solution of │ │ ├── ./md5sums │ │ │ ├── ./md5sums │ │ │ │┄ Files differ ├── data.tar.xz │ ├── data.tar │ │ ├── file list │ │ │ @@ -8963,29 +8963,29 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 272533 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/scratch__data_8h_source.html │ │ │ -rw-r--r-- 0 root (0) root (0) 7627 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/sd_8h.html │ │ │ -rw-r--r-- 0 root (0) root (0) 15792 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/sd_8h_source.html │ │ │ drwxr-xr-x 0 root (0) root (0) 0 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/ │ │ │ -rw-r--r-- 0 root (0) root (0) 3826 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_0.js │ │ │ -rw-r--r-- 0 root (0) root (0) 4037 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1.js │ │ │ -rw-r--r-- 0 root (0) root (0) 231054 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_10.js │ │ │ --rw-r--r-- 0 root (0) root (0) 179463 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_11.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 180379 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_11.js │ │ │ -rw-r--r-- 0 root (0) root (0) 281968 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_12.js │ │ │ -rw-r--r-- 0 root (0) root (0) 56577 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_13.js │ │ │ --rw-r--r-- 0 root (0) root (0) 276457 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_14.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 276423 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_14.js │ │ │ -rw-r--r-- 0 root (0) root (0) 12134 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_15.js │ │ │ -rw-r--r-- 0 root (0) root (0) 4673 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_16.js │ │ │ -rw-r--r-- 0 root (0) root (0) 125362 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_17.js │ │ │ -rw-r--r-- 0 root (0) root (0) 258057 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_18.js │ │ │ -rw-r--r-- 0 root (0) root (0) 157301 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_19.js │ │ │ -rw-r--r-- 0 root (0) root (0) 220616 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1a.js │ │ │ --rw-r--r-- 0 root (0) root (0) 289963 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1b.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 289804 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1b.js │ │ │ -rw-r--r-- 0 root (0) root (0) 40894 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1c.js │ │ │ -rw-r--r-- 0 root (0) root (0) 235387 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1d.js │ │ │ --rw-r--r-- 0 root (0) root (0) 465583 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1e.js │ │ │ --rw-r--r-- 0 root (0) root (0) 259941 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1f.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 464546 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1e.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 260240 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_1f.js │ │ │ -rw-r--r-- 0 root (0) root (0) 3645 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_2.js │ │ │ -rw-r--r-- 0 root (0) root (0) 56423 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_20.js │ │ │ -rw-r--r-- 0 root (0) root (0) 167601 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_21.js │ │ │ -rw-r--r-- 0 root (0) root (0) 36152 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_22.js │ │ │ -rw-r--r-- 0 root (0) root (0) 3907 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_23.js │ │ │ -rw-r--r-- 0 root (0) root (0) 269 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_24.js │ │ │ -rw-r--r-- 0 root (0) root (0) 4076 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_25.js │ │ │ @@ -8995,18 +8995,18 @@ │ │ │ -rw-r--r-- 0 root (0) root (0) 2328 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_5.js │ │ │ -rw-r--r-- 0 root (0) root (0) 2539 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_6.js │ │ │ -rw-r--r-- 0 root (0) root (0) 1892 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_7.js │ │ │ -rw-r--r-- 0 root (0) root (0) 2888 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_8.js │ │ │ -rw-r--r-- 0 root (0) root (0) 3088 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_9.js │ │ │ -rw-r--r-- 0 root (0) root (0) 7437 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_a.js │ │ │ -rw-r--r-- 0 root (0) root (0) 350 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_b.js │ │ │ --rw-r--r-- 0 root (0) root (0) 258512 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_c.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 258742 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_c.js │ │ │ -rw-r--r-- 0 root (0) root (0) 107860 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_d.js │ │ │ --rw-r--r-- 0 root (0) root (0) 417992 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_e.js │ │ │ --rw-r--r-- 0 root (0) root (0) 199979 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_f.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 418156 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_e.js │ │ │ +-rw-r--r-- 0 root (0) root (0) 200058 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/all_f.js │ │ │ -rw-r--r-- 0 root (0) root (0) 43245 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/classes_0.js │ │ │ -rw-r--r-- 0 root (0) root (0) 9809 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/classes_1.js │ │ │ -rw-r--r-- 0 root (0) root (0) 5320 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/classes_10.js │ │ │ -rw-r--r-- 0 root (0) root (0) 13686 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/classes_11.js │ │ │ -rw-r--r-- 0 root (0) root (0) 59275 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/classes_12.js │ │ │ -rw-r--r-- 0 root (0) root (0) 38047 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/classes_13.js │ │ │ -rw-r--r-- 0 root (0) root (0) 1724 2025-06-30 07:29:44.000000 ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/search/classes_14.js │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/cell__status_8h.html │ │ │ @@ -147,21 +147,21 @@ │ │ │ │ │ │ cell_will_be_refined 

The cell will be or was refined.

│ │ │ │ │ │ children_will_be_coarsened 

The children of this cell will be or were coarsened into this cell.

│ │ │ │ │ │ cell_invalid 

Invalid status. Will not occur for the user.

│ │ │ │ │ │ -CELL_PERSIST 
Deprecated:
Use CellStatus::cell_will_persist instead
│ │ │ +CELL_PERSIST 
Deprecated:
Use CellStatus::cell_will_persist instead
│ │ │ │ │ │ -CELL_REFINE 
Deprecated:
Use CellStatus::cell_will_be_refined instead
│ │ │ +CELL_REFINE 
Deprecated:
Use CellStatus::cell_will_be_refined instead
│ │ │ │ │ │ -CELL_COARSEN 
Deprecated:
Use CellStatus::cell_will_be_coarsened instead
│ │ │ +CELL_COARSEN 
Deprecated:
Use CellStatus::cell_will_be_coarsened instead
│ │ │ │ │ │ -CELL_INVALID 
Deprecated:
Use CellStatus::cell_invalid instead
│ │ │ +CELL_INVALID 
Deprecated:
Use CellStatus::cell_invalid instead
│ │ │ │ │ │ │ │ │ │ │ │

Definition at line 30 of file cell_status.h.

│ │ │ │ │ │ │ │ │ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classAffineConstraints.html │ │ │ @@ -636,15 +636,15 @@ │ │ │ │ │ │ inlineexplicit │ │ │ │ │ │ │ │ │
│ │ │

Constructor. The supplied IndexSet defines for which indices this object will store constraints. In a calculation with a DoFHandler object based on parallel::distributed::Triangulation or parallel::shared::Triangulation, one should use the set of locally relevant DoFs (see GlossLocallyRelevantDof).

│ │ │

The given IndexSet allows the AffineConstraints container to save memory by just not caring about degrees of freedom that are not of importance to the current processor. In contrast, in parallel computations, if you do not provide such an index set (here, or using the reinit() function that takes such an argument), the current object will allocate memory proportional to the total number of degrees of freedom (accumulated over all processes), which is clearly wasteful and not efficient – and should be considered a bug.

│ │ │ -
Deprecated:
This constructor is equivalent to calling the following one with both of its arguments equal to the index set provided here. This is not wrong, but inefficient. Use the following constructor instead.
│ │ │ +
Deprecated:
This constructor is equivalent to calling the following one with both of its arguments equal to the index set provided here. This is not wrong, but inefficient. Use the following constructor instead.
│ │ │ │ │ │

Definition at line 2312 of file affine_constraints.h.

│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ AffineConstraints() [3/5]

│ │ │ @@ -877,15 +877,15 @@ │ │ │ const IndexSet &  │ │ │ locally_stored_constraints) │ │ │ │ │ │ │ │ │ │ │ │
│ │ │

clear() the AffineConstraints object and supply an IndexSet that describes for which degrees of freedom this object can store constraints. See the discussion in the documentation of the constructor of this class that takes a single index set as argument.

│ │ │ -
Deprecated:
Use the reinit() function with two index set arguments instead.
│ │ │ +
Deprecated:
Use the reinit() function with two index set arguments instead.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ reinit() [3/3]

│ │ │ │ │ │
│ │ │ @@ -1033,15 +1033,15 @@ │ │ │ │ │ │ │ │ │ │ │ │
│ │ │

This function copies the content of constraints_in with DoFs that are element of the IndexSet filter. Elements that are not present in the IndexSet are ignored. All DoFs will be transformed to local index space of the filter, both the constrained DoFs and the other DoFs these entries are constrained to. The local index space of the filter is a contiguous numbering of all (global) DoFs that are elements in the filter.

│ │ │

If, for example, the filter represents the range [10,20), and the constraints object constraints_in includes the global indices {7,13,14}, the indices {3,4} are added to the calling constraints object (since 13 and 14 are elements in the filter and element 13 is the fourth element in the index, and 14 is the fifth).

│ │ │

This function provides an easy way to create a AffineConstraints for certain vector components in a vector-valued problem from a full AffineConstraints, i.e. extracting a diagonal subblock from a larger AffineConstraints. The block is specified by the IndexSet argument.

│ │ │ -
Deprecated:
This function is a combination of the get_view() function and merge() in that it selects a subset of constraints from another constraints object that is then merged into the current one. But the current function does not deal well with index sets. Furthermore, it simply discards parts of constraints that constrain one degree of freedom against ones that are not selected in the filter – something that should probably be considered a bug. Use get_view() and merge() instead.
│ │ │ +
Deprecated:
This function is a combination of the get_view() function and merge() in that it selects a subset of constraints from another constraints object that is then merged into the current one. But the current function does not deal well with index sets. Furthermore, it simply discards parts of constraints that constrain one degree of freedom against ones that are not selected in the filter – something that should probably be considered a bug. Use get_view() and merge() instead.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ add_constraint()

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classBlockSparsityPatternBase.html │ │ │ @@ -299,15 +299,15 @@ │ │ │ │ │ │

Detailed Description

│ │ │
template<typename SparsityPatternType>
│ │ │ class BlockSparsityPatternBase< SparsityPatternType >

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 block(row,col) function.

│ │ │

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 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.

│ │ │

You will in general not want to use this class, but one of the derived classes.

│ │ │ -
Todo:
Handle optimization of diagonal elements of the underlying SparsityPattern correctly.
│ │ │ +
Todo:
Handle optimization of diagonal elements of the underlying SparsityPattern correctly.
│ │ │
See also
Block (linear algebra)
│ │ │ │ │ │

Definition at line 79 of file block_sparsity_pattern.h.

│ │ │

Member Typedef Documentation

│ │ │ │ │ │

◆ size_type

│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classDataOutFaces.html │ │ │ @@ -325,15 +325,15 @@ │ │ │ class DataOutFaces< dim, spacedim >

This class generates output from faces of a triangulation. It might be used to generate output only for the surface of the triangulation (this is the default of this class), or for all faces of active cells, as specified in the constructor. The output of this class is a set of patches (as defined by the class DataOutBase::Patch()), one for each face for which output is to be generated. These patches can then be written in several graphical data formats by the functions of the underlying classes.

│ │ │

Interface

│ │ │

The interface of this class is copied from the DataOut class. Furthermore, they share the common parent class DataOut_DoFData. See the reference of these two classes for a discussion of the interface.

│ │ │

Extending this class

│ │ │

The sequence of faces to generate patches from is generated in the same way as in the DataOut class; see there for a description of the respective interface. The functions generating the sequence of faces which shall be used to generate output, are called first_face() and next_face().

│ │ │

Since we need to initialize objects of type FEValues with the faces generated from these functions, it is not sufficient that they only return face iterators. Rather, we need a pair of cell and the number of the face, as the values of finite element fields need not necessarily be unique on a face (think of discontinuous finite elements, where the value of the finite element field depend on the direction from which you approach a face, thus it is necessary to use a pair of cell and face, rather than only a face iterator). Therefore, this class defines an alias which creates a type FaceDescriptor that is an abbreviation for a pair of cell iterator and face number. The functions first_face and next_face operate on objects of this type.

│ │ │

Extending this class might, for example, be useful if you only want output from certain portions of the boundary, e.g. as indicated by the boundary indicator of the respective faces. However, it is also conceivable that one generates patches not from boundary faces, but from interior faces that are selected due to other criteria; one application might be to use only those faces where one component of the solution attains a certain value, in order to display the values of other solution components on these faces. Other applications certainly exist, for which the author is not imaginative enough.

│ │ │ -
Todo:
Reimplement this whole class using actual FEFaceValues and MeshWorker.
│ │ │ +
Todo:
Reimplement this whole class using actual FEFaceValues and MeshWorker.
│ │ │ │ │ │

Definition at line 108 of file data_out_faces.h.

│ │ │

Member Typedef Documentation

│ │ │ │ │ │

◆ cell_iterator

│ │ │ │ │ │
│ │ │ @@ -536,15 +536,15 @@ │ │ │ │ │ │ virtual │ │ │ │ │ │ │ │ │
│ │ │

Same as above, except that the additional first parameter defines a mapping that is to be used in the generation of output. If n_subdivisions>1, the points interior of subdivided patches which originate from cells at the boundary of the domain can be computed using the mapping, i.e. a higher order mapping leads to a representation of a curved boundary by using more subdivisions.

│ │ │

Even for non-curved cells the mapping argument can be used for the Eulerian mappings (see class MappingQ1Eulerian) where a mapping is used not only to determine the position of points interior to a cell, but also of the vertices. It offers an opportunity to watch the solution on a deformed triangulation on which the computation was actually carried out, even if the mesh is internally stored in its undeformed configuration and the deformation is only tracked by an additional vector that holds the deformation of each vertex.

│ │ │ -
Todo:
The mapping argument should be replaced by a hp::MappingCollection in case of a DoFHandler with hp-capabilities.
│ │ │ +
Todo:
The mapping argument should be replaced by a hp::MappingCollection in case of a DoFHandler with hp-capabilities.
│ │ │ │ │ │

Definition at line 345 of file data_out_faces.cc.

│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ first_face()

│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFEFaceEvaluation.html │ │ │ @@ -1371,15 +1371,15 @@ │ │ │ │ │ │ │ │ │ ) │ │ │ │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Please use the integrate_scatter() function with the EvaluationFlags argument.
│ │ │ +
Deprecated:
Please use the integrate_scatter() function with the EvaluationFlags argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ dof_indices()

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFEFacePointEvaluation.html │ │ │ @@ -8697,15 +8697,15 @@ │ │ │ 00021f80: 6261 3664 3763 3239 3031 3633 3934 6362 ba6d7c29016394cb │ │ │ 00021f90: 3922 3e72 6569 6e69 7428 293c 2f61 3e2e 9">reinit(). │ │ │ 00021fa0: 3c2f 703e 0a3c 646c 2063 6c61 7373 3d22

.
│ │ │ 00021fc0: 3c62 3e3c 6120 636c 6173 733d 2265 6c22 Deprec │ │ │ +00021ff0: 6564 3030 3031 3036 223e 4465 7072 6563 ed000106">Deprec │ │ │ 00022000: 6174 6564 3a3c 2f61 3e3c 2f62 3e3c 2f64 ated:
Use the fu │ │ │ 00022020: 6e63 7469 6f6e 203c 6120 636c 6173 733d nction │ │ │

The same as above.

│ │ │ -
Deprecated:
Use the average_of_gradients() function instead.
│ │ │ +
Deprecated:
Use the average_of_gradients() function instead.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ jump_in_hessians()

│ │ │ │ │ │
│ │ │ @@ -638,15 +638,15 @@ │ │ │ │ │ │ ) │ │ │ const │ │ │ │ │ │ │ │ │
│ │ │

The same as above.

│ │ │ -
Deprecated:
Use the average_of_hessians() function instead.
│ │ │ +
Deprecated:
Use the average_of_hessians() function instead.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ jump_in_third_derivatives()

│ │ │ │ │ │
│ │ │ @@ -811,15 +811,15 @@ │ │ │ │ │ │ ) │ │ │ const │ │ │ │ │ │ │ │ │
│ │ │

The same as above.

│ │ │ -
Deprecated:
Use the average_of_hessians() function instead.
│ │ │ +
Deprecated:
Use the average_of_hessians() function instead.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ get_function_values()

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFEPointEvaluation.html │ │ │ @@ -10245,15 +10245,15 @@ │ │ │ 00028040: 3839 3039 6337 3138 6133 3832 223e 7265 8909c718a382">re │ │ │ 00028050: 696e 6974 2829 3c2f 613e 2e3c 2f70 3e0a init().

. │ │ │ 00028060: 3c64 6c20 636c 6173 733d 2264 6570 7265
Deprecated: │ │ │ +000280b0: 3130 3622 3e44 6570 7265 6361 7465 643a 106">Deprecated: │ │ │ 000280c0: 3c2f 613e 3c2f 623e 3c2f 6474 3e3c 6464
Use the functio │ │ │ 000280e0: 6e20 3c61 2063 6c61 7373 3d22 656c 2220 n
│ │ │ 00015ee0: 3c62 3e3c 6120 636c 6173 733d 2265 6c22 Deprec │ │ │ +00015f10: 6564 3030 3031 3036 223e 4465 7072 6563 ed000106">Deprec │ │ │ 00015f20: 6174 6564 3a3c 2f61 3e3c 2f62 3e3c 2f64 ated:
Use the fu │ │ │ 00015f40: 6e63 7469 6f6e 203c 6120 636c 6173 733d nction

Detailed Description

│ │ │
template<int dim>
│ │ │ class FE_ABF< dim >

Implementation of Arnold-Boffi-Falk (ABF) elements, conforming with the space Hdiv. These elements generate vector fields with normal components continuous between mesh cells.

│ │ │

These elements are based on an article from Arnold, Boffi and Falk: Quadrilateral H(div) finite elements, SIAM J. Numer. Anal. Vol.42, No.6, pp.2429-2451

│ │ │

In this article, the authors demonstrate that the usual RT elements and also BDM and other proposed finite dimensional subspaces of H(div) do not work properly on arbitrary FE grids. I.e. the convergence rates deteriorate on these meshes. As a solution the authors propose the ABF elements, which are implemented in this class.

│ │ │

This class is not implemented for the codimension one case (spacedim != dim).

│ │ │ -
Todo:
Even if this element is implemented for two and three space dimensions, the definition of the node values relies on consistently oriented faces in 3d. Therefore, care should be taken on complicated meshes.
│ │ │ +
Todo:
Even if this element is implemented for two and three space dimensions, the definition of the node values relies on consistently oriented faces in 3d. Therefore, care should be taken on complicated meshes.
│ │ │

Interpolation

│ │ │

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:

│ │ │

Node values on edges/faces

│ │ │

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.

│ │ │

Interior node values

│ │ │

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).

│ │ │

Generalized support points

│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFE__BDM.html │ │ │ @@ -595,16 +595,16 @@ │ │ │ static std::mutex mutex │ │ │   │ │ │ │ │ │

Detailed Description

│ │ │
template<int dim>
│ │ │ class FE_BDM< dim >

The Brezzi-Douglas-Marini element.

│ │ │

Degrees of freedom

│ │ │ -
Todo:
The 3d version exhibits some numerical instabilities, in particular for higher order
│ │ │ -
Todo:
Restriction matrices are missing.
│ │ │ +
Todo:
The 3d version exhibits some numerical instabilities, in particular for higher order
│ │ │ +
Todo:
Restriction matrices are missing.
│ │ │

The matching pressure space for FE_BDM of order k is the element FE_DGP of order k-1.

│ │ │

The BDM element of order 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.

│ │ │

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 58 of file fe_bdm.h.

│ │ │

Member Typedef Documentation

│ │ │ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFE__Nedelec.html │ │ │ @@ -9075,15 +9075,15 @@ │ │ │ 00023720: 2074 6865 2063 6f64 696d 656e 7369 6f6e the codimension │ │ │ 00023730: 206f 6e65 2063 6173 6520 283c 636f 6465 one case (spacedim != dim │ │ │ 00023750: 3c2f 636f 6465 3e29 2e3c 2f70 3e0a 3c64 ).

.< │ │ │ 00023770: 6474 3e3c 623e 3c61 2063 6c61 7373 3d22 dt>Todo:
Even if t │ │ │ 000237c0: 6869 7320 656c 656d 656e 7420 6973 2069 his element is i │ │ │ 000237d0: 6d70 6c65 6d65 6e74 6564 2066 6f72 2074 mplemented for t │ │ │ 000237e0: 776f 2061 6e64 2074 6872 6565 2073 7061 wo and three spa │ │ │ 000237f0: 6365 2064 696d 656e 7369 6f6e 732c 2074 ce dimensions, t │ │ │ 00023800: 6865 2064 6566 696e 6974 696f 6e20 6f66 he definition of │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFE__Poly.html │ │ │ @@ -658,15 +658,15 @@ │ │ │
Tensor<order,dim> compute_derivative (const unsigned int i,
│ │ │
const Point<dim> &p) const;
│ │ │
static constexpr unsigned int dimension
Definition fe_data.h:301
│ │ │
Definition point.h:111
│ │ │ │ │ │

Example classes are TensorProductPolynomials, PolynomialSpace or PolynomialsP.

│ │ │

This class is not a fully implemented FiniteElement class. Instead there are several pure virtual functions declared in the FiniteElement and FiniteElement classes which cannot be implemented by this class but are left for implementation in derived classes.

│ │ │ -
Todo:
Since nearly all functions for spacedim != dim are specialized, this class needs cleaning up.
│ │ │ +
Todo:
Since nearly all functions for spacedim != dim are specialized, this class needs cleaning up.
│ │ │ │ │ │

Definition at line 75 of file fe_poly.h.

│ │ │

Member Typedef Documentation

│ │ │ │ │ │

◆ map_value_type

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classFE__RT__Bubbles.html │ │ │ @@ -609,15 +609,15 @@ │ │ │ │ │ │
│ │ │

│ │ │ │ │ │ │ │ │ Left - \(2d,\,k=3\), right - \(3d,\,k=2\). │ │ │ │ │ │ -
Todo:
Implement restriction matrices
│ │ │ +
Todo:
Implement restriction matrices
│ │ │ │ │ │

Definition at line 87 of file fe_rt_bubbles.h.

│ │ │

Member Typedef Documentation

│ │ │ │ │ │

◆ map_value_type

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverBase.html │ │ │ @@ -597,15 +597,15 @@ │ │ │ │ │ │ │ │ │ private │ │ │ │ │ │ │ │ │
│ │ │

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.

│ │ │ -
Todo:
Templatize based on Matrix type.
│ │ │ +
Todo:
Templatize based on Matrix type.
│ │ │ │ │ │

Definition at line 195 of file ginkgo_solver.h.

│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ exec_type

│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverBicgstab.html │ │ │ @@ -663,15 +663,15 @@ │ │ │ │ │ │ │ │ │ privateinherited │ │ │ │ │ │ │ │ │
│ │ │

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.

│ │ │ -
Todo:
Templatize based on Matrix type.
│ │ │ +
Todo:
Templatize based on Matrix type.
│ │ │ │ │ │

Definition at line 195 of file ginkgo_solver.h.

│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ exec_type

│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverCG.html │ │ │ @@ -663,15 +663,15 @@ │ │ │ │ │ │ │ │ │ privateinherited │ │ │ │ │ │ │ │ │
│ │ │

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.

│ │ │ -
Todo:
Templatize based on Matrix type.
│ │ │ +
Todo:
Templatize based on Matrix type.
│ │ │ │ │ │

Definition at line 195 of file ginkgo_solver.h.

│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ exec_type

│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverCGS.html │ │ │ @@ -664,15 +664,15 @@ │ │ │ │ │ │ │ │ │ privateinherited │ │ │ │ │ │ │ │ │
│ │ │

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.

│ │ │ -
Todo:
Templatize based on Matrix type.
│ │ │ +
Todo:
Templatize based on Matrix type.
│ │ │ │ │ │

Definition at line 195 of file ginkgo_solver.h.

│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ exec_type

│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverFCG.html │ │ │ @@ -666,15 +666,15 @@ │ │ │ │ │ │ │ │ │ privateinherited │ │ │ │ │ │ │ │ │
│ │ │

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.

│ │ │ -
Todo:
Templatize based on Matrix type.
│ │ │ +
Todo:
Templatize based on Matrix type.
│ │ │ │ │ │

Definition at line 195 of file ginkgo_solver.h.

│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ exec_type

│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverGMRES.html │ │ │ @@ -663,15 +663,15 @@ │ │ │ │ │ │ │ │ │ privateinherited │ │ │ │ │ │ │ │ │
│ │ │

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.

│ │ │ -
Todo:
Templatize based on Matrix type.
│ │ │ +
Todo:
Templatize based on Matrix type.
│ │ │ │ │ │

Definition at line 195 of file ginkgo_solver.h.

│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ exec_type

│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classGinkgoWrappers_1_1SolverIR.html │ │ │ @@ -664,15 +664,15 @@ │ │ │ │ │ │ │ │ │ privateinherited │ │ │ │ │ │ │ │ │
│ │ │

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.

│ │ │ -
Todo:
Templatize based on Matrix type.
│ │ │ +
Todo:
Templatize based on Matrix type.
│ │ │ │ │ │

Definition at line 195 of file ginkgo_solver.h.

│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ exec_type

│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMGTransferBase.html │ │ │ @@ -217,15 +217,15 @@ │ │ │ │ │ │

Detailed Description

│ │ │
template<typename VectorType>
│ │ │ class MGTransferBase< VectorType >

Base class used to declare the operations needed by a concrete class implementing prolongation and restriction of vectors in the multigrid context. This class is abstract and has no implementation of these operations.

│ │ │

There are several derived classes, reflecting the fact that vector types and numbering of the fine-grid discretization and of the multi-level implementation are independent.

│ │ │

If you use multigrid for a single PDE or for your complete system of equations, you will use MGTransferPrebuilt together with Multigrid. The vector types used on the fine grid as well as for the multilevel operations may be Vector or BlockVector. In both cases, MGTransferPrebuilt will operate on all components of the solution.

│ │ │
Note
For the following, it is important to realize the difference between a solution component and a solution block. The distinction only applies if vector valued elements are used, but is quite important then. This is reflected in the fact that it is not possible right now to use transfer classes based on MGTransferComponentBase for genuine vector valued elements, but descendants of MGTransferBlockBase would have to be applied. In the following text, we will use the term block, but remark that it might refer to components as well.
│ │ │ -
Todo:
update the following documentation, since it does not reflect the latest changes in structure.
│ │ │ +
Todo:
update the following documentation, since it does not reflect the latest changes in structure.
│ │ │

For mixed systems, it may be required to do multigrid only for a single component or for some components. The classes MGTransferSelect and MGTransferBlock handle these cases.

│ │ │

MGTransferSelect is used if you use multigrid (on Vector objects) for a single component, possibly grouped using mg_target_component.

│ │ │

The class MGTransferBlock handles the case where your multigrid method operates on BlockVector objects. These can contain all or a consecutive set of the blocks of the complete system. Since most smoothers cannot operate on block structures, it is not clear whether this case is really useful. Therefore, a tested implementation of this case will be supplied when needed.

│ │ │ │ │ │

Definition at line 171 of file mg_base.h.

│ │ │

Member Typedef Documentation

│ │ │ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMapping.html │ │ │ @@ -330,15 +330,15 @@ │ │ │ \sum_{q} │ │ │ \hat u(\hat{\mathbf x}_q) │ │ │ \underbrace{\left|\text{det}J(\hat{\mathbf x}_q)\right| w_q}_{=: │ │ │ \text{JxW}_q}. │ │ │ \] │ │ │

│ │ │

Here, the weights \(\text{JxW}_q\) of each quadrature point (where JxW mnemonically stands for Jacobian times Quadrature Weights) take the role of the \(dx\) in the original integral. Consequently, they appear in all code that computes integrals approximated by quadrature, and are accessed by FEValues::JxW().

│ │ │ -
Todo:
Document what happens in the codimension-1 case.
│ │ │ +
Todo:
Document what happens in the codimension-1 case.
│ │ │

Mapping of vector fields, differential forms and gradients of vector fields

│ │ │

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 │ │ │ @@ -1072,15 +1072,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtual │ │ │ │ │ │ │ │ │

│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ get_subface_data()

│ │ │ │ │ │
│ │ │ @@ -1326,15 +1326,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtual │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ fill_fe_subface_values()

│ │ │ │ │ │
│ │ │ @@ -1720,15 +1720,15 @@ │ │ │ \frac{1}{\text{det}\;J(\hat{\mathbf x})} │ │ │ J(\hat{\mathbf x}) \hat{\mathbf T}(\hat{\mathbf x}) │ │ │ J(\hat{\mathbf x})^{-1}. │ │ │ \] │ │ │

│ │ │ │ │ │ │ │ │ -
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │ +
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │
Parameters
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
[in]inputAn array (or part of an array) of input objects that should be mapped.
[in]kindThe kind of mapping to be applied.
[in]internalA 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]outputAn 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.)
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingC1.html │ │ │ @@ -1171,15 +1171,15 @@ │ │ │ \frac{1}{\text{det}\;J(\hat{\mathbf x})} │ │ │ J(\hat{\mathbf x}) \hat{\mathbf T}(\hat{\mathbf x}) │ │ │ J(\hat{\mathbf x})^{-1}. │ │ │ \] │ │ │

│ │ │ │ │ │ │ │ │ -
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │ +
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │
Parameters
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
[in]inputAn array (or part of an array) of input objects that should be mapped.
[in]kindThe kind of mapping to be applied.
[in]internalA 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]outputAn 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.)
│ │ │ @@ -1680,15 +1680,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ get_subface_data()

│ │ │ │ │ │
│ │ │ @@ -1942,15 +1942,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ fill_fe_subface_values()

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingCartesian.html │ │ │ @@ -864,15 +864,15 @@ │ │ │ \frac{1}{\text{det}\;J(\hat{\mathbf x})} │ │ │ J(\hat{\mathbf x}) \hat{\mathbf T}(\hat{\mathbf x}) │ │ │ J(\hat{\mathbf x})^{-1}. │ │ │ \] │ │ │

│ │ │ │ │ │ │ │ │ -
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │ +
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │
Parameters
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
[in]inputAn array (or part of an array) of input objects that should be mapped.
[in]kindThe kind of mapping to be applied.
[in]internalA 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]outputAn 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.)
│ │ │ @@ -2279,15 +2279,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ fill_fe_face_values() [2/2]

│ │ │ │ │ │
│ │ │ @@ -2336,15 +2336,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ subscribe()

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingFE.html │ │ │ @@ -906,15 +906,15 @@ │ │ │ \frac{1}{\text{det}\;J(\hat{\mathbf x})} │ │ │ J(\hat{\mathbf x}) \hat{\mathbf T}(\hat{\mathbf x}) │ │ │ J(\hat{\mathbf x})^{-1}. │ │ │ \] │ │ │

│ │ │ │ │ │ │ │ │ -
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │ +
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │
Parameters
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
[in]inputAn array (or part of an array) of input objects that should be mapped.
[in]kindThe kind of mapping to be applied.
[in]internalA 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]outputAn 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.)
│ │ │ @@ -1817,15 +1817,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ fill_fe_face_values() [2/2]

│ │ │ │ │ │
│ │ │ @@ -1874,15 +1874,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ fill_fe_immersed_surface_values()

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingFEField.html │ │ │ @@ -1015,15 +1015,15 @@ │ │ │ \frac{1}{\text{det}\;J(\hat{\mathbf x})} │ │ │ J(\hat{\mathbf x}) \hat{\mathbf T}(\hat{\mathbf x}) │ │ │ J(\hat{\mathbf x})^{-1}. │ │ │ \] │ │ │

│ │ │ │ │ │ │ │ │ -
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │ +
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │
Parameters
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
[in]inputAn array (or part of an array) of input objects that should be mapped.
[in]kindThe kind of mapping to be applied.
[in]internalA 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]outputAn 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.)
│ │ │ @@ -2170,15 +2170,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ fill_fe_face_values() [2/2]

│ │ │ │ │ │
│ │ │ @@ -2227,15 +2227,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ subscribe()

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingManifold.html │ │ │ @@ -821,15 +821,15 @@ │ │ │ \frac{1}{\text{det}\;J(\hat{\mathbf x})} │ │ │ J(\hat{\mathbf x}) \hat{\mathbf T}(\hat{\mathbf x}) │ │ │ J(\hat{\mathbf x})^{-1}. │ │ │ \] │ │ │

│ │ │ │ │ │ │ │ │ -
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │ +
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │
Parameters
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
[in]inputAn array (or part of an array) of input objects that should be mapped.
[in]kindThe kind of mapping to be applied.
[in]internalA 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]outputAn 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.)
│ │ │ @@ -1740,15 +1740,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ fill_fe_face_values() [2/2]

│ │ │ │ │ │
│ │ │ @@ -1797,15 +1797,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ fill_fe_immersed_surface_values()

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingQ.html │ │ │ @@ -1039,15 +1039,15 @@ │ │ │ \frac{1}{\text{det}\;J(\hat{\mathbf x})} │ │ │ J(\hat{\mathbf x}) \hat{\mathbf T}(\hat{\mathbf x}) │ │ │ J(\hat{\mathbf x})^{-1}. │ │ │ \] │ │ │

│ │ │ │ │ │ │ │ │ -
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │ +
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │
Parameters
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
[in]inputAn array (or part of an array) of input objects that should be mapped.
[in]kindThe kind of mapping to be applied.
[in]internalA 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]outputAn 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.)
│ │ │ @@ -2556,15 +2556,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ fill_fe_face_values() [2/2]

│ │ │ │ │ │
│ │ │ @@ -2613,15 +2613,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ subscribe()

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingQ1.html │ │ │ @@ -960,15 +960,15 @@ │ │ │ \frac{1}{\text{det}\;J(\hat{\mathbf x})} │ │ │ J(\hat{\mathbf x}) \hat{\mathbf T}(\hat{\mathbf x}) │ │ │ J(\hat{\mathbf x})^{-1}. │ │ │ \] │ │ │

│ │ │ │ │ │ │ │ │ -
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │ +
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │
Parameters
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
[in]inputAn array (or part of an array) of input objects that should be mapped.
[in]kindThe kind of mapping to be applied.
[in]internalA 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]outputAn 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.)
│ │ │ @@ -1469,15 +1469,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ get_subface_data()

│ │ │ │ │ │
│ │ │ @@ -1731,15 +1731,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ fill_fe_subface_values()

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingQ1Eulerian.html │ │ │ @@ -1123,15 +1123,15 @@ │ │ │ \frac{1}{\text{det}\;J(\hat{\mathbf x})} │ │ │ J(\hat{\mathbf x}) \hat{\mathbf T}(\hat{\mathbf x}) │ │ │ J(\hat{\mathbf x})^{-1}. │ │ │ \] │ │ │

│ │ │ │ │ │ │ │ │ -
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │ +
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │
Parameters
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
[in]inputAn array (or part of an array) of input objects that should be mapped.
[in]kindThe kind of mapping to be applied.
[in]internalA 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]outputAn 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.)
│ │ │ @@ -1632,15 +1632,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ get_subface_data()

│ │ │ │ │ │
│ │ │ @@ -1812,15 +1812,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ fill_fe_subface_values()

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingQCache.html │ │ │ @@ -1395,15 +1395,15 @@ │ │ │ \frac{1}{\text{det}\;J(\hat{\mathbf x})} │ │ │ J(\hat{\mathbf x}) \hat{\mathbf T}(\hat{\mathbf x}) │ │ │ J(\hat{\mathbf x})^{-1}. │ │ │ \] │ │ │

│ │ │ │ │ │ │ │ │ -
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │ +
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │
Parameters
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
[in]inputAn array (or part of an array) of input objects that should be mapped.
[in]kindThe kind of mapping to be applied.
[in]internalA 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]outputAn 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.)
│ │ │ @@ -1904,15 +1904,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ get_subface_data()

│ │ │ │ │ │
│ │ │ @@ -2166,15 +2166,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ fill_fe_subface_values()

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMappingQEulerian.html │ │ │ @@ -1153,15 +1153,15 @@ │ │ │ \frac{1}{\text{det}\;J(\hat{\mathbf x})} │ │ │ J(\hat{\mathbf x}) \hat{\mathbf T}(\hat{\mathbf x}) │ │ │ J(\hat{\mathbf x})^{-1}. │ │ │ \] │ │ │

│ │ │ │ │ │ │ │ │ -
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │ +
Todo:
The formulas for mapping_covariant_gradient, mapping_contravariant_gradient and mapping_piola_gradient are only true as stated for linear mappings. If, for example, the mapping is bilinear (or has a higher order polynomial degree) then there is a missing term associated with the derivative of \(J\).
│ │ │
Parameters
│ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
[in]inputAn array (or part of an array) of input objects that should be mapped.
[in]kindThe kind of mapping to be applied.
[in]internalA 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]outputAn 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.)
│ │ │ @@ -1662,15 +1662,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ get_subface_data()

│ │ │ │ │ │
│ │ │ @@ -1842,15 +1842,15 @@ │ │ │ │ │ │ │ │ │ │ │ │ protectedvirtualinherited │ │ │ │ │ │ │ │ │
│ │ │ -
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ +
Deprecated:
Use the version taking a hp::QCollection argument.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ fill_fe_subface_values()

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMatrixBlock.html │ │ │ @@ -271,15 +271,15 @@ │ │ │
MatrixType & matrix(size_type i)
│ │ │
MatrixType matrix
│ │ │
size_type row
│ │ │
size_type column
│ │ │ │ │ │

Here, we have not gained very much, except that we do not need to set up empty blocks in the block system.

│ │ │
Note
This class expects, that the row and column BlockIndices objects for the system are equal. If they are not, some functions will throw ExcNotImplemented.
│ │ │ -
Todo:
Example for the product preconditioner of the pressure Schur complement.
│ │ │ +
Todo:
Example for the product preconditioner of the pressure Schur complement.
│ │ │
See also
Block (linear algebra)
│ │ │ │ │ │

Definition at line 110 of file matrix_block.h.

│ │ │

Member Typedef Documentation

│ │ │ │ │ │

◆ size_type

│ │ │ │ │ │ @@ -676,15 +676,15 @@ │ │ │ │ │ │ │ │ │ inline │ │ │ │ │ │ │ │ │
│ │ │

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.

│ │ │ -
Todo:
elide_zero_values is currently ignored.
│ │ │ +
Todo:
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 757 of file matrix_block.h.

│ │ │ │ │ │
│ │ │ │ │ │ │ │ │ @@ -733,15 +733,15 @@ │ │ │ │ │ │ │ │ │ inline │ │ │ │ │ │ │ │ │
│ │ │

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.

│ │ │ -
Todo:
elide_zero_values is currently ignored.
│ │ │ +
Todo:
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 695 of file matrix_block.h.

│ │ │ │ │ │
│ │ │ │ │ │ │ │ │ @@ -790,15 +790,15 @@ │ │ │ │ │ │ │ │ │ inline │ │ │ │ │ │ │ │ │
│ │ │

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.

│ │ │ -
Todo:
elide_zero_values is currently ignored.
│ │ │ +
Todo:
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 780 of file matrix_block.h.

│ │ │ │ │ │
│ │ │ │ │ │ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1Assembler_1_1ResidualLocalBlocksToGlobalBlocks.html │ │ │ @@ -139,15 +139,15 @@ │ │ │ │ │ │

Detailed Description

│ │ │
template<typename VectorType>
│ │ │ class MeshWorker::Assembler::ResidualLocalBlocksToGlobalBlocks< VectorType >

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.

│ │ │ -
Todo:
Comprehensive model currently not implemented.
│ │ │ +
Todo:
Comprehensive model currently not implemented.
│ │ │ │ │ │

Definition at line 110 of file assembler.h.

│ │ │

Member Function Documentation

│ │ │ │ │ │

◆ initialize() [1/2]

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classMeshWorker_1_1LocalIntegrator.html │ │ │ @@ -204,15 +204,15 @@ │ │ │   │ │ │ │ │ │

Detailed Description

│ │ │
template<int dim, int spacedim = dim, typename number = double>
│ │ │ class MeshWorker::LocalIntegrator< dim, spacedim, number >

A local integrator object, which can be used to simplify the call of loop(). Instead of providing the three local integration functions separately, we bundle them as virtual functions in this class.

│ │ │

Additionally, since we cannot have a virtual null function, we provide flags, which allow us to indicate, whether we want to integrate on boundary and interior faces. These flags are true by default, but can be modified by applications to speed up the loop.

│ │ │

If a function is not overloaded in a derived class, but its usage flag is true, the function will cause an exception ExcPureFunction.

│ │ │ -
Deprecated:
This class is deprecated. It used to be the basis for integration via the MeshWorker::integration_loop() function, but the same functionality is available via MeshWorker::loop().
│ │ │ +
Deprecated:
This class is deprecated. It used to be the basis for integration via the MeshWorker::integration_loop() function, but the same functionality is available via MeshWorker::loop().
│ │ │ │ │ │

Definition at line 59 of file local_integrator.h.

│ │ │

Member Typedef Documentation

│ │ │ │ │ │

◆ map_value_type

│ │ │ │ │ │
│ │ │ @@ -796,15 +796,15 @@ │ │ │ │ │ │ std::vector<std::string> MeshWorker::LocalIntegrator< dim, spacedim, number >::input_vector_names │ │ │ │ │ │ │ │ │
│ │ │

The names of the input vectors. If this vector is nonempty, it can be used by application programs to automatically select and verify the input vectors used for integration.

│ │ │
Note
This variable is currently not used by the library, but it is provided to help develop application programs.
│ │ │ -
Deprecated:
Because the library itself does not use this field, it is better placed in derived classes.
│ │ │ +
Deprecated:
Because the library itself does not use this field, it is better placed in derived classes.
│ │ │ │ │ │

Definition at line 132 of file local_integrator.h.

│ │ │ │ │ │
│ │ │
│ │ │ │ │ │

◆ output_names

│ │ │ @@ -817,15 +817,15 @@ │ │ │ │ │ │ std::vector<std::string> MeshWorker::LocalIntegrator< dim, spacedim, number >::output_names │ │ │ │ │ │ │ │ │
│ │ │

The names of the results produced. If this vector is nonempty, it can be used by application programs to automatically assign names to output values and/or verify the names of vectors.

│ │ │
Note
This variable is currently not used by the library, but it is provided to help develop application programs.
│ │ │ -
Deprecated:
Because the library itself does not use this field, it is better placed in derived classes.
│ │ │ +
Deprecated:
Because the library itself does not use this field, it is better placed in derived classes.
│ │ │ │ │ │

Definition at line 146 of file local_integrator.h.

│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ counter

│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPathSearch.html │ │ │ @@ -191,15 +191,15 @@ │ │ │
...
│ │ │
Definition path_search.h:83
│ │ │
│ │ │

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

std::string full_name = search.find("grid", ".inp");
│ │ │

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.

│ │ │
Note
Directories in the path list should always end with a trailing "/", while suffixes should always start with a dot. These characters are not added automatically (allowing you to do some real file name editing).
│ │ │ -
Deprecated:
Use the std::filesystem facilities instead.
│ │ │ +
Deprecated:
Use the std::filesystem facilities instead.
│ │ │ │ │ │

Definition at line 82 of file path_search.h.

│ │ │

Member Typedef Documentation

│ │ │ │ │ │

◆ map_type

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classPoint.html │ │ │ @@ -1649,15 +1649,15 @@ │ │ │ │ │ │ inherited │ │ │ │ │ │ │ │ │
│ │ │

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.

│ │ │ -
Deprecated:
Use the more general function that takes a pair of iterators instead.
│ │ │ +
Deprecated:
Use the more general function that takes a pair of iterators instead.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ unroll() [2/2]

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classSUNDIALS_1_1KINSOL.html │ │ │ @@ -523,16 +523,16 @@ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │
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#2664, │ │ │ -which are diagonal elements of the scaling matrix such that \_form#2680 has │ │ │ +

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#2623, │ │ │ +which are diagonal elements of the scaling matrix such that \_form#2670 has │ │ │ all components roughly the same magnitude when \_form#304 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.

│ │ │
Note
This variable represents a user provided callback. See there for a description of how to deal with errors and other requirements and conventions. In particular, KINSOL can deal with "recoverable" errors in some circumstances, so callbacks can throw exceptions of type RecoverableUserCallbackError.
│ │ │ │ │ │

Definition at line 651 of file kinsol.h.

│ │ │ ├── html2text {} │ │ │ │ @@ -367,16 +367,16 @@ │ │ │ │ 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 _K_I_N_S_O_L manual states this as follows: "The user should supply values │ │ │ │ -\_form#2664, which are diagonal elements of the scaling matrix such that │ │ │ │ -\_form#2680 has all components roughly the same magnitude when \_form#304 is │ │ │ │ +\_form#2623, which are diagonal elements of the scaling matrix such that │ │ │ │ +\_form#2670 has all components roughly the same magnitude when \_form#304 is │ │ │ │ close to a solution". │ │ │ │ If no function is provided to a _K_I_N_S_O_L object, then this is interpreted as │ │ │ │ implicitly saying that all of these scaling factors should be considered as │ │ │ │ one. │ │ │ │ Note │ │ │ │ This variable represents a _u_s_e_r_ _p_r_o_v_i_d_e_d_ _c_a_l_l_b_a_c_k. See there for a │ │ │ │ description of how to deal with errors and other requirements and │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classSymmetricTensor.html │ │ │ @@ -592,15 +592,15 @@ │ │ │ ( │ │ │ ) │ │ │ │ │ │ │ │ │ │ │ │
│ │ │

Return a pointer to the first element of the underlying storage.

│ │ │ -
Deprecated:
This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │ +
Deprecated:
This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ begin_raw() [2/2]

│ │ │ │ │ │
│ │ │ @@ -613,15 +613,15 @@ │ │ │ ( │ │ │ ) │ │ │ const │ │ │ │ │ │ │ │ │
│ │ │

Return a const pointer to the first element of the underlying storage.

│ │ │ -
Deprecated:
This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │ +
Deprecated:
This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ end_raw() [1/2]

│ │ │ │ │ │
│ │ │ @@ -634,15 +634,15 @@ │ │ │ ( │ │ │ ) │ │ │ │ │ │ │ │ │ │ │ │
│ │ │

Return a pointer to the element past the end of the underlying storage.

│ │ │ -
Deprecated:
This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │ +
Deprecated:
This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ end_raw() [2/2]

│ │ │ │ │ │
│ │ │ @@ -655,15 +655,15 @@ │ │ │ ( │ │ │ ) │ │ │ const │ │ │ │ │ │ │ │ │
│ │ │

Return a const pointer to the element past the end of the underlying storage.

│ │ │ -
Deprecated:
This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │ +
Deprecated:
This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ operator=() [1/2]

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classTensor.html │ │ │ @@ -1210,15 +1210,15 @@ │ │ │ result) │ │ │ const │ │ │ │ │ │ │ │ │
│ │ │

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.

│ │ │ -
Deprecated:
Use the more general function that takes a pair of iterators instead.
│ │ │ +
Deprecated:
Use the more general function that takes a pair of iterators instead.
│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ unroll() [2/2]

│ │ │ │ │ │
│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classUtilities_1_1MPI_1_1RemotePointEvaluation.html │ │ │ @@ -293,15 +293,15 @@ │ │ │ toleranceTolerance in terms of unit cell coordinates for determining all cells around a point passed to the class during reinit(). Depending on the problem, it might be necessary to adjust the tolerance in order to be able to identify a cell. Floating point arithmetic implies that a point will, in general, not lie exactly on a vertex, edge, or face. │ │ │ enforce_unique_mappingEnforce unique mapping, i.e., (one-to-one) relation of points and cells. │ │ │ rtree_levelRTree level to be used during the construction of the bounding boxes. │ │ │ marked_verticesFunction that marks relevant vertices to make search of active cells around point more efficient. │ │ │ │ │ │ │ │ │ │ │ │ -
Deprecated:
│ │ │ +
Deprecated:
│ │ │ │ │ │

Definition at line 61 of file mpi_remote_point_evaluation.cc.

│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ ~RemotePointEvaluation()

│ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classXDMFEntry.html │ │ │ @@ -271,15 +271,15 @@ │ │ │ │ │ │ ) │ │ │ │ │ │ │ │ │ │ │ │
│ │ │

Deprecated constructor.

│ │ │ -
Deprecated:
Use the constructor that additionally takes a ReferenceCell.
│ │ │ +
Deprecated:
Use the constructor that additionally takes a ReferenceCell.
│ │ │ │ │ │

Definition at line 9399 of file data_out_base.cc.

│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ XDMFEntry() [4/7]

│ │ │ @@ -327,15 +327,15 @@ │ │ │ │ │ │ ) │ │ │ │ │ │ │ │ │ │ │ │
│ │ │

Deprecated constructor.

│ │ │ -
Deprecated:
Use the constructor that additionally takes a ReferenceCell.
│ │ │ +
Deprecated:
Use the constructor that additionally takes a ReferenceCell.
│ │ │ │ │ │

Definition at line 9418 of file data_out_base.cc.

│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ XDMFEntry() [5/7]

│ │ │ @@ -450,15 +450,15 @@ │ │ │ │ │ │ ) │ │ │ │ │ │ │ │ │ │ │ │
│ │ │

Deprecated constructor.

│ │ │ -
Deprecated:
Use the constructor that additionally takes a ReferenceCell.
│ │ │ +
Deprecated:
Use the constructor that additionally takes a ReferenceCell.
│ │ │ │ │ │

Definition at line 9455 of file data_out_base.cc.

│ │ │ │ │ │
│ │ │ │ │ │ │ │ │

◆ XDMFEntry() [7/7]

│ │ │ @@ -643,15 +643,15 @@ │ │ │ │ │ │ ) │ │ │ const │ │ │ │ │ │ │ │ │
│ │ │

Get the XDMF content associated with this entry. If the entry is not valid, this returns an empty string.

│ │ │ -
Deprecated:
Use the other function instead.
│ │ │ +
Deprecated:
Use the other function instead.
│ │ │ │ │ │

Definition at line 9555 of file data_out_base.cc.

│ │ │ │ │ │
│ │ │ │ │ │

Member Data Documentation

│ │ │ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classparallel_1_1distributed_1_1Triangulation.html │ │ │ @@ -2008,15 +2008,15 @@ │ │ │ │ │ │
│ │ │ │ │ │

│ │ │

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 so that the number of cells is balanced among all processes. Individual repartitioning with non-identical weights for each cell, 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().

│ │ │ -
Deprecated:
The autopartition parameter has been removed.
│ │ │ +
Deprecated:
The autopartition parameter has been removed.
│ │ │ │ │ │

Implements parallel::DistributedTriangulationBase< dim, spacedim >.

│ │ │ │ │ │

Definition at line 2209 of file tria.cc.

│ │ │ │ │ │
│ │ │ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/classparallel_1_1fullydistributed_1_1Triangulation.html │ │ │ @@ -1749,15 +1749,15 @@ │ │ │ │ │ │
│ │ │ │ │ │

│ │ │

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().

│ │ │ -
Deprecated:
The autopartition parameter has been removed.
│ │ │ +
Deprecated:
The autopartition parameter has been removed.
│ │ │ │ │ │

Implements parallel::DistributedTriangulationBase< dim, spacedim >.

│ │ │ │ │ │

Definition at line 741 of file fully_distributed_tria.cc.

│ │ │ │ │ │
│ │ │ │ │ ├── ./usr/share/doc/libdeal.ii-doc/html/doxygen/deal.II/deprecated.html │ │ │ @@ -93,151 +93,151 @@ │ │ │ │ │ │
│ │ │
Deprecated List
│ │ │
│ │ │
│ │ │
│ │ │
Member AffineConstraints< number >::add_selected_constraints (const AffineConstraints &constraints_in, const IndexSet &filter)
│ │ │ -
This function is a combination of the get_view() function and merge() in that it selects a subset of constraints from another constraints object that is then merged into the current one. But the current function does not deal well with index sets. Furthermore, it simply discards parts of constraints that constrain one degree of freedom against ones that are not selected in the filter – something that should probably be considered a bug. Use get_view() and merge() instead.
│ │ │ +
This function is a combination of the get_view() function and merge() in that it selects a subset of constraints from another constraints object that is then merged into the current one. But the current function does not deal well with index sets. Furthermore, it simply discards parts of constraints that constrain one degree of freedom against ones that are not selected in the filter – something that should probably be considered a bug. Use get_view() and merge() instead.
│ │ │
Member AffineConstraints< number >::AffineConstraints (const IndexSet &locally_stored_constraints)
│ │ │ -
This constructor is equivalent to calling the following one with both of its arguments equal to the index set provided here. This is not wrong, but inefficient. Use the following constructor instead.
│ │ │ +
This constructor is equivalent to calling the following one with both of its arguments equal to the index set provided here. This is not wrong, but inefficient. Use the following constructor instead.
│ │ │
Member AffineConstraints< number >::reinit (const IndexSet &locally_stored_constraints)
│ │ │ -
Use the reinit() function with two index set arguments instead.
│ │ │ +
Use the reinit() function with two index set arguments instead.
│ │ │
Member CELL_COARSEN
│ │ │ -
Use CellStatus::cell_will_be_coarsened instead
│ │ │ +
Use CellStatus::cell_will_be_coarsened instead
│ │ │
Member CELL_INVALID
│ │ │ -
Use CellStatus::cell_invalid instead
│ │ │ +
Use CellStatus::cell_invalid instead
│ │ │
Member CELL_PERSIST
│ │ │ -
Use CellStatus::cell_will_persist instead
│ │ │ +
Use CellStatus::cell_will_persist instead
│ │ │
Member CELL_REFINE
│ │ │ -
Use CellStatus::cell_will_be_refined instead
│ │ │ +
Use CellStatus::cell_will_be_refined instead
│ │ │
Member DataOutBase::default_suffix (const OutputFormat output_format)
│ │ │ -
Using Tecplot binary output is deprecated.
│ │ │ +
Using Tecplot binary output is deprecated.
│ │ │
Member DataOutBase::VtkFlags::ZlibCompressionLevel
│ │ │ -
Use DataOutBase::CompressionLevel instead.
│ │ │ +
Use DataOutBase::CompressionLevel instead.
│ │ │
Member DoFHandler< dim, spacedim >::active_fe_index_type
│ │ │
Use types::fe_index instead.
│ │ │
Member DoFHandler< dim, spacedim >::get_active_fe_indices (std::vector< unsigned int > &active_fe_indices) const
│ │ │
Use get_active_fe_indices() that returns the result vector.
│ │ │
Member DoFHandler< dim, spacedim >::invalid_active_fe_index
│ │ │
Use numbers::invalid_fe_index instead.
│ │ │
Member DoFHandler< dim, spacedim >::invalid_fe_index
│ │ │
Use numbers::invalid_fe_index instead.
│ │ │
Member DoFHandler< dim, spacedim >::set_active_fe_indices (const std::vector< unsigned int > &active_fe_indices)
│ │ │
Use set_active_fe_indices() with the types::fe_index datatype.
│ │ │
Member DoFTools::extract_locally_active_dofs (const DoFHandler< dim, spacedim > &dof_handler, IndexSet &dof_set)
│ │ │ -
Use the previous function instead.
│ │ │ +
Use the previous function instead.
│ │ │
Member DoFTools::extract_locally_active_level_dofs (const DoFHandler< dim, spacedim > &dof_handler, IndexSet &dof_set, const unsigned int level)
│ │ │ -
Use the previous function instead.
│ │ │ +
Use the previous function instead.
│ │ │
Member DoFTools::extract_locally_relevant_dofs (const DoFHandler< dim, spacedim > &dof_handler, IndexSet &dof_set)
│ │ │ -
Use the previous function instead.
│ │ │ +
Use the previous function instead.
│ │ │
Member DoFTools::extract_locally_relevant_level_dofs (const DoFHandler< dim, spacedim > &dof_handler, const unsigned int level, IndexSet &dof_set)
│ │ │ -
Use the previous function instead.
│ │ │ +
Use the previous function instead.
│ │ │
Member DoFTools::get_active_fe_indices (const DoFHandler< dim, spacedim > &dof_handler, std::vector< unsigned int > &active_fe_indices)
│ │ │ -
Use DoFHandler::get_active_fe_indices() that returns the result vector.
│ │ │ -
Member DoFTools::map_dofs_to_support_points (const hp::MappingCollection< dim, spacedim > &mapping, const DoFHandler< dim, spacedim > &dof_handler, std::map< types::global_dof_index, Point< spacedim > > &support_points, const ComponentMask &mask={})
│ │ │ -
Use the function that returns the std::map instead.
│ │ │ +
Use DoFHandler::get_active_fe_indices() that returns the result vector.
│ │ │
Member DoFTools::map_dofs_to_support_points (const Mapping< dim, spacedim > &mapping, const DoFHandler< dim, spacedim > &dof_handler, std::map< types::global_dof_index, Point< spacedim > > &support_points, const ComponentMask &mask={})
│ │ │ -
Use the function that returns the std::map instead.
│ │ │ +
Use the function that returns the std::map instead.
│ │ │ +
Member DoFTools::map_dofs_to_support_points (const hp::MappingCollection< dim, spacedim > &mapping, const DoFHandler< dim, spacedim > &dof_handler, std::map< types::global_dof_index, Point< spacedim > > &support_points, const ComponentMask &mask={})
│ │ │ +
Use the function that returns the std::map instead.
│ │ │
Member FEEvaluationData< dim, Number, is_face >::get_normal_vector (const unsigned int q_point) const
│ │ │
Use normal_vector() instead.
│ │ │
Member FEFaceEvaluation< dim, fe_degree, n_q_points_1d, n_components_, Number, VectorizedArrayType >::integrate_scatter (const bool integrate_values, const bool integrate_gradients, VectorType &output_vector)
│ │ │ -
Please use the integrate_scatter() function with the EvaluationFlags argument.
│ │ │ +
Please use the integrate_scatter() function with the EvaluationFlags argument.
│ │ │
Member FEInterfaceViews::Vector< dim, spacedim >::average_hessian (const unsigned int interface_dof_index, const unsigned int q_point) const
│ │ │ -
Use the average_of_hessians() function instead.
│ │ │ +
Use the average_of_hessians() function instead.
│ │ │
Member FEInterfaceViews::Vector< dim, spacedim >::jump_gradient (const unsigned int interface_dof_index, const unsigned int q_point) const
│ │ │ -
Use the average_of_gradients() function instead.
│ │ │ +
Use the average_of_gradients() function instead.
│ │ │
Member FEInterfaceViews::Vector< dim, spacedim >::jump_hessian (const unsigned int interface_dof_index, const unsigned int q_point) const
│ │ │ -
Use the average_of_hessians() function instead.
│ │ │ +
Use the average_of_hessians() function instead.
│ │ │
Member FEPointEvaluationBase< n_components_, dim, spacedim, Number >::real_point (const unsigned int point_index) const
│ │ │ -
Use the function quadrature_point() instead.
│ │ │ +
Use the function quadrature_point() instead.
│ │ │
Member FETools::Compositing::compute_nonzero_components (const FiniteElement< dim, spacedim > *fe1, const unsigned int N1, const FiniteElement< dim, spacedim > *fe2=nullptr, const unsigned int N2=0, const FiniteElement< dim, spacedim > *fe3=nullptr, const unsigned int N3=0, const FiniteElement< dim, spacedim > *fe4=nullptr, const unsigned int N4=0, const FiniteElement< dim, spacedim > *fe5=nullptr, const unsigned int N5=0, const bool do_tensor_product=true)
│ │ │ -
Use the versions of this function that take a vector of elements or an initializer list as arguments.
│ │ │ +
Use the versions of this function that take a vector of elements or an initializer list as arguments.
│ │ │
Member FETools::Compositing::compute_restriction_is_additive_flags (const FiniteElement< dim, spacedim > *fe1, const unsigned int N1, const FiniteElement< dim, spacedim > *fe2=nullptr, const unsigned int N2=0, const FiniteElement< dim, spacedim > *fe3=nullptr, const unsigned int N3=0, const FiniteElement< dim, spacedim > *fe4=nullptr, const unsigned int N4=0, const FiniteElement< dim, spacedim > *fe5=nullptr, const unsigned int N5=0)
│ │ │ -
Use the versions of this function that take a vector of elements or an initializer list as arguments.
│ │ │ +
Use the versions of this function that take a vector of elements or an initializer list as arguments.
│ │ │
Member FETools::Compositing::multiply_dof_numbers (const FiniteElement< dim, spacedim > *fe1, const unsigned int N1, const FiniteElement< dim, spacedim > *fe2=nullptr, const unsigned int N2=0, const FiniteElement< dim, spacedim > *fe3=nullptr, const unsigned int N3=0, const FiniteElement< dim, spacedim > *fe4=nullptr, const unsigned int N4=0, const FiniteElement< dim, spacedim > *fe5=nullptr, const unsigned int N5=0)
│ │ │ -
Use the versions of this function that take a vector of elements or an initializer list as arguments.
│ │ │ +
Use the versions of this function that take a vector of elements or an initializer list as arguments.
│ │ │
Member FiniteElement< dim, spacedim >::fill_fe_face_values (const typename Triangulation< dim, spacedim >::cell_iterator &cell, const unsigned int face_no, const Quadrature< dim - 1 > &quadrature, const Mapping< dim, spacedim > &mapping, const typename Mapping< dim, spacedim >::InternalDataBase &mapping_internal, const internal::FEValuesImplementation::MappingRelatedData< dim, spacedim > &mapping_data, const InternalDataBase &fe_internal, internal::FEValuesImplementation::FiniteElementRelatedData< dim, spacedim > &output_data) const
│ │ │
Use the version taking a hp::QCollection argument.
│ │ │
Member FiniteElement< dim, spacedim >::get_face_data (const UpdateFlags update_flags, const Mapping< dim, spacedim > &mapping, const Quadrature< dim - 1 > &quadrature, internal::FEValuesImplementation::FiniteElementRelatedData< dim, spacedim > &output_data) const
│ │ │
Use the version taking a hp::QCollection argument.
│ │ │
Member GridTools::fix_up_distorted_child_cells (const typename Triangulation< dim, spacedim >::DistortedCellList &distorted_cells, Triangulation< dim, spacedim > &triangulation)
│ │ │ -
This function predates deal.II's use of manifolds and use of cell-local transfinite interpolation to place new points and is no longer necessary. See Manifolds::get_default_points_and_weights() for more information.
│ │ │ +
This function predates deal.II's use of manifolds and use of cell-local transfinite interpolation to place new points and is no longer necessary. See Manifolds::get_default_points_and_weights() for more information.
│ │ │
Member GridTools::rotate (const double angle, const unsigned int axis, Triangulation< dim, 3 > &triangulation)
│ │ │ -
Use the alternative with the unit vector instead.
│ │ │ +
Use the alternative with the unit vector instead.
│ │ │
Member identity
│ │ │ -
Use std_cxx20::type_identity instead.
│ │ │ +
Use std_cxx20::type_identity instead.
│ │ │
Member LinearAlgebra::CUDAWrappers::Vector< Number >::import (const ReadWriteVector< Number > &V, VectorOperation::values operation, std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > communication_pattern={})
│ │ │
Use import_elements() instead.
│ │ │
Member LinearAlgebra::distributed::BlockVector< Number >::import (const LinearAlgebra::ReadWriteVector< Number > &V, VectorOperation::values operation, std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > communication_pattern={})
│ │ │
Use import_elements() instead.
│ │ │ -
Member LinearAlgebra::distributed::Vector< Number, MemorySpace >::import (const LinearAlgebra::ReadWriteVector< Number > &V, VectorOperation::values operation, std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > communication_pattern={})
│ │ │ -
Use import_elements() instead.
│ │ │
Member LinearAlgebra::distributed::Vector< Number, MemorySpace >::import (const Vector< Number, MemorySpace2 > &src, VectorOperation::values operation)
│ │ │
Use import_elements() instead.
│ │ │ +
Member LinearAlgebra::distributed::Vector< Number, MemorySpace >::import (const LinearAlgebra::ReadWriteVector< Number > &V, VectorOperation::values operation, std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > communication_pattern={})
│ │ │ +
Use import_elements() instead.
│ │ │
Member LinearAlgebra::EpetraWrappers::Vector::import (const ReadWriteVector< double > &V, const VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
│ │ │
Use import_elements() instead.
│ │ │
Member LinearAlgebra::ReadWriteVector< Number >::import (const TpetraWrappers::Vector< Number, MemorySpace > &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
│ │ │
Use import_elements() instead.
│ │ │ +
Member LinearAlgebra::ReadWriteVector< Number >::import (const EpetraWrappers::Vector &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
│ │ │ +
Use import_elements() instead.
│ │ │ +
Member LinearAlgebra::ReadWriteVector< Number >::import (const CUDAWrappers::Vector< Number > &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
│ │ │ +
Use import_elements() instead.
│ │ │
Member LinearAlgebra::ReadWriteVector< Number >::import (const TrilinosWrappers::MPI::Vector &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
│ │ │
Use import_elements() instead.
│ │ │
Member LinearAlgebra::ReadWriteVector< Number >::import (const PETScWrappers::MPI::Vector &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
│ │ │
Use import_elements() instead.
│ │ │ -
Member LinearAlgebra::ReadWriteVector< Number >::import (const distributed::Vector< Number, MemorySpace > &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
│ │ │ -
Use import_elements() instead.
│ │ │
Member LinearAlgebra::ReadWriteVector< Number >::import (const ::Vector< Number > &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
│ │ │
Use import_elements() instead.
│ │ │ -
Member LinearAlgebra::ReadWriteVector< Number >::import (const CUDAWrappers::Vector< Number > &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
│ │ │ -
Use import_elements() instead.
│ │ │ -
Member LinearAlgebra::ReadWriteVector< Number >::import (const EpetraWrappers::Vector &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
│ │ │ -
Use import_elements() instead.
│ │ │ +
Member LinearAlgebra::ReadWriteVector< Number >::import (const distributed::Vector< Number, MemorySpace > &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern={})
│ │ │ +
Use import_elements() instead.
│ │ │
Member LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::import (const ReadWriteVector< Number > &V, VectorOperation::values operation, std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > communication_pattern={})
│ │ │
Use import_elements() instead.
│ │ │
Member LinearAlgebra::TpetraWrappers::Vector< Number, MemorySpace >::import_elements (const ReadWriteVector< Number > &V, VectorOperation::values operation, const std::shared_ptr< const Utilities::MPI::CommunicationPatternBase > &communication_pattern)
│ │ │
Use Teuchos::RCP<> instead of std::shared_ptr<>.
│ │ │ +
Member make_array_view (const Tensor< rank, dim, Number > &tensor)
│ │ │ +
This function suggests that the elements of a Tensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │ +
Member make_array_view (Tensor< rank, dim, Number > &tensor)
│ │ │ +
This function suggests that the elements of a Tensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │
Member make_array_view (SymmetricTensor< rank, dim, Number > &tensor)
│ │ │
This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │
Member make_array_view (const SymmetricTensor< rank, dim, Number > &tensor)
│ │ │
This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │ -
Member make_array_view (Tensor< rank, dim, Number > &tensor)
│ │ │ -
This function suggests that the elements of a Tensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │ -
Member make_array_view (const Tensor< rank, dim, Number > &tensor)
│ │ │ -
This function suggests that the elements of a Tensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │
Member Mapping< dim, spacedim >::fill_fe_face_values (const typename Triangulation< dim, spacedim >::cell_iterator &cell, const unsigned int face_no, const Quadrature< dim - 1 > &quadrature, const typename Mapping< dim, spacedim >::InternalDataBase &internal_data, internal::FEValuesImplementation::MappingRelatedData< dim, spacedim > &output_data) const
│ │ │ -
Use the version taking a hp::QCollection argument.
│ │ │ +
Use the version taking a hp::QCollection argument.
│ │ │
Member Mapping< dim, spacedim >::get_face_data (const UpdateFlags update_flags, const Quadrature< dim - 1 > &quadrature) const
│ │ │ -
Use the version taking a hp::QCollection argument.
│ │ │ +
Use the version taking a hp::QCollection argument.
│ │ │
Member MeshWorker::integration_loop (IteratorType begin, std_cxx20::type_identity_t< IteratorType > end, DoFInfo< dim, spacedim > &dof_info, IntegrationInfoBox< dim, spacedim > &box, const LocalIntegrator< dim, spacedim > &integrator, AssemblerType &assembler, const LoopControl &lctrl=LoopControl())
│ │ │
This function is deprecated, along with the LocalIntegrator class. Use the MeshWorker::loop() function directly, with three function objects that perform the cell, boundary, and interior face integration.
│ │ │
Class MeshWorker::LocalIntegrator< dim, spacedim, number >
│ │ │ -
This class is deprecated. It used to be the basis for integration via the MeshWorker::integration_loop() function, but the same functionality is available via MeshWorker::loop().
│ │ │ +
This class is deprecated. It used to be the basis for integration via the MeshWorker::integration_loop() function, but the same functionality is available via MeshWorker::loop().
│ │ │
Member MeshWorker::LocalIntegrator< dim, spacedim, number >::input_vector_names
│ │ │ -
Because the library itself does not use this field, it is better placed in derived classes.
│ │ │ +
Because the library itself does not use this field, it is better placed in derived classes.
│ │ │
Member MeshWorker::LocalIntegrator< dim, spacedim, number >::output_names
│ │ │ -
Because the library itself does not use this field, it is better placed in derived classes.
│ │ │ +
Because the library itself does not use this field, it is better placed in derived classes.
│ │ │
Member NonlinearSolverSelector< VectorType >::NonlinearSolverSelector (const AdditionalData &additional_data)
│ │ │
Use the other constructor with MPI_Comm instead.
│ │ │
Member parallel::distributed::Triangulation< dim, spacedim >::load (const std::string &filename, const bool autopartition) override
│ │ │ -
The autopartition parameter has been removed.
│ │ │ +
The autopartition parameter has been removed.
│ │ │
Member parallel::DistributedTriangulationBase< dim, spacedim >::load (const std::string &filename, const bool autopartition)=0
│ │ │
The autopartition parameter has been removed.
│ │ │
Member parallel::fullydistributed::Triangulation< dim, spacedim >::load (const std::string &filename, const bool autopartition) override
│ │ │ -
The autopartition parameter has been removed.
│ │ │ +
The autopartition parameter has been removed.
│ │ │
Member ParameterHandler::ShortText
│ │ │
Use ShortPRM instead of ShortText.
│ │ │
Member ParameterHandler::Text
│ │ │
Use PRM instead of Text.
│ │ │
Member Particles::ParticleAccessor< dim, spacedim >::set_property_pool (PropertyPool< dim, spacedim > &property_pool)
│ │ │
This function is only kept for backward compatibility and has no meaning any more. ParticleAccessors always use the property pool of the owning particle handler.
│ │ │
Member Particles::ParticleHandler< dim, spacedim >::register_load_callback_function (const bool serialization)
│ │ │
Please use unpack_after_coarsening_and_refinement() or deserialize() instead. See there for further information about the purpose of this function.
│ │ │
Member Particles::ParticleHandler< dim, spacedim >::register_store_callback_function ()
│ │ │
Please use prepare_for_coarsening_and_refinement() or prepare_for_serialization() instead. See there for further information about the purpose of this function.
│ │ │
Class PathSearch
│ │ │ -
Use the std::filesystem facilities instead.
│ │ │ +
Use the std::filesystem facilities instead.
│ │ │
Member PETScWrappers::SolverBiCG::SolverBiCG (SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())
│ │ │
│ │ │
Member PETScWrappers::SolverBicgstab::SolverBicgstab (SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())
│ │ │
│ │ │
Member PETScWrappers::SolverCG::SolverCG (SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())
│ │ │
│ │ │
Member PETScWrappers::SolverCGS::SolverCGS (SolverControl &cn, const MPI_Comm mpi_communicator, const AdditionalData &data=AdditionalData())
│ │ │ @@ -266,66 +266,66 @@ │ │ │
This callback is equivalent to update_constrained_components, but is deprecated. Use update_constrained_components instead.
│ │ │
Member PETScWrappers::TimeStepper< VectorType, PMatrixType, AMatrixType >::interpolate
│ │ │
This callback is equivalent to transfer_solution_vectors_to_new_mesh, but is deprecated. Use transfer_solution_vectors_to_new_mesh instead.
│ │ │
Member Physics::Transformations::Rotations::rotation_matrix_3d (const Point< 3, Number > &axis, const Number &angle)
│ │ │
Use the variant with a Tensor as an axis.
│ │ │
Member PolarManifold< dim, spacedim >::center
│ │ │
Use get_center() instead.
│ │ │ -
Member QProjector< dim >::DataSetDescriptor::face (const ReferenceCell &reference_cell, const unsigned int face_no, const bool face_orientation, const bool face_flip, const bool face_rotation, const hp::QCollection< dim - 1 > &quadrature)
│ │ │ -
Use the version of this function which takes a combined_orientation argument instead.
│ │ │
Member QProjector< dim >::DataSetDescriptor::face (const ReferenceCell &reference_cell, const unsigned int face_no, const bool face_orientation, const bool face_flip, const bool face_rotation, const unsigned int n_quadrature_points)
│ │ │
Use the version of this function which takes a combined_orientation argument instead.
│ │ │ +
Member QProjector< dim >::DataSetDescriptor::face (const ReferenceCell &reference_cell, const unsigned int face_no, const bool face_orientation, const bool face_flip, const bool face_rotation, const hp::QCollection< dim - 1 > &quadrature)
│ │ │ +
Use the version of this function which takes a combined_orientation argument instead.
│ │ │
Member QProjector< dim >::DataSetDescriptor::subface (const ReferenceCell &reference_cell, const unsigned int face_no, const unsigned int subface_no, const bool face_orientation, const bool face_flip, const bool face_rotation, const unsigned int n_quadrature_points, const internal::SubfaceCase< dim > ref_case=internal::SubfaceCase< dim >::case_isotropic)
│ │ │
Use the version of this function which takes a combined_orientation argument instead.
│ │ │
Member ReferenceCell::compute_orientation (const std::array< T, N > &vertices_0, const std::array< T, N > &vertices_1) const
│ │ │
Use get_combined_orientation() instead.
│ │ │
Member ReferenceCell::permute_according_orientation (const std::array< T, N > &vertices, const unsigned int orientation) const
│ │ │
Use permute_by_combined_orientation() instead.
│ │ │
Class SLEPcWrappers::TransformationSpectrumFolding
│ │ │
Since deal.II requires PETSc 3.7 or newer this class no longer does anything.
│ │ │
Member SolverGMRES< VectorType >::AdditionalData::max_n_tmp_vectors
│ │ │
Use max_basis_size instead.
│ │ │
Member SparsityTools::distribute_sparsity_pattern (BlockDynamicSparsityPattern &dsp, const std::vector< IndexSet > &owned_set_per_cpu, const MPI_Comm mpi_comm, const IndexSet &myrange)
│ │ │
Use the distribute_sparsity_pattern() with a single index set for the present MPI process only.
│ │ │
Member SphericalManifold< dim, spacedim >::center
│ │ │
Use get_center() instead.
│ │ │ -
Member SymmetricTensor< rank_, dim, Number >::begin_raw () const
│ │ │ -
This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │
Member SymmetricTensor< rank_, dim, Number >::begin_raw ()
│ │ │ -
This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │ -
Member SymmetricTensor< rank_, dim, Number >::end_raw () const
│ │ │ +
This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │ +
Member SymmetricTensor< rank_, dim, Number >::begin_raw () const
│ │ │
This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │ +
Member SymmetricTensor< rank_, dim, Number >::end_raw () const
│ │ │ +
This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │
Member SymmetricTensor< rank_, dim, Number >::end_raw ()
│ │ │ -
This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │ +
This function suggests that the elements of a SymmetricTensor object are stored as a contiguous array, but this is not in fact true and one should not pretend that this so. As a consequence, this function is deprecated.
│ │ │
Member Tensor< rank_, dim, Number >::unroll (Vector< OtherNumber > &result) const
│ │ │ -
Use the more general function that takes a pair of iterators instead.
│ │ │ +
Use the more general function that takes a pair of iterators instead.
│ │ │
Member Triangulation< dim, spacedim >::CELL_COARSEN
│ │ │
This is an alias for backward compatibility. Use CellStatus directly.
│ │ │
Member Triangulation< dim, spacedim >::CELL_INVALID
│ │ │
This is an alias for backward compatibility. Use CellStatus directly.
│ │ │
Member Triangulation< dim, spacedim >::CELL_PERSIST
│ │ │
This is an alias for backward compatibility. Use CellStatus directly.
│ │ │
Member Triangulation< dim, spacedim >::CELL_REFINE
│ │ │
This is an alias for backward compatibility. Use CellStatus directly.
│ │ │
Member Triangulation< dim, spacedim >::CellStatus
│ │ │
This is an alias for backward compatibility. Use CellStatus directly.
│ │ │
Member TrilinosWrappers::MPI::Vector::import (const LinearAlgebra::ReadWriteVector< double > &rwv, const VectorOperation::values operation)
│ │ │
Use import_elements() instead.
│ │ │
Member Utilities::MPI::create_group (const MPI_Comm comm, const MPI_Group &group, const int tag, MPI_Comm *new_comm)
│ │ │ -
Use MPI_Comm_create_group directly
│ │ │ +
Use MPI_Comm_create_group directly
│ │ │
Member Utilities::MPI::RemotePointEvaluation< dim, spacedim >::RemotePointEvaluation (const double tolerance, const bool enforce_unique_mapping=false, const unsigned int rtree_level=0, const std::function< std::vector< bool >()> &marked_vertices={})
│ │ │ -
│ │ │ +
│ │ │
Member XDMFEntry::get_xdmf_content (const unsigned int indent_level, const ReferenceCell &reference_cell) const
│ │ │ -
Use the other function instead.
│ │ │ +
Use the other function instead.
│ │ │
Member XDMFEntry::XDMFEntry (const std::string &mesh_filename, const std::string &solution_filename, const double time, const std::uint64_t nodes, const std::uint64_t cells, const unsigned int dim, const unsigned int spacedim)
│ │ │ -
Use the constructor that additionally takes a ReferenceCell.
│ │ │ +
Use the constructor that additionally takes a ReferenceCell.
│ │ │
Member XDMFEntry::XDMFEntry (const std::string &mesh_filename, const std::string &solution_filename, const double time, const std::uint64_t nodes, const std::uint64_t cells, const unsigned int dim)
│ │ │ -
Use the constructor that additionally takes a ReferenceCell.
│ │ │ +
Use the constructor that additionally takes a ReferenceCell.
│ │ │
Member XDMFEntry::XDMFEntry (const std::string &filename, const double time, const std::uint64_t nodes, const std::uint64_t cells, const unsigned int dim)
│ │ │ -
Use the constructor that additionally takes a ReferenceCell.
│ │ │ +
Use the constructor that additionally takes a ReferenceCell.
│ │ │
│ │ │
│ │ │
│ │ │ │ │ │ │ │ │