You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
For certain applications using a non-tensor basis, the basis is quite sparse and the basis application can take advantage of this to increase performance. This FsSpMDM implementation in LIBXSMM benchmarks the sparse vs. dense kernels during construction (after JiT) and chooses the faster one. This could be an easy thing to try out in libCEED.
The text was updated successfully, but these errors were encountered:
Another common application which I had in mind is for constructing the discrete gradient interpolation from H1 to H(curl) on an element, or discrete curl from H(curl) to H(div). These are typically very sparse and involve only couplings between dofs sharing a face or edge, for example.
For certain applications using a non-tensor basis, the basis is quite sparse and the basis application can take advantage of this to increase performance. This FsSpMDM implementation in LIBXSMM benchmarks the sparse vs. dense kernels during construction (after JiT) and chooses the faster one. This could be an easy thing to try out in libCEED.
The text was updated successfully, but these errors were encountered: