Computing Levi Decompositions in Lie algebras | Applicable Algebra in Engineering, Communication and Computing Skip to main content
Log in

Computing Levi Decompositions in Lie algebras

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

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

Authors

Additional information

Received: October 24, 1995; revised version: May 28, 1996

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002000050066