TY - JFULL
AU - Manuel Ceballos and Juan Nunez and Angel F. Tenorio
PY - 2009/11/
TI - Computational Algorithm for Obtaining Abelian Subalgebras in Lie Algebras
T2 - International Journal of Mathematical and Computational Sciences
SP - 878
EP - 883
VL - 3
SN - 1307-6892
UR - https://publications.waset.org/pdf/11417
PU - World Academy of Science, Engineering and Technology
NX - Open Science Index 34, 2009
N2 - The set of all abelian subalgebras is computationally
obtained for any given finite-dimensional Lie algebra, starting from the nonzero brackets in its law. More concretely, an algorithm
is described and implemented to compute a basis for each nontrivial abelian subalgebra with the help of the symbolic computation package MAPLE. Finally, it is also shown a brief computational study
for this implementation, considering both the computing time and the
used memory.
ER -