Skip to main content
SpringerLink
Log in

Generalized Bruhat Decomposition in Commutative Domains

  • Conference paper
Computer Algebra in Scientific Computing (CASC 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8136))

Included in the following conference series:

Abstract

Deterministic recursive algorithms for the computation of generalized Bruhat decomposition of the matrix in commutative domain are presented. This method has the same complexity as the algorithm of matrix multiplication.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Grigoriev, D.: Analogy of Bruhat decomposition for the closure of a cone of Chevalley group of a classical series. Soviet Math. Dokl. 23, 393–397 (1981)

    Google Scholar 

  2. Grigoriev, D.: Additive complexity in directed computations. Theoretical Computer Science 19, 39–67 (1982)

    Article  MathSciNet  Google Scholar 

  3. Malaschonok, G.: Fast Generalized Bruhat Decomposition. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2010. LNCS, vol. 6244, pp. 194–202. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Malaschonok, G.I.: Matrix Computational Methods in Commutative Rings. Tambov University Publishing House, Tambov (2002)

    Google Scholar 

  5. Malaschonok, G.I.: Effective matrix methods in commutative domains. In: Krob, D., Mikhalev, A.A., Mikhalev, A.V. (eds.) Formal Power Series and Algebraic Combinatorics, pp. 506–517. Springer, Berlin (2000)

    Chapter  Google Scholar 

  6. Malaschonok, G.I.: A fast algorithm for adjoint matrix computation. Tambov University Reports 5(1), 142–146 (2000)

    Google Scholar 

  7. Malaschonok, G.I.: Fast matrix decomposition in parallel computer algebra. Tambov University Reports 15(4), 1372–1385 (2010)

    MathSciNet  Google Scholar 

  8. Malaschonok, G.I.: On the fast generalized Bruhat decomposition in domains. Tambov University Reports 17(2), 544–550 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tambov State University, Internatsionalnaya 33, 392622, Tambov, Russia

    Gennadi Malaschonok

Authors
  1. Gennadi Malaschonok
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Joint Institute for Nuclear Research, Dubna, Moscow Region, Russia

    Vladimir P. Gerdt

  2. Institut für Mathematik, Universität Kassel, Heinrich-Plett-Straße 40, 34132, Kassel, Germany

    Wolfram Koepf

  3. Technische Universität München, 85748, Garching, Germany

    Ernst W. Mayr

  4. Khristianovich Institute of Theoretical and Applied Mechanics, Russian Academy of Sciences, 630090, Novosibirsk, Russia

    Evgenii V. Vorozhtsov

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Malaschonok, G. (2013). Generalized Bruhat Decomposition in Commutative Domains. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2013. Lecture Notes in Computer Science, vol 8136. Springer, Cham. https://doi.org/10.1007/978-3-319-02297-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-02297-0_20

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-02296-3

  • Online ISBN: 978-3-319-02297-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation