Skip to main content

Some algorithms of rational function algebra

  • Invited Papers
  • Conference paper
  • First Online:
Eurocal '87 (EUROCAL 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 378))

Included in the following conference series:

  • 167 Accesses

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

Access this chapter

Institutional subscriptions

References

  1. Abramov S.A. On the summation of rational functions. — USSR Comput. Math. Math. Phys., 1971, 11, No. 1.

    Google Scholar 

  2. Abramov S.A. Solution of linear finite-difference equations with constant coefficients in the field of rational functions. — USSR Comrut. Math. Phys., 1974, 14, No. 4.

    Google Scholar 

  3. Abramov S.A. The rational component of the solution of a first-order linear recurrence relation with a rational right side. — USSR Comput. Math. Math. Phys., 1975, 15, No. 4.

    Google Scholar 

  4. Abramov S.A. Second-order finite-difference equations with constant coefficients in the rational function field. — USSR Comput. Math. Math. Phys., 1977, 17, No. 3.

    Google Scholar 

  5. Abramov S.A. Separation of variables in rational functions. — USSR Comput. Math. Math. Phys., 1985, 25, No. 9.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

James H. Davenport

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abramov, S.A. (1989). Some algorithms of rational function algebra. In: Davenport, J.H. (eds) Eurocal '87. EUROCAL 1987. Lecture Notes in Computer Science, vol 378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51517-8_85

Download citation

  • DOI: https://doi.org/10.1007/3-540-51517-8_85

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51517-3

  • Online ISBN: 978-3-540-48207-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics