@brief Create and start timer. Elapsed time is optionally registered in the logger when the Timer destructor is called. @param[in] task Name used to

@brief Create a VTX writer for a mesh. This format supports arbitrary degree meshes. @param[in] comm MPI communicator to open the file on. @param[in

Helper function to create a UFL bilinear form. The form depends on the integral type.

-----------------------------------------------------------------------------

Get bounding box child nodes. @param[in] node The bounding box node index @return The indices of the two child nodes. If @p node is a leaf nodes, the

Block size of the dofmap.

Conjugate Gradient solver for SPD problems, which can work in serial or parallel for testing use. Not suitable for large problems.

----------------------------------------------------------------------------

From a mesh, find which cells collide with a set of points. Args: msh: The mesh. candidates: Adjacency list of candidate collidin

Compute all collisions between two bounding box trees. Args: tree0: First bounding box tree. tree1: Second bounding box tree.

-----------------------------------------------------------------------------

Generate data for interpolating functions on different meshes. Args: V_to: Function space to interpolate into. V_from: Function s

Create bounding box tree for the midpoints of a subset of entities. Args: mesh: The mesh. dim: Topological dimension of the entit

Assemble a discrete gradient operator. The discrete gradient operator interpolates the gradient of a H1 finite element function into a H(curl

----------------------------------------------------------------------------

From a mesh create a mesh with geometry interpolated into cmap. Useful for creating a higher-order mesh from a lower-order one for computatio

Create an interpolation operator between finite element spaces. Consider is the vector of degrees-of-freedom :math:`u_{i}` associated with a

List of inter-process facets. Empty if facet topology has not been computed.

Check whether bounding box is a leaf node

-----------------------------------------------------------------------------

Compute matrix product ``A * B``, where `A` is this matrix. Args: B: Input Matrix to multiply by

Create mesh tags that associate data with a subset of mesh entities. The entities are defined by their vertices. Args: msh: The mesh

@brief Get bool indicating whether permutation data needs to be passed into these integrals. @return True if cell permutation data is required

Copy a container of pointers to a std::vector<std::reference_wrapper<T>>

Push points on the reference cell forward to the physical cell. Args: X: Coordinates of points on the reference cell,

Read mesh tags with name given in the XMDF file. Args: mesh: Mesh that the input data is defined on. name: Name of th

-----------------------------------------------------------------------------

Manufactured Poisson problem, solving u = x[component]**n, where n is the degree of the Lagrange function space.

Test that interpolation is correct in a scalar valued space.

-----------------------------------------------------------------------------

-----------------------------------------------------------------------------

Set SuperLU_DIST option for solve. See SuperLU_DIST User's Guide for option names and values. Example:: solver.set_opti

Solve the problem. This method updates the solution ``u`` function(s) stored in the problem instance. Note: The

Stop timer and return elapsed time. Returns: Elapsed time.

@brief Evaluation point coordinates on the reference cell.

Assemble linear form into an existing array. Args: b: Array to assemble the contribution from the calling MPI rank into. It m

Assign :class:`Function` degrees-of-freedom to a vector. Assigns degree-of-freedom values in ``u``, which is possibly a sequence of ``Functio

@brief Compute vector r = alpha * x + y. @param[out] r @param[in] alpha @param[in] x @param[in] y

@brief Get block sizes. @return Block sizes for rows (0) and columns (1).

@brief Offset for each coefficient expansion array on a cell. Used to pack data for multiple coefficients in a flat array. The last entry is the size

Compute the L2-error between two expressions. Args: uh: The approximate solution. u_ex: The exact solution.

Compute the Mie coefficient a_nu for a cylinder.

Compute the a_nu coefficient.

Compute closest mesh entity to a point. Args: tree: bounding box tree for the entities. midpoint_tree: A bounding box tree with t

Determine compute integration entities. This function returns a list ``[(id, entities)]``. For cell integrals ``entities`` are the cell indic

Create a DOLFINx from a Gmsh model and output to file. Args: comm: MPI communicator top create the mesh on. model: Gmsh model.

-----------------------------------------------------------------------------

Distance from point to line.

The geometry dofmaps, one per cell type.

Linearised elasticity problem solver.

Given a mesh and a bounding box((xmin, ymin, zmin), (xmax, ymax, zmax)) find all colliding cells.

Find all DOFs on this process that have been detected on another process. @param[in] comm A symmetric communicator @param[in] map The index map with t

Geometric size measure of cell entities. Args: dim: Topological dimension of the entities to compute the size mea

----------------------------------------------------------------------------

Interpolate a Function on a non-matching mesh. Args: u0: Function to interpolate. cells: The cells to interpolate ove

Create a mixed-topology from from an array of Forms. # FIXME: This function is a temporary hack for mixed-topology meshes. # It is needed bec

Number of local rows excluding ghost rows

Apply PML coordinate transformation to point x.

Poisson problem solver. Args: dtype: Scalar type to use.

Solve a 3D Poisson problem using Ruge-Stuben algebraic multigrid. Args: dtype: Scalar type to use. solver_type: pyamg solver type

@endcond -----------------------------------------------------------------------------

Define a saw tooth wave function.

@brief Newton Solver @param x Solution vector @return Iteration count and flag indicating convergence

@brief Compute the Frobenius norm squared across all processes. @note MPI Collective

Create a SuperLU_DIST matrix. Deep copies all required data from ``A``. Args: A: Assembled matrix. Returns: A SuperLU_D

-----------------------------------------------------------------------------