The GAME code, copyrighted from 2003 by Prof. Ruben Specogna and Prof. Francesco Trevisan, is an (hopefully) quick electromagnetic field solver based on the so-called Geometric Approaches. Since 2003 the code was used to successfully solve various electromagnetic problems such electrostatic, magnetostatic, eddy-currents and EM propagation. This code is no longer maintained given that it has been substituted by the CDICE code.

The CDICE code, copyrighted from 2009 by Prof. Ruben Specogna, is our state-of-the-art electromagnetic field solver based on the so-called Geometric Approaches. It is the first software that incorporates facilities for fast cohomology computations and lazy cohomology generators. Moreover it implements all complementary formulations and complementary-dual formulations. Since 2009 the code was used to successfully solve various electromagnetic problems such electrostatic, magnetostatic, eddy-currents and EM propagation.

The CAFE code, copyrighted from 2011 by Prof. Ruben Specogna and Prof. Paolo Bettini, is an electromagnetic field solver tailored for fusion engineering and design. In particular, it is optimized for huge problems (above 10 millions of unknowns). Since 2011 the code was used to successfully solve various electromagnetic problems arising in fusion engineering and design such electrostatic, magnetostatic, stationary conduction and eddy-currents.

The POLYPHO code, copyrighted from 2015 by Prof. Ruben Specogna and Prof. D.A. Di Pietro, is an electromagnetic field solver able to solve Poisson problems on polyhedral meshes and with an arbitrary order of convergence.

This Matlab code, available at http://www.diegm.uniud.it/elettrotecnica/web/tc/, is copyrighted from 2009 by Prof. Ruben Specogna and Prof. Paweł Dłotko. It contains counter-examples of the so-called Spanning Tree Technique (STT) and the Generalized Spanning Tree Technique (GSTT). More informations about those algorithms and about the theory behind them may be found in the paper

P. Dłotko, R. Specogna,

"Critical analysis of the spanning tree techniques'',

SIAM Journal of Numerical Analysis (SINUM), Vol. 48, No. 4, 2010, pp. 1601-1624, regular paper.

This C++ code, available at http://www.diegm.uniud.it/elettrotecnica/web/thinit/, is copyrighted from 2013 by Prof. Ruben Specogna and Prof. Paweł Dłotko. It is a topology-preserving thinning for three-dimensional simplicial complexes. More informations about this algorithm and about the theory behind it may be found in the paper

P. Dłotko, R. Specogna

"Topology preserving thinning for cell complexes"

IEEE Transactions on Image Processing, Vol. 23, No. 10, pp. 4486-4495, 2014, regular paper.

This C++ code, which will be relased soon, compute the cohomology generators of combinatorial 3-manifolds with boundaries.