
- B. F. Caviness, A Lehmer-type Greatest Common Divisor Algorithm for Gaussian Integers, (In preparation).Google Scholar
- B. F. Caviness, M. R. Newton and T. P. Vaughan, The SAC-1 Gaussian-Integer Arithmetic and Polynomial System, (In preparation).Google Scholar
- G. E. Collins,
Algebraic Algorithms (In preparation).Google Scholar - G. E. Collins, Computing Multiplication Inverses in GF(p),
Math, Comp. , Vol. 23, No. 105 (Jan. 1969), pp. 197--200.Google Scholar - G. E. Collins, The SAC-1 List Processing System, University of Wisconsin Computer Sciences Dept. Tech. Report #129 (July 1971), 34 pages.Google Scholar
- G. E. Collins,
et al , The SAC-1 Modular Arithmetic System, University of Wisconsin Computing Center Technical Report #10 (June 1969), 50 pages.Google Scholar - G. E. Collins and D. R. Musser, Analysis of the Pope-Stein Division Algorithm, University of Wisconsin Computer Sciences Department Technical Report #55 (Jan. 1969), 10 pages.Google Scholar
- G. E. Collins and J. R. Pinkert, The Revised SAC-1 Integer Arithmetic System, University of Wisconsin Computing Center Technical Report #9 (Nov. 1968), 50 pages.Google Scholar
- J. D. Dixon, The Number of Steps in the Euclidean Algorithm,
Jour. Number Theory , Vol. 2 (1970), pp. 414--422.Google ScholarCross Ref
- J. D. Dixon, A Simple Estimate for the Number of Steps in the Euclidean Algorithm,
Amer. Math. Monthly , Vol. 78, No. 4 (April 1971), pp. 374--376.Google ScholarCross Ref
- P. Henrici, A Subroutine for Computations with Rational Numbers,
Jour. ACM , Vol. 3, No. 1 (Jan. 1956), pp. 6--9. Google ScholarDigital Library
- E. Horowitz, Modular Arithmetic and Finite Field Theory: A Tutorial,
Proc. of the Second Symposium on Symbolic and Algebraic Manipulation (March 1971), pp. 188--194. Google ScholarDigital Library
- D. E. Knuth, Seminumerical Algorithms,
The Art of Computer Programming , Vol. II, Addison-Wesley Publishing Co., Reading, Mass., 1969, pp. 229--360. Google ScholarDigital Library
- D. E. Knuth, The Art of Computer Programming-Errata et Addenda, Stanford University Computer Science Department Technical Report #STAN-CS-71--194 (Jan. 1971), 28 pages.Google Scholar
- D. E. Knuth, Mathematical Analysis of Algorithms, Stanford University Computer Science Department Technical Report #STAN-CS-71--206 (March 1971), 26 pages.Google Scholar
- R. E. Moore,
Interval Analysis , Prentice-Hall, Inc., Englewood Cliffs, N. J., 1966.Google Scholar - W. S. Brown, On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors,
Jour. ACM , Vol. 18, No. 4 (Oct. 1971), pp. 478--504. Google ScholarDigital Library
- W. S. Brown and J. F. Traub, On Euclid's Algorithm and the Theory of Subresultants,
Jour. ACM , Vol. 18, No. 4 (Oct. 1971), pp. 505--514. Google ScholarDigital Library
- G. E. Collins, The SAC-1 Polynomial System, University of Wisconsin Computer Sciences Department Technical Report #115 (March 1971), 66 pages.Google Scholar
- G. E. Collins, The SAC-1 Polynomial GCD and Resultant System (In preparation).Google Scholar
- G. E. Collins, Subresultants and Reduced Polynomial Remainder Sequences,
Jour. ACM , Vol. 14, No. 1 (Jan. 1967), pp. 128--142. Google ScholarDigital Library
- G. E. Collins, et al, The SAC-1 Modular Arithmetic System, University of Wisconsin Computing Center Technical Report #10 (June 1969), 50 pages.Google Scholar
- G. E. Collins, The Calculation of Multivariate Polynomial Resultants,
Jour. ACM , Vol. 18, No. 4 (Oct. 1971), pp. 515--532. Google ScholarDigital Library
- I. N. Herstein,
Topics in Algebra , Ginn & Co., Waltham, 1964.Google Scholar - N. Jacobson,
Lectures in Abstract Algebra , Vol. 1 (Basic Concepts ), D. Van Nostrand Co., New York, 1951.Google Scholar - D. E. Knuth,
The Art of Computer Programming , Vol. 1 (1968), Vol. II (1969), Addison-Wesley, Reading, Mass. Google ScholarDigital Library
- J. D. Lipson, Chinese Remainder and Interpolation Algorithms,
Proc. of the Second Symposium on Symbolic and Algebraic Manipulation (March 1971), pp. 372--391. Google ScholarDigital Library
- B. L. van der Waerden,
Modern Algebra , Vol. I, Ungar Publ. Co., New York, 1953 (second ed.).Google Scholar - E. H. Bareiss, Computational Solutions of Matrix Problems over an Integral Domain, Argonne National Laboratory Tech. Memo. No. 222 (Dec. 1970), 76 pages.Google Scholar
- E. R. Berlekamp,
Algebraic Coding Theory , McGraw-Hill, New York, 1968.Google Scholar - E. R. Berlekamp, Factoring Polynomials over Large Finite Fields,
Math. Comp. , Vol. 24, No. 111 (July 1970), pp. 713--735.Google ScholarCross Ref
- I. Borosh and A. S. Fraenkel, Exact Solutions of Linear Equations with Rational Coefficients by Congruence Techniques,
Math. Comp. , Vol. 20, No. 93 (Jan. 1966), pp. 107--112.Google Scholar - S. Cabay, Exact Solution of Linear Equations,
Proc. of the Second Symposium on Symbolic and Algebraic Manipulation (March 1971), pp. 392--398. Google ScholarDigital Library
- G. E. Collins and L. E. Heindel, The SAC-1 Polynomial Real Zero System, University of Wisconsin Computer Sciences Department Technical Report #93 (August 1970), 72 pages.Google Scholar
- G. E. Collins, The SAC-1 Rational Function System, University of Wisconsin Computer Sciences Department Technical Report #135 (Sept. 1971), 31 pages.Google Scholar
- G. E. Collins and M. T. McClellan, The SAC-1 Polynomial Linear Algebra System, University of Wisconsin Computer Sciences Department Technical Report (In preparation).Google Scholar
- G. E. Collins and D. R. Musser, The SAC-1 Polynomial Factorization system, University of Wisconsin Computer Sciences Department Technical Report (In preparation).Google Scholar
- L. E. Heindel, Algorithms for Exact Polynomial Root Calculation, Ph. D. Thesis, University of Wisconsin Computer Sciences Department, Aug. 1970, 153 pages. Google Scholar
Digital Library
- L. E. Heindel, Integer Arithmetic Algorithms for Polynomial Real Zero Determination,
Jour. ACM , Vol. 18, No. 4 (Oct. 1971), pp. 533--548. Google ScholarDigital Library
- J. A. Howell and R. T. Gregory, An Algorithm for Solving Linear Algebraic Equations Using Residue Arithmetic,
BIT , Vol. 9 (1969), pp. 200--224 and pp. 324--337.Google Scholar - J. A. Howell and R. T. Gregory, Solving Systems of Linear Algebraic Equations Using Residue Arithmetic,
BIT , Vol. 10 (1970), pp. 23--27.Google Scholar - D. E. Knuth,
The Art of Computer Programming , Vol. I (1968), Vol. II (1969), Addison-Wesley, Reading, Mass. Google ScholarDigital Library
- M. Marden,
The Geometry of Zeros of a Polynomial in a Complex Variable , Mathematical Surveys No. III, Amer. Math. Soc., Providence, 1949.Google Scholar - M. T. McClellan, The Exact Solution of Systems of Linear Equations with Polynomial Coefficients, University of Wisconsin Computer Sciences Department Technical Report #136 (Sept. 1971), Ph. D. Thesis, 258 pages.Google Scholar
Digital Library
- D. R. Musser, Algorithms for Polynomial Factorization, University of Wisconsin Computer Sciences Department Technical Report #139 (Sept. 1971), Ph. D. Thesis, 174 pages. Google Scholar
Digital Library
- H. Zassenhaus, On Hensel Factorization I,
Jour. Number Theory , Vol. 1 (1969), pp. 291--311.Google ScholarCross Ref
- W. S. Brown, Rational Exponential Expressions and a Conjecture Concerning π and e,
Amer. Math. Monthly , Vol. 76, No. 1 (Jan. 1969), pp. 28--34.Google Scholar - B. F. Caviness, On Canonical Forms and Simplification,
Jour. ACM , Vol. 17, No. 2 (April 1970), pp. 385--396. Google ScholarDigital Library
- B. F. Caviness, M. R. Newton and T. P. Vaughan, The SAC-1 Gaussian-Integer Arithmetic and Polynomial System, (In preparation).Google Scholar
- B. F. Caviness, P. L. Pollack and C. M. Rubald, An Existence Lemma for Canonical Forms in Symbolic Mathematics,
Info. Proc. Letters , Vol. 1 (1971), pp. 45--46.Google ScholarDigital Library
- G. E. Collins and E. Horowitz, The SAC-1 Partial Fraction Decomposition and Rational Function Integration System, University of Wisconsin, Computer Sciences Department Report #80 (Feb. 1970), 47 pages.Google Scholar
- M. Davis,
Computability and Unsolvability , McGraw-Hill Book Company, Inc., New York, 1958.Google Scholar - E. Horowitz, Algorithms for Partial Fraction Decomposition and Rational Function Integration,
Proc. of the Second Symposium on Symbolic and Algebraic Manipulation (March 1971), pp. 441--457. Google ScholarDigital Library
- E. Horowitz, Algorithms for Symbolic Integration of Rational Functions, Ph. D. Thesis, University of Wisconsin Computer Sciences Department (Nov. 1969), 132 pages.Google Scholar
- S. C. Johnson, On the Problem of Recognizing Zero,
Jour. ACM , Vol. 18, No. 4 (Oct. 1971), pp. 559--565. Google ScholarDigital Library
- Ju. V. Matijasevic, Enumerable Sets are Diophantine,
Soviet Math. Dokl ., Vol. 11 (1970).Google Scholar - J. Moses, Symbolic Integration: The Stormy Decade,
Comm. ACM , Vol. 14, No. 8 (Aug. 1971), pp. 548--560. Google ScholarDigital Library
- D. Richardson, Some Unsolvable Problems Involving Elementary Functions of a Real Variable,
J. Symbolic Logic , Vol. 33 (1968), pp. 514--520.Google ScholarCross Ref
- D. Richardson, Solution of the Identity Problem for Integral Exponential Functions,
Zeitschr. Math. Logik , Vol. 15 (1969), pp. 333--340.Google ScholarCross Ref
- R. H. Risch, The Problem of Integration in Finite Terms,
Trans. Amer. Math. Soc. , Vol. 139 (May 1969), pp. 167--189.Google ScholarCross Ref
- R. H. Risch, The Solution of the Problem of Integration in Finite Terms,
Bull. Amer. Math. Soc. , Vol. 76 (May 1970), pp. 605--608.Google ScholarCross Ref
Index Terms
(auto-classified)Symbolic mathematical computation in a Ph. D. computer science program
Recommendations
Symbolic mathematical computation in a Ph.D. computer science program
SIGCSE '72: Proceedings of the second SIGCSE technical symposium on Education in computer scienceThis 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 ...
Symbolic mathematical computation: a survey
The impact of high-speed computers on the scientific community over the past 25 years has been well documented. Their successful use for numerical computations in a number of areas of engineering and the sciences was followed by an interest in their ...
Relativistic applications of symbolic mathematical computation
The formulation of problems in relativistic mechanics requires a vast amount of tedious algebraic manipulation and symbolic differentiation. Such problems are well suited to symbolic mathematical computation, using one of the computer languages designed ...






Comments