Abstract.
We consider the algorithmic problem of computing Levi decompositions in Lie algebras and Wedderburn–Malcev decompositions in associative algebras over the field of rational numbers. We propose deterministic polynomial time algorithms for both problems. The methods are based on the corresponding classical existence theorems. Computational experiences are discussed at the end of the paper.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Author information
Authors and Affiliations
Additional information
Received: October 24, 1995; revised version: May 28, 1996
Rights and permissions
About this article
Cite this article
de Graaf, W., Ivanyos, G., Küronya, A. et al. Computing Levi Decompositions in Lie algebras. AAECC 8, 291–303 (1997). https://doi.org/10.1007/s002000050066
Issue Date:
DOI: https://doi.org/10.1007/s002000050066