SIFEL kernel (master)

Version's name: SIFEL kernel (master) ; a version of the SIFEL kernel program.
Repository: [home] and version downloads: [.zip] [.tar.gz] [.tar.bz2] [.tar]
Patterns and behaviours:

Inefficient user implementation of well-known math problem

Recommended best-practices:

Leverage optimized math libraries

- Available version(s):

SIFEL kernel (factorization by math library)

Most of the time in the studied SIFEL application is consumed by a matrix factorization that computes the Schur complement. This routine was manually implemented for sparse symmetric skyline matrix format by the authors of the application. As the factorization is implemented using straightforward math formulas to be easy to read, it is most likely not efficient and not comparable to some established versions implemented in math libraries. For given test cases, the factorization takes more than 90 % of the runtime.

This project has received funding from the European Union's Horizon 2020 research and innovation programme under grant agreements No 676553 (POP1) and 824080 (POP2).

Currently, the project receives funding from the European High-Performance Computing Joint Undertaking (JU) under grant agreement No 101143931 (POP3). The JU receives support from the European Union's Horizon Europe research and innovation programme and Spain, Germany, France, Portugal and the Czech Republic.