Symbolic mathematical computation in a Ph.D. computer science program

This paper describes a graduate course curriculum, currently being taught, in the area of symbolic mathematical computation. The subject area is described and is then followed by a description of the courses. A bibliography for each course is also given. The relationship of the symbolic mathematical computation curriculum to an overall Computer Science curriculum is discussed. Ph.D. theses which have been written are listed and some topics for future research are outlined. The paper ends with a summary of the strengths and weakensses of the curriculum.

[1]  M. H. Protter,et al.  THE SOLUTION OF THE PROBLEM OF INTEGRATION IN FINITE TERMS , 1970 .

[2]  Joseph F. Traub,et al.  On Euclid's Algorithm and the Theory of Subresultants , 1971, JACM.

[3]  S. Cabay.  Exact solution of linear equations , 1971, SYMSAC '71.

[4]  R. Risch.  The problem of integration in finite terms , 1969 .

[5]  E. Horowitz,et al.  Modular arithmetic and finite field theory: A tutorial , 1971, SYMSAC '71.

[6]  Donald E. Knuth,et al.  Mathematical Analysis of Algorithms , 1971, IFIP Congress.

[7]  B. F. Caviness,et al.  An Existence Lemma for Canonical Forms in Symbolic Mathematics , 1971, Inf. Process. Lett..

[8]  George E. Collins,et al.  The SAC-1 Polynomial Linear Algebra System , 1972 .

[9]  Donald E. Knuth,et al.  The Art of Computer Programming--Errata et Addenda , 1971 .

[10]  N. Jacobson.  Lectures In Abstract Algebra , 1951 .

[11]  J. D. Lipson,et al.  Chinese remainder and interpolation algorithms , 1971, SYMSAC '71.

[12]  J. Dixon.  The number of steps in the Euclidean algorithm , 1970 .

[13]  E. Berlekamp.  Factoring polynomials over large finite fields* , 1971, SYMSAC '71.

[14]  Erwin H. Bareiss,et al.  Computational Solutions of Matrix Problems Over an Integral Domain , 1972 .

[15]  J. Wrench.  Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth , 1970 .

[16]  Jo Ann Howell,et al.  SOLVING SYSTEMS OF LINEAR ALGEBRAIC EQUATIONS USING RESIDUE ARITHMETIC. , 1969 .

[17]  Jo Ann Howell,et al.  An algorithm for solving linear algebraic equations using residue arithmetic I , 1969 .

[18]  D. Musser.  Algorithms for polynomial factorization. , 1971 .

[19]  Daniel Richardson,et al.  Some undecidable problems involving elementary functions of a real variable , 1969, Journal of Symbolic Logic.

[20]  J. Dixon.  A Simple Estimate for the Number of Steps in the Euclidean Algorithm , 1971 .

[21]  L. E. Heindel,et al.  The SAC-1 Modular Arithmetic System , 1972 .

[22]  G. E. Collins.  Computing Multiplicative Inverses in GF(p) , 1969 .

[23]  W. S. Brown,et al.  On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors , 1971, JACM.

[24]  Lee E. Heindel.  Algorithms for exact polynomial root calculation , 1970, SIGS.

[25]  H. Zassenhaus.  On Hensel factorization, I , 1969 .

[26]  D. Richardson.  Solution of the identity problem for integral exponential functions , 1969 .

[27]  Jo Ann Howell,et al.  An algorithm for solving linear algebraic equations using residue arithmetic II , 1969 .

[28]  George E. Collins.  The SAC-1 Polynomial GCD and Resultant System , 1972 .

[29]  I. Borosh,et al.  Exact solutions of linear equations with rational coefficients by congruence techniques , 1966 .

[30]  W. Rogosinski,et al.  The Geometry of the Zeros of a Polynomial in a Complex Variable , 1950, The Mathematical Gazette.

[31]  Michael Terence Mc Clellan.  Algorithms for exact solution of systems of linear equations with polynomial coefficients , 1971 .

[32]  Peter Henrici.  A Subroutine for Computations with Rational Numbers , 1956, JACM.

[33]  Martin D. Davis,et al.  Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

[34]  I. M. Sheffer,et al.  Review: Morris Marden, The geometry of the zeros of a polynomial in a complex variable , 1950 .

[35]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[36]  George E. Collins,et al.  The SAC-1 system: An introduction and survey , 1971, SYMSAC '71.

[37]  E. Horowitz.  Algorithms for partial fraction decomposition and rational function integration , 1971, SYMSAC '71.

[38]  W. S. Brown.  Rational Exponential Expressions and a Conjecture Concerning π and e , 1969 .

[39]  Lee E. Heindel,et al.  Integer arithmetic algorithms for polynomial real zero determination , 1971, SYMSAC '71.

[40]  E. Berlekamp.  Factoring polynomials over large finite fields* , 1970, SYMSAC '71.

[41]  B. F. Caviness.  On Canonical Forms and Simplification , 1970, JACM.

[42]  Joel Moses,et al.  Symbolic integration the stormy decade , 1971, SYMSAC '71.

[43]  George E. Collins,et al.  Subresultants and Reduced Polynomial Remainder Sequences , 1967, JACM.

[44]  George E. Collins,et al.  The Calculation of Multivariate Polynomial Resultants , 1971, JACM.

[45]  George E. Collins.  The SAC-1 List Processing System , 1971 .