fiat team mailing list archive

[Anders Logg <logg@xxxxxxxxx>]

We'd like to generate code (as part of the UFC code generated by FFC)
for run-time evaluation of basis functions.

For this, we need two things:

1. Extract the coefficients of the basis functions expressed in the
"prime basis" from FIAT.

2. Implement (in C++) efficient evaluation of the prime basis.

What is the proper way to extract the coefficients, and is there a C++
implementation of the basis functions that we could grab from FIAT++?

More specifically, how is the prime basis (Dubiner?) defined for
triangles and tetrahedra?

/Anders