- Jul 24, 2019
-
-
Dominic Kempf authored
-
- Jul 22, 2019
-
-
Dominic Kempf authored
-
- Jan 24, 2019
-
-
Dominic Kempf authored
-
- Jan 23, 2019
-
-
Dominic Kempf authored
-
Dominic Kempf authored
-
- Dec 05, 2018
-
-
Dominic Kempf authored
-
- Nov 28, 2018
-
-
Dominic Kempf authored
-
- Nov 22, 2018
-
-
René Heß authored
Non-fastdg: Permutation of the input happens before the sum factorization kernel when we setup the input. This is done by a method of the corresponding interface class. Fastdg: In this case the input will always be ordered according to x,y,... This means the permutation needs to happen in the sumfact kernel. Since we want to vectorize sumfact kernels with different input permutation in an upper/lower way we need to do this permutation in the corresponding interface class. This is done in the realize_direct method and in the vectorized case the corresponding methods of the scalar sumfact kernels are called.
-
- Oct 30, 2018
-
-
Dominic Kempf authored
-
Dominic Kempf authored
-
- Feb 27, 2018
-
-
René Heß authored
-
- Jan 30, 2018
-
-
Dominic Kempf authored
Instationary stuff not fixed so far.
-
- Jan 03, 2018
-
-
Dominic Kempf authored
-
- Nov 09, 2017
-
-
René Heß authored
-
- Aug 25, 2017
-
-
Dominic Kempf authored
-
Dominic Kempf authored
The introduction of FunctionView turned out to be a major problem with more complicated forms. The original idea was to preserver the structure of the finite element in a way, that loops over components of a mixed element are realized by actual loops (treating them with free indices and such). However, this causes quite some nightmares and was never implemented as generically as needed (I even doubt that is possible). However, there is another option, which is to unroll any such loops on a symbolic level. While this may sound like a bad idea at first there is some really positive aspects about it: * ListTensor and ComponentTensor nodes collapse completely (and would otherwise have a big nightmare potential) * Symbolic zeroes do not generate code - important in hyperbolic problems where the system matrices are quite sparse or for axiparallel grids, where geometric quantities have many zeroes. * The compiler would unroll these small loops anyway. * TSFC (and I guess also FFC) do it the same way. Implementing this required me to redo the form splitting algorithm. I rethought it and integrated it into the main ufl->loopy visitor.
-
- Aug 24, 2017
-
-
Marcel Koch authored
-
- Aug 18, 2017
-
-
Marcel Koch authored
-
- Jul 25, 2017
-
-
Marcel Koch authored
Computes tensor index from single index.
-
- Jul 24, 2017
-
-
Marcel Koch authored
-
- Jul 10, 2017
-
-
Marcel Koch authored
-
- Jun 06, 2017
-
-
René Heß authored
-
- Dec 09, 2016
-
-
Dominic Kempf authored
-
- Nov 24, 2016
-
-
Dominic Kempf authored
-
- Nov 03, 2016
-
-
Dominic Kempf authored
-
- Oct 27, 2016
-
-
Dominic Kempf authored
-
- Oct 26, 2016
-
-
Dominic Kempf authored
In sum factorization we will have different temporary shape and access.
-
Dominic Kempf authored
-
Dominic Kempf authored
-
Dominic Kempf authored
The backend selecting mechanism needs all modules to be imported. This commit restructures the package to be able to do that. Placement of some functions felt weird, but this can still be changed. No more placements in __init__.py anymore though, as this will result in cyclic dependencies.
-
- Oct 24, 2016
-
-
René Heß authored
-
- Oct 21, 2016
-
-
Dominic Kempf authored
-
- Oct 20, 2016
-
-
René Heß authored
-
- Oct 18, 2016
-
-
Dominic Kempf authored
-
René Heß authored
-
- Oct 14, 2016
-
-
René Heß authored
-
- Oct 06, 2016
-
-
Dominic Kempf authored
-
- Oct 05, 2016
-
-
Dominic Kempf authored
-
Dominic Kempf authored
-
Dominic Kempf authored
-