skip to main content
10.1145/96877.96932acmconferencesArticle/Chapter ViewAbstractPublication PagesissacConference Proceedingsconference-collections
Article
Free Access

Complexity of irreducibility testing for a system of linear ordinary differential equations

Authors Info & Claims
Published:01 July 1990Publication History

ABSTRACT

Let a system of linear ordinary differential equations of the first order Y′ = AY be given, where A is n × n matrix over a field F(X), assume that the degree degX(A) < d and the size of any coefficient occurring in A is at most M. The system Y′ = AY is called reducible if it is equivalent (over the field F(X)) to a system Y&prime1 = A1Y1 with a matrix A1 of the form A1 = (A1,1 0) (A2,1 A2,2)

An algorithm is described for testing irreducibility of the system with the running time exp(M(d2n)d2n).

References

  1. BBH 88.Beukers, F., Brownawell, D. and Heckman, G., Siegel Normality, Ann. Math. 127 (1988), pp. 279-308.Google ScholarGoogle ScholarCross RefCross Ref
  2. CG 83.Chistov, A. L. and Grigoriev, D. Yu., Subezponential-lime Solving $ysiems of Algebraic Equations, volumes i and II (1983), Preprints LOMI E-9-83 and E-10-83, Leningrad.Google ScholarGoogle Scholar
  3. CL 55.Coddington, E. and Levinson, N., Theory of Ordinary Differeniial Equations, McGraw- Hill, New York (1955).Google ScholarGoogle Scholar
  4. Gr 86.Grigoriev, D. 'flu., Computational Complexity in Polynomial Algebra, Proceedings of the International Congress of Mathematicians, volume 2, Berkeley (1986), pp. 1452- 1460.Google ScholarGoogle Scholar
  5. Gr 90.Grigoriev, D. Yu., Complexity of Factoring and Calculating the CCD of Linear Differential Operators, J. Symbol. Comput. (1990), to appear. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Ka 57.Kaplanski, I., An Introduction to Differential Algebra, Hermann, Paris (1957).Google ScholarGoogle Scholar
  7. La 65.Lang, S., Algebra, Addison-Wesley, Reading (1905).Google ScholarGoogle Scholar
  8. Si 81.Singer, M., Liouvillean Solutions of n-th Order Homogeneous Linear Differential Equations, Amer. J. Math. 103 (1981), pp. 661- 682.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Complexity of irreducibility testing for a system of linear ordinary differential equations

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        ISSAC '90: Proceedings of the international symposium on Symbolic and algebraic computation
        July 1990
        307 pages
        ISBN:0201548925
        DOI:10.1145/96877

        Copyright © 1990 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 July 1990

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate395of838submissions,47%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader