[deal.II] Affine constraints distribute_local_to_global

Dear community I am asking your help today about imposing affine constraints. I understood well example 6, but when it comes to apply it to sparse MPI matrices I get lost. I am not sure if example 27 is of help for my case. What would I like to simulate? Take two separate domains, with

Re: [deal.II] Copying field evaluated at quadrature points to device via CUDA

Lucas, In case you are using the GPU matrix-free framework as described in step-64, you can use CUDAWrappers::MatrixFree::evaluate_coefficients() to to perform the function inversion. Otherwise, you need to keep track of the mapping from cells/quadrature points to vector indices yourself. So you

[deal.II] Copying field evaluated at quadrature points to device via CUDA

Hi folks, As I understand it, the standard way of looping through a finite element problem is to iterate through (1) each cell in the mesh, (2) each quadrature point in the cell, (3) the ith shape functions, and (4) the jth shape functions. Given that, would it be possible to copy a finite

Re: [deal.II] Inaccurate convergence rate using ParsedConvergenceTable class

You're right, I totally missed the default parameter h in the constructor. Thanks, Marco Il giorno domenica 8 agosto 2021 alle 22:26:01 UTC+2 Timo Heister ha scritto: > FunctionParser uses a finite difference approximation for the gradient. I > think this is explained in the class