Computing Levi decompositions in Lie algebras

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