Study of complexity of two algorithms computing some families of nilpotent and solvable Lie algebras
In this paper, we compare two algorithms (introducing their respective implementations with Maple for this reason) which compute, respectively, the commutator relations of two special families of complex Lie algebras: the solvable Lie algebras s_n of nXn complex upper-triangular matrices and the nilpotent Lie algebras n_n of nXn complex strictly uppertriangular matrices. Starting from the source code of the implementation introduced here
for both algorithms, we study some computational differences between them, regarding the computing time and memory used in these implementations, and we also give some numerical data which exemplify them. Finally, the complexity of both algorithms is studied and compared by means of their implementations.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.