Skip to main content
SpringerLink
Log in

Effective mathematics — the computer algebra viewpoint

  • Conference paper
  • First Online:
Constructive Mathematics

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 873))

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 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.95
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.

6. References

  1. Arnon,D., A Cellular Decomposition Algorithm for Semi-Algebraic Sets. Proc. EUROSAM 79 (Springer Verlag Lecture Notes in Computer Science 72) pp. 301–315. [Expanded in Technical Report 353, Computer Science Department, University of Wisconsin-Madison]

    Google Scholar 

  2. Birch, B.J. & Swinnerton-Dyer, H.P.F., Notes on Elliptic Curves I. J. für reine und angew. Math. 212(1963) pp. 7–23.

    MathSciNet  MATH  Google Scholar 

  3. Coates, J., Construction of Rational Functions on a Curve. Proc. Cam. Phil. Soc. 68(1970) pp. 105–123.

    Article  MathSciNet  MATH  Google Scholar 

  4. Collins, G.E. and Loos, R., Polynomial Real Root Isolation by Differentiation. Proc SYMSAC 76 (ACM, New York, 1976) pp. 15–25.

    MATH  Google Scholar 

  5. Davenport,J.H., The Computerisation of Algebraic Geometry. Proc. EUROSAM 79 (Springer Verlag Lecture Notes in Computer Science 72) pp. 119–133.

    Google Scholar 

  6. Davenport,J.H., On the Integration of Algebraic Functions. To appear in Springer Lecture Notes in Computer Science.

    Google Scholar 

  7. Endler,O., Konstruktion von allgemeinen Normalkörpen in beschränkt vielen Schritten. Hausdorff-Gedächtnis-Preisarbeit der Math.-Nat.-Fakultät Bonn 1952.

    Google Scholar 

  8. Fitch,J.P., A Survey of Symbolic Computation in Physics. Proc. EUROSAM 79 (Springer Lecture Notes in Computer Science 72) pp. 30–41.

    Google Scholar 

  9. Fröhlich, A., and Shepherdson, J.C., Effective Procedures in Field Theory. Phil. Trans. Roy. Soc. Ser. A 248(1955–6) pp. 407–432.

    Article  MathSciNet  MATH  Google Scholar 

  10. Gosper,R.W.,Jr., A Decision Procedure for Indefinite hypergeometric Summation. Proc. Nat. Acad. Sci., Jan 1978.

    Google Scholar 

  11. Hardy,G.H., The Integration of Functions of a Single Variable. (2nd. ed.). Cambridge Tract 2, C.U.P.,1916.

    Google Scholar 

  12. Hearn,A.C., REDUCE-2 User's Manual. Computing Physics Group, University of Utah, 1973

    Google Scholar 

  13. Hearn,A.C., Non-Modular Computation of Polynomial Gcd Using Trial Division. Proc. EUROSAM 79 (Springer Verlag Lecture Notes in Computer Science 72) pp.227–239.

    Google Scholar 

  14. Hermann, G., Die Frage der Endlich vielen Schritte in der Theorie der Polynomideale, Math Ann 95(1926) pp. 736–788.

    Article  MathSciNet  MATH  Google Scholar 

  15. Julian, W., Mines, R. and Richman, F., Algebraic Numbers, A Constructive Development. Pacific Journal of Mathematics 74(1978) pp. 91–102.

    Article  MathSciNet  MATH  Google Scholar 

  16. Kaplansky, I., An Introduction to Differential Algebra. Publications de l'Institut de Mathématique de l'Université de Nancago V, (2nd. ed. 1976) Hermann, Paris, 1957.

    Google Scholar 

  17. Kleene, S.C., On Notation for Ordinal Numbers. Journal of Symbolic Logic 3(1938) pp. 150–155.

    Article  MATH  Google Scholar 

  18. Knuth, D.E., The Art of Computer Programming, Vol. II, Seminumerical Algorithms, Second edition, Addison-Wesley, Reading, Mass., 1980.

    Google Scholar 

  19. Kolchin, E.R., Differential Algebra and Algebraic Groups. Academic Press, London, 1973.

    MATH  Google Scholar 

  20. Kovacic,J.J., An Algorithm for Solving Second Order Linear Homogenous Differential Equations. unpublished ms. Brooklyn College, City University of New York.

    Google Scholar 

  21. Kronecker, L., Grundzüge einer arithmetischen Theorie der algebraischen Grossen. J. für reine und angew. Math. 92(1882) pp. 1–122.

    MathSciNet  MATH  Google Scholar 

  22. Moses, J., Symbolic Integration, the stormy decade. Communications ACM 14(1971) pp. 548–560.

    Article  MathSciNet  MATH  Google Scholar 

  23. Ng, E.W., (ed.) Proceedings EUROSAM 1979. Springer Lecture Notes in Computer Science 72, Springer Verlag, New York Heidelberg Berlin, 1979.

    Google Scholar 

  24. Richardson, D., Some Unsolvable Problems Involving Elementary Functions of a Real Variable. Journal of Symbolic Logic 33(1968), pp. 511–520.

    Google Scholar 

  25. Risch, R.H., The Problem of Integration in Finite Terms. Trans. A.M.S. 139(1969) pp. 167–189 (MR 38 5759).

    Article  MathSciNet  MATH  Google Scholar 

  26. Risch, R.H., The Solution of the Problem of Integration in Finite Terms. Bulletin AMS 76(1970) pp. 605–608.

    Article  MathSciNet  MATH  Google Scholar 

  27. Seidenberg, A., Constructions in Algebra, Trans. AMS 197(1974) pp. 273–313.

    Article  MathSciNet  MATH  Google Scholar 

  28. Sims, C.C., The influence of computers on algebra. Proc. Symp. Appl. Math. 20(1974) pp. 13–30.

    Article  MathSciNet  MATH  Google Scholar 

  29. Closed form Solutions to Linear Differential Equations. unpublished.

    Google Scholar 

  30. Trager, B.M., Algebraic Factoring and Rational Function Integration. Proc. SYMSAC 76 (Association for Computing Machinery, New York, 1976), pp. 219–226.

    MATH  Google Scholar 

  31. Trager,B.M., and Davenport,J.H., Factorisation over Finitely Generated Fields. To appear.

    Google Scholar 

  32. van der Waerden, B.L., Eine Bemerkung über die Unzerlegbarkeit von Polynomen, Math. Ann. 102(1930) pp. 738–9.

    Article  MathSciNet  MATH  Google Scholar 

  33. van der Waerden,B.L., Modern Algebra, Frederick Ungar, New York, 1949 (Translated from Moderne Algebra 2nd. ed.).

    Google Scholar 

  34. Yun, D.Y.Y. and Stoutemyer, D.R., Symbolic Mathematical Computation. Encyclopedia of Computer Science and Technology (ed. Belzer, Holzman & Kent) Volume 15 (Supplement) pp. 235–310. Marcel Dekker Inc., New York & Basel.

    Google Scholar 

  35. Zippel,R.E.B., Probabilistic Algorithms for Sparse Polynomials. Proc. EUROSAM 79, (Springer Verlag Lecture Notes in Computer Science 72) pp. 216–226.

    Google Scholar 

Download references

Author information

Author notes

  1. James H. Davenport

    Present address: Emmanual College, Cambridge, England

Authors and Affiliations

  1. Mathematical Sciences Department, IBM Thomas J. Watson Research Center, P.O. Box 218, 10598, Yorktown Heights, N.Y.

    James H. Davenport

Authors
  1. James H. Davenport
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Fred Richman

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Davenport, J.H. (1981). Effective mathematics — the computer algebra viewpoint. In: Richman, F. (eds) Constructive Mathematics. Lecture Notes in Mathematics, vol 873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0090725

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10850-4

  • Online ISBN: 978-3-540-38759-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation