-
Notifications
You must be signed in to change notification settings - Fork 707
/
fe_point_evaluation.h
1297 lines (1133 loc) · 46.5 KB
/
fe_point_evaluation.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// ---------------------------------------------------------------------
//
// Copyright (C) 2020 - 2022 by the deal.II authors
//
// This file is part of the deal.II library.
//
// The deal.II library is free software; you can use it, redistribute
// it, and/or modify it under the terms of the GNU Lesser General
// Public License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
// The full text of the license can be found in the file LICENSE.md at
// the top level directory of deal.II.
//
// ---------------------------------------------------------------------
#ifndef dealii_fe_point_evaluation_h
#define dealii_fe_point_evaluation_h
#include <deal.II/base/config.h>
#include <deal.II/base/array_view.h>
#include <deal.II/base/exceptions.h>
#include <deal.II/base/polynomial.h>
#include <deal.II/base/signaling_nan.h>
#include <deal.II/base/tensor.h>
#include <deal.II/base/vectorization.h>
#include <deal.II/fe/fe_values.h>
#include <deal.II/fe/mapping_cartesian.h>
#include <deal.II/fe/mapping_q.h>
#include <deal.II/matrix_free/evaluation_flags.h>
#include <deal.II/matrix_free/shape_info.h>
#include <deal.II/matrix_free/tensor_product_kernels.h>
#include <deal.II/non_matching/mapping_info.h>
DEAL_II_NAMESPACE_OPEN
namespace internal
{
namespace FEPointEvaluation
{
/**
* Struct to distinguish between the value and gradient types of different
* numbers of components used by the FlexibleEvaluator class.
*/
template <int dim, int n_components, typename Number>
struct EvaluatorTypeTraits
{
using value_type = Tensor<1, n_components, Number>;
using gradient_type = Tensor<1, n_components, Tensor<1, dim, Number>>;
static void
read_value(const Number vector_entry,
const unsigned int component,
value_type & result)
{
AssertIndexRange(component, n_components);
result[component] = vector_entry;
}
static void
write_value(Number & vector_entry,
const unsigned int component,
const value_type & result)
{
AssertIndexRange(component, n_components);
vector_entry = result[component];
}
static void
set_gradient(
const Tensor<1, dim, Tensor<1, n_components, VectorizedArray<Number>>>
& value,
const unsigned int vector_lane,
gradient_type & result)
{
for (unsigned int i = 0; i < n_components; ++i)
for (unsigned int d = 0; d < dim; ++d)
result[i][d] = value[d][i][vector_lane];
}
static void
get_gradient(
Tensor<1, dim, Tensor<1, n_components, VectorizedArray<Number>>> &value,
const unsigned int vector_lane,
const gradient_type &result)
{
for (unsigned int i = 0; i < n_components; ++i)
for (unsigned int d = 0; d < dim; ++d)
value[d][i][vector_lane] = result[i][d];
}
static void
set_value(const Tensor<1, n_components, VectorizedArray<Number>> &value,
const unsigned int vector_lane,
value_type & result)
{
for (unsigned int i = 0; i < n_components; ++i)
result[i] = value[i][vector_lane];
}
static void
get_value(Tensor<1, n_components, VectorizedArray<Number>> &value,
const unsigned int vector_lane,
const value_type & result)
{
for (unsigned int i = 0; i < n_components; ++i)
value[i][vector_lane] = result[i];
}
template <typename Number2>
static Number2 &
access(Tensor<1, n_components, Number2> &value,
const unsigned int component)
{
return value[component];
}
template <typename Number2>
static const Number2 &
access(const Tensor<1, n_components, Number2> &value,
const unsigned int component)
{
return value[component];
}
};
template <int dim, typename Number>
struct EvaluatorTypeTraits<dim, 1, Number>
{
using value_type = Number;
using gradient_type = Tensor<1, dim, Number>;
static void
read_value(const Number vector_entry,
const unsigned int,
value_type &result)
{
result = vector_entry;
}
static void
write_value(Number &vector_entry,
const unsigned int,
const value_type &result)
{
vector_entry = result;
}
static void
set_gradient(const Tensor<1, dim, VectorizedArray<Number>> &value,
const unsigned int vector_lane,
gradient_type & result)
{
for (unsigned int d = 0; d < dim; ++d)
result[d] = value[d][vector_lane];
}
static void
get_gradient(Tensor<1, dim, VectorizedArray<Number>> &value,
const unsigned int vector_lane,
const gradient_type & result)
{
for (unsigned int d = 0; d < dim; ++d)
value[d][vector_lane] = result[d];
}
static void
set_value(const VectorizedArray<Number> &value,
const unsigned int vector_lane,
value_type & result)
{
result = value[vector_lane];
}
static void
get_value(VectorizedArray<Number> &value,
const unsigned int vector_lane,
const value_type & result)
{
value[vector_lane] = result;
}
template <typename Number2>
static Number2 &
access(Number2 &value, const unsigned int)
{
return value;
}
template <typename Number2>
static const Number2 &
access(const Number2 &value, const unsigned int)
{
return value;
}
};
template <int dim, typename Number>
struct EvaluatorTypeTraits<dim, dim, Number>
{
using value_type = Tensor<1, dim, Number>;
using gradient_type = Tensor<2, dim, Number>;
static void
read_value(const Number vector_entry,
const unsigned int component,
value_type & result)
{
result[component] = vector_entry;
}
static void
write_value(Number & vector_entry,
const unsigned int component,
const value_type & result)
{
vector_entry = result[component];
}
static void
set_gradient(
const Tensor<1, dim, Tensor<1, dim, VectorizedArray<Number>>> &value,
const unsigned int vector_lane,
gradient_type & result)
{
for (unsigned int i = 0; i < dim; ++i)
for (unsigned int d = 0; d < dim; ++d)
result[i][d] = value[d][i][vector_lane];
}
static void
get_gradient(
Tensor<1, dim, Tensor<1, dim, VectorizedArray<Number>>> &value,
const unsigned int vector_lane,
const gradient_type & result)
{
for (unsigned int i = 0; i < dim; ++i)
for (unsigned int d = 0; d < dim; ++d)
value[d][i][vector_lane] = result[i][d];
}
static void
set_value(const Tensor<1, dim, VectorizedArray<Number>> &value,
const unsigned int vector_lane,
value_type & result)
{
for (unsigned int i = 0; i < dim; ++i)
result[i] = value[i][vector_lane];
}
static void
get_value(Tensor<1, dim, VectorizedArray<Number>> &value,
const unsigned int vector_lane,
const value_type & result)
{
for (unsigned int i = 0; i < dim; ++i)
value[i][vector_lane] = result[i];
}
static Number &
access(value_type &value, const unsigned int component)
{
return value[component];
}
static const Number &
access(const value_type &value, const unsigned int component)
{
return value[component];
}
static Tensor<1, dim, Number> &
access(gradient_type &value, const unsigned int component)
{
return value[component];
}
static const Tensor<1, dim, Number> &
access(const gradient_type &value, const unsigned int component)
{
return value[component];
}
};
template <typename Number>
struct EvaluatorTypeTraits<1, 1, Number>
{
using value_type = Number;
using gradient_type = Tensor<1, 1, Number>;
static void
read_value(const Number vector_entry,
const unsigned int,
value_type &result)
{
result = vector_entry;
}
static void
write_value(Number &vector_entry,
const unsigned int,
const value_type &result)
{
vector_entry = result;
}
static void
set_gradient(const Tensor<1, 1, VectorizedArray<Number>> &value,
const unsigned int vector_lane,
gradient_type & result)
{
result[0] = value[0][vector_lane];
}
static void
get_gradient(Tensor<1, 1, VectorizedArray<Number>> &value,
const unsigned int vector_lane,
const gradient_type & result)
{
value[0][vector_lane] = result[0];
}
static void
set_value(const VectorizedArray<Number> &value,
const unsigned int vector_lane,
value_type & result)
{
result = value[vector_lane];
}
static void
get_value(VectorizedArray<Number> &value,
const unsigned int vector_lane,
const value_type & result)
{
value[vector_lane] = result;
}
template <typename Number2>
static Number2 &
access(Number2 &value, const unsigned int)
{
return value;
}
template <typename Number2>
static const Number2 &
access(const Number2 &value, const unsigned int)
{
return value;
}
};
template <int dim, int spacedim>
bool
is_fast_path_supported(const FiniteElement<dim, spacedim> &fe,
const unsigned int base_element_number);
template <int dim, int spacedim>
bool
is_fast_path_supported(const Mapping<dim, spacedim> &mapping);
template <int dim, int spacedim>
std::vector<Polynomials::Polynomial<double>>
get_polynomial_space(const FiniteElement<dim, spacedim> &fe);
} // namespace FEPointEvaluation
} // namespace internal
/**
* This class provides an interface to the evaluation of interpolated solution
* values and gradients on cells on arbitrary reference point positions. These
* points can change from cell to cell, both with respect to their quantity as
* well to the location. The two typical use cases are evaluations on
* non-matching grids and particle simulations.
*
* The use of this class is similar to FEValues or FEEvaluation: The class is
* first initialized to a cell by calling `FEPointEvaluation::reinit(cell,
* unit_points)`, with the main difference to the other concepts that the
* underlying points in reference coordinates need to be passed along. Then,
* upon call to evaluate() or integrate(), the user can compute information at
* the give points. Eventually, the access functions get_value() or
* get_gradient() allow to query this information at a specific point index.
*
* The functionality is similar to creating an FEValues object with a
* Quadrature object on the `unit_points` on every cell separately and then
* calling FEValues::get_function_values or FEValues::get_function_gradients,
* and for some elements and mappings this is what actually happens
* internally. For specific combinations of Mapping and FiniteElement
* realizations, however, there is a much more efficient implementation that
* avoids the memory allocation and other expensive start-up cost of
* FEValues. Currently, the functionality is specialized for mappings derived
* from MappingQ and MappingCartesian and for finite elements with tensor
* product structure that work with the
* @ref matrixfree
* module. In those cases, the cost implied
* by this class is similar (or sometimes even somewhat lower) than using
* `FEValues::reinit(cell)` followed by `FEValues::get_function_gradients`.
*/
template <int n_components,
int dim,
int spacedim = dim,
typename Number = double>
class FEPointEvaluation
{
public:
using value_type = typename internal::FEPointEvaluation::
EvaluatorTypeTraits<dim, n_components, Number>::value_type;
using gradient_type = typename internal::FEPointEvaluation::
EvaluatorTypeTraits<dim, n_components, Number>::gradient_type;
/**
* Constructor.
*
* @param mapping The Mapping class describing the actual geometry of a cell
* passed to the evaluate() function.
*
* @param fe The FiniteElement object that is used for the evaluation, which
* is typically the same on all cells to be evaluated.
*
* @param update_flags Specify the quantities to be computed by the mapping
* during the call of reinit(). During evaluate() or integrate(), this data
* is queried to produce the desired result (e.g., the gradient of a finite
* element solution).
*
* @param first_selected_component For multi-component FiniteElement
* objects, this parameter allows to select a range of `n_components`
* components starting from this parameter.
*/
FEPointEvaluation(const Mapping<dim> & mapping,
const FiniteElement<dim> &fe,
const UpdateFlags update_flags,
const unsigned int first_selected_component = 0);
/**
* Constructor to make the present class able to re-use the geometry
* data also used by other `FEPointEvaluation` objects.
*
* @param mapping_info The MappingInfo class describes the geometry-related
* data for evaluating finite-element solutions. This object enables to
* construct such an object on the outside, possibly re-using it between
* several objects or between several calls to the same cell and unit points.
*
* @param fe The FiniteElement object that is used for the evaluation, which
* is typically the same on all cells to be evaluated.
*
* @param first_selected_component For multi-component FiniteElement
* objects, this parameter allows to select a range of `n_components`
* components starting from this parameter.
*/
FEPointEvaluation(NonMatching::MappingInfo<dim, spacedim> &mapping_info,
const FiniteElement<dim> & fe,
const unsigned int first_selected_component = 0);
/**
* Set up the mapping information for the given cell, e.g., by computing the
* Jacobian of the mapping for the given points if gradients of the functions
* are requested.
*
* @param[in] cell An iterator to the current cell
*
* @param[in] unit_points List of points in the reference locations of the
* current cell where the FiniteElement object should be
* evaluated/integrated in the evaluate() and integrate() functions.
*/
void
reinit(const typename Triangulation<dim, spacedim>::cell_iterator &cell,
const ArrayView<const Point<dim>> &unit_points);
/**
* This function interpolates the finite element solution, represented by
* `solution_values`, on the cell and `unit_points` passed to reinit().
*
* @param[in] solution_values This array is supposed to contain the unknown
* values on the element as returned by `cell->get_dof_values(global_vector,
* solution_values)`.
*
* @param[in] evaluation_flags Flags specifying which quantities should be
* evaluated at the points.
*/
void
evaluate(const ArrayView<const Number> & solution_values,
const EvaluationFlags::EvaluationFlags &evaluation_flags);
/**
* This function multiplies the quantities passed in by previous
* submit_value() or submit_gradient() calls by the value or gradient of the
* test functions, and performs summation over all given points. This is
* similar to the integration of a bilinear form in terms of the test
* function, with the difference that this formula does not include a `JxW`
* factor. This allows the class to naturally embed point information
* (e.g. particles) into a finite element formulation. Of course, by
* multiplication of a `JxW` information of the data given to
* submit_value(), the integration can also be represented by this class.
*
* @param[out] solution_values This array will contain the result of the
* integral, which can be used to during
* `cell->set_dof_values(solution_values, global_vector)` or
* `cell->distribute_local_to_global(solution_values, global_vector)`. Note
* that for multi-component systems where only some of the components are
* selected by the present class, the entries not touched by this class will
* be zeroed out.
*
* @param[in] integration_flags Flags specifying which quantities should be
* integrated at the points.
*
*/
void
integrate(const ArrayView<Number> & solution_values,
const EvaluationFlags::EvaluationFlags &integration_flags);
/**
* Return the value at quadrature point number @p point_index after a call to
* FEPointEvaluation::evaluate() with EvaluationFlags::value set, or
* the value that has been stored there with a call to
* FEPointEvaluation::submit_value(). If the object is vector-valued, a
* vector-valued return argument is given.
*/
const value_type &
get_value(const unsigned int point_index) const;
/**
* Write a value to the field containing the values on points
* with component point_index. Access to the same field as through
* get_value(). If applied before the function FEPointEvaluation::integrate()
* with EvaluationFlags::values set is called, this specifies the value
* which is tested by all basis function on the current cell and
* integrated over.
*/
void
submit_value(const value_type &value, const unsigned int point_index);
/**
* Return the gradient in real coordinates at the point with index
* `point_index` after a call to FEPointEvaluation::evaluate() with
* EvaluationFlags::gradient set, or the gradient that has been stored there
* with a call to FEPointEvaluation::submit_gradient(). The gradient in real
* coordinates is obtained by taking the unit gradient (also accessible via
* get_unit_gradient()) and applying the inverse Jacobian of the mapping. If
* the object is vector-valued, a vector-valued return argument is given.
*/
const gradient_type &
get_gradient(const unsigned int point_index) const;
/**
* Return the gradient in unit coordinates at the point with index
* `point_index` after a call to FEPointEvaluation::evaluate() with
* EvaluationFlags::gradient set, or the gradient that has been stored there
* with a call to FEPointEvaluation::submit_gradient(). If the object is
* vector-valued, a vector-valued return argument is given. Note that when
* vectorization is enabled, values from several points are grouped
* together.
*/
const gradient_type &
get_unit_gradient(const unsigned int point_index) const;
/**
* Write a contribution that is tested by the gradient to the field
* containing the values on points with the given `point_index`. Access to
* the same field as through get_gradient(). If applied before the function
* FEPointEvaluation::integrate(EvaluationFlags::gradients) is called, this
* specifies what is tested by all basis function gradients on the current
* cell and integrated over.
*/
void
submit_gradient(const gradient_type &, const unsigned int point_index);
/**
* Return the Jacobian of the transformation on the current cell with the
* given point index. Prerequisite: This class needs to be constructed with
* UpdateFlags containing `update_jacobian`.
*/
DerivativeForm<1, dim, spacedim>
jacobian(const unsigned int point_index) const;
/**
* Return the inverse of the Jacobian of the transformation on the current
* cell with the given point index. Prerequisite: This class needs to be
* constructed with UpdateFlags containing `update_inverse_jacobian` or
* `update_gradients`.
*/
DerivativeForm<1, spacedim, dim>
inverse_jacobian(const unsigned int point_index) const;
/**
* Return the position in real coordinates of the given point index among
* the points passed to reinit().
*/
Point<spacedim>
real_point(const unsigned int point_index) const;
/**
* Return the position in unit/reference coordinates of the given point
* index, i.e., the respective point passed to the reinit() function.
*/
Point<dim>
unit_point(const unsigned int point_index) const;
private:
/**
* Common setup function for both constructors. Does the setup for both fast
* and slow path.
*
* @param first_selected_component For multi-component FiniteElement
* objects, this parameter allows to select a range of `n_components`
* components starting from this parameter.
*/
void
setup(const unsigned int first_selected_component);
/**
* Pointer to the Mapping object passed to the constructor.
*/
SmartPointer<const Mapping<dim, spacedim>> mapping;
/**
* Pointer to the FiniteElement object passed to the constructor.
*/
SmartPointer<const FiniteElement<dim>> fe;
/**
* Description of the 1D polynomial basis for tensor product elements used
* for the fast path of this class using tensor product evaluators.
*/
std::vector<Polynomials::Polynomial<double>> poly;
/**
* Store whether the polynomials are linear with nodes at 0 and 1.
*/
bool polynomials_are_hat_functions;
/**
* Renumbering between the unknowns of unknowns implied by the FiniteElement
* class and a lexicographic numbering used for the tensorized code path.
*/
std::vector<unsigned int> renumber;
/**
* Temporary array to store the `solution_values` passed to the evaluate()
* function in a format compatible with the tensor product evaluators. For
* vector-valued setups, this array uses a `Tensor<1, n_components>` type to
* collect the unknowns for a particular basis function.
*/
std::vector<value_type> solution_renumbered;
/**
* Temporary array to store a vectorized version of the `solution_values`
* computed during `integrate()` in a format compatible with the tensor
* product evaluators. For vector-valued setups, this array uses a
* `Tensor<1, n_components, VectorizedArray<Number>>` format.
*/
AlignedVector<typename internal::FEPointEvaluation::EvaluatorTypeTraits<
dim,
n_components,
VectorizedArray<Number>>::value_type>
solution_renumbered_vectorized;
/**
* Temporary array to store the values at the points.
*/
std::vector<value_type> values;
/**
* Temporary array to store the gradients in unit coordinates at the points.
*/
std::vector<gradient_type> unit_gradients;
/**
* Temporary array to store the gradients in real coordinates at the points.
*/
std::vector<gradient_type> gradients;
/**
* Number of unknowns per component, i.e., number of unique basis functions,
* for the chosen FiniteElement (or base element).
*/
unsigned int dofs_per_component;
/**
* The first selected component in the active base element.
*/
unsigned int component_in_base_element;
/**
* For complicated FiniteElement objects this variable informs us about
* which unknowns actually carry degrees of freedom in the selected
* components.
*/
std::vector<std::array<bool, n_components>> nonzero_shape_function_component;
/**
* The desired update flags for the evaluation.
*/
const UpdateFlags update_flags;
/**
* The FEValues object underlying the slow evaluation path.
*/
std::shared_ptr<FEValues<dim, spacedim>> fe_values;
/**
* Pointer to mapping info on the fly computed during reinit.
*/
std::unique_ptr<NonMatching::MappingInfo<dim, spacedim>>
mapping_info_on_the_fly;
/**
* Pointer to currently used mapping info (either on the fly or external
* precomputed).
*/
SmartPointer<NonMatching::MappingInfo<dim, spacedim>> mapping_info;
/**
* The reference points specified at reinit().
*/
std::vector<Point<dim>> unit_points;
/**
* Bool indicating if fast path is chosen.
*/
bool fast_path;
};
// ----------------------- template and inline function ----------------------
template <int n_components, int dim, int spacedim, typename Number>
FEPointEvaluation<n_components, dim, spacedim, Number>::FEPointEvaluation(
const Mapping<dim> & mapping,
const FiniteElement<dim> &fe,
const UpdateFlags update_flags,
const unsigned int first_selected_component)
: mapping(&mapping)
, fe(&fe)
, update_flags(update_flags)
, mapping_info_on_the_fly(
std::make_unique<NonMatching::MappingInfo<dim, spacedim>>(mapping,
update_flags))
, mapping_info(mapping_info_on_the_fly.get())
{
setup(first_selected_component);
}
template <int n_components, int dim, int spacedim, typename Number>
FEPointEvaluation<n_components, dim, spacedim, Number>::FEPointEvaluation(
NonMatching::MappingInfo<dim, spacedim> &mapping_info,
const FiniteElement<dim> & fe,
const unsigned int first_selected_component)
: mapping(&mapping_info.get_mapping())
, fe(&fe)
, update_flags(mapping_info.get_update_flags())
, mapping_info(&mapping_info)
{
setup(first_selected_component);
}
template <int n_components, int dim, int spacedim, typename Number>
void
FEPointEvaluation<n_components, dim, spacedim, Number>::setup(
const unsigned int first_selected_component)
{
AssertIndexRange(first_selected_component + n_components,
fe->n_components() + 1);
bool same_base_element = true;
unsigned int base_element_number = 0;
component_in_base_element = 0;
unsigned int component = 0;
for (; base_element_number < fe->n_base_elements(); ++base_element_number)
if (component + fe->element_multiplicity(base_element_number) >
first_selected_component)
{
if (first_selected_component + n_components >
component + fe->element_multiplicity(base_element_number))
same_base_element = false;
component_in_base_element = first_selected_component - component;
break;
}
else
component += fe->element_multiplicity(base_element_number);
if (internal::FEPointEvaluation::is_fast_path_supported(*mapping) &&
internal::FEPointEvaluation::is_fast_path_supported(
*fe, base_element_number) &&
same_base_element)
{
internal::MatrixFreeFunctions::ShapeInfo<double> shape_info;
shape_info.reinit(QMidpoint<1>(), *fe, base_element_number);
renumber = shape_info.lexicographic_numbering;
dofs_per_component = shape_info.dofs_per_component_on_cell;
poly = internal::FEPointEvaluation::get_polynomial_space(
fe->base_element(base_element_number));
polynomials_are_hat_functions =
(poly.size() == 2 && poly[0].value(0.) == 1. &&
poly[0].value(1.) == 0. && poly[1].value(0.) == 0. &&
poly[1].value(1.) == 1.);
fast_path = true;
}
else
{
nonzero_shape_function_component.resize(fe->n_dofs_per_cell());
for (unsigned int d = 0; d < n_components; ++d)
{
const unsigned int component = first_selected_component + d;
for (unsigned int i = 0; i < fe->n_dofs_per_cell(); ++i)
{
const bool is_primitive =
fe->is_primitive() || fe->is_primitive(i);
if (is_primitive)
nonzero_shape_function_component[i][d] =
(component == fe->system_to_component_index(i).first);
else
nonzero_shape_function_component[i][d] =
(fe->get_nonzero_components(i)[component] == true);
}
}
fast_path = false;
}
}
template <int n_components, int dim, int spacedim, typename Number>
void
FEPointEvaluation<n_components, dim, spacedim, Number>::reinit(
const typename Triangulation<dim, spacedim>::cell_iterator &cell,
const ArrayView<const Point<dim>> & unit_points)
{
// reinit is only allowed for mapping computation on the fly
AssertThrow(mapping_info_on_the_fly.get() != nullptr, ExcNotImplemented());
mapping_info->reinit(cell, unit_points);
if (!fast_path)
{
fe_values = std::make_shared<FEValues<dim, spacedim>>(
*mapping,
*fe,
Quadrature<dim>(
std::vector<Point<dim>>(unit_points.begin(), unit_points.end())),
update_flags);
fe_values->reinit(cell);
}
this->unit_points =
std::vector<Point<dim>>(unit_points.begin(), unit_points.end());
if (update_flags & update_values)
values.resize(unit_points.size(), numbers::signaling_nan<value_type>());
if (update_flags & update_gradients)
gradients.resize(unit_points.size(),
numbers::signaling_nan<gradient_type>());
}
template <int n_components, int dim, int spacedim, typename Number>
void
FEPointEvaluation<n_components, dim, spacedim, Number>::evaluate(
const ArrayView<const Number> & solution_values,
const EvaluationFlags::EvaluationFlags &evaluation_flag)
{
const bool precomputed_mapping = mapping_info_on_the_fly.get() == nullptr;
if (precomputed_mapping)
{
unit_points = mapping_info->get_unit_points();
if (update_flags & update_values)
values.resize(unit_points.size(), numbers::signaling_nan<value_type>());
if (update_flags & update_gradients)
gradients.resize(unit_points.size(),
numbers::signaling_nan<gradient_type>());
}
if (unit_points.empty())
return;
AssertDimension(solution_values.size(), fe->dofs_per_cell);
if (((evaluation_flag & EvaluationFlags::values) ||
(evaluation_flag & EvaluationFlags::gradients)) &&
fast_path)
{
// fast path with tensor product evaluation
if (solution_renumbered.size() != dofs_per_component)
solution_renumbered.resize(dofs_per_component);
for (unsigned int comp = 0; comp < n_components; ++comp)
for (unsigned int i = 0; i < dofs_per_component; ++i)
internal::FEPointEvaluation::
EvaluatorTypeTraits<dim, n_components, Number>::read_value(
solution_values[renumber[(component_in_base_element + comp) *
dofs_per_component +
i]],
comp,
solution_renumbered[i]);
// unit gradients are currently only implemented with the fast tensor
// path
unit_gradients.resize(unit_points.size(),
numbers::signaling_nan<gradient_type>());
const std::size_t n_points = unit_points.size();
const std::size_t n_lanes = VectorizedArray<Number>::size();
for (unsigned int i = 0; i < n_points; i += n_lanes)
{
// convert to vectorized format
Point<dim, VectorizedArray<Number>> vectorized_points;
for (unsigned int j = 0; j < n_lanes && i + j < n_points; ++j)
for (unsigned int d = 0; d < dim; ++d)
vectorized_points[d][j] = unit_points[i + j][d];
// compute
const auto val_and_grad =
internal::evaluate_tensor_product_value_and_gradient(
poly,
solution_renumbered,
vectorized_points,
polynomials_are_hat_functions);
// convert back to standard format
if (evaluation_flag & EvaluationFlags::values)
for (unsigned int j = 0; j < n_lanes && i + j < n_points; ++j)
internal::FEPointEvaluation::
EvaluatorTypeTraits<dim, n_components, Number>::set_value(
val_and_grad.first, j, values[i + j]);
if (evaluation_flag & EvaluationFlags::gradients)
{
Assert(update_flags & update_gradients ||
update_flags & update_inverse_jacobians,
ExcNotInitialized());
for (unsigned int j = 0; j < n_lanes && i + j < n_points; ++j)
{
internal::FEPointEvaluation::EvaluatorTypeTraits<
dim,
n_components,
Number>::set_gradient(val_and_grad.second,
j,
unit_gradients[i + j]);
gradients[i + j] = static_cast<gradient_type>(
apply_transformation(mapping_info->get_mapping_data()
.inverse_jacobians[i + j]
.transpose(),
unit_gradients[i + j]));
}
}
}
}
else if ((evaluation_flag & EvaluationFlags::values) ||
(evaluation_flag & EvaluationFlags::gradients))
{
// slow path with FEValues
Assert(fe_values.get() != nullptr,
ExcMessage(
"Not initialized. Please call FEPointEvaluation::reinit()!"));
if (evaluation_flag & EvaluationFlags::values)
{
values.resize(unit_points.size());
std::fill(values.begin(), values.end(), value_type());
for (unsigned int i = 0; i < fe->n_dofs_per_cell(); ++i)
{
const Number value = solution_values[i];
for (unsigned int d = 0; d < n_components; ++d)
if (nonzero_shape_function_component[i][d] &&
(fe->is_primitive(i) || fe->is_primitive()))
for (unsigned int q = 0; q < unit_points.size(); ++q)
internal::FEPointEvaluation::
EvaluatorTypeTraits<dim, n_components, Number>::access(
values[q], d) += fe_values->shape_value(i, q) * value;
else if (nonzero_shape_function_component[i][d])
for (unsigned int q = 0; q < unit_points.size(); ++q)
internal::FEPointEvaluation::
EvaluatorTypeTraits<dim, n_components, Number>::access(
values[q], d) +=
fe_values->shape_value_component(i, q, d) * value;
}
}
if (evaluation_flag & EvaluationFlags::gradients)
{
gradients.resize(unit_points.size());
std::fill(gradients.begin(), gradients.end(), gradient_type());
for (unsigned int i = 0; i < fe->n_dofs_per_cell(); ++i)
{
const Number value = solution_values[i];
for (unsigned int d = 0; d < n_components; ++d)
if (nonzero_shape_function_component[i][d] &&
(fe->is_primitive(i) || fe->is_primitive()))
for (unsigned int q = 0; q < unit_points.size(); ++q)