leff@smu.UUCP (09/18/84)
Table of Contents for Symbolic & Algebraic Computation Computing Supplementum # 4 Loos, R. Introduction .................................................... 1 Buchberger, B. Loos, R. Algebraic Simplification ......................... 11 Neubuser, J. Comuting with Groups and Their Character Tables ............. 45 Norman, A. C. Integration in Finite Terms ................................ 57 Lafon, J. C. Summation in Finite Terms ................................... 71 Collins, G. E. Quantifier Elimination for Real Closed Fields: A Guide to the Literature ......................................................... 79 Collins, G. E., Loos, R.: Real Zeros of Polynomials ...................... 83 Kaltofen, E.: Factorization of Polynomials ............................... 95 Loos, R.: Generalized Polynomial Remainder Sequences ..................... 115 Lauer, M.: Computing by Homomorphic Images ............................... 139 Norman, A. C.: Computing in Transcendental Extensions .................... 160 Loos, R.: Computing in Algebraic Extensions .............................. 173 Collins, G. E., Mignotte, M., Winkler, F.: Arithmetic in Basic Algebraic Domains ............................................................... 189 van Hulzen, J. A., Calmet, J.: Computer Algebra Systems .................. 221 Calmet J., van Hulzen, J. A.: Computer Algebra Applications .............. 245 Mignotte, M.: Some Useful Bounds ......................................... 259 Author and Subject INdex ................................................. 265
leff@smu.UUCP (09/18/84)
Table of Contents for R. H. Rand Computer Algebra in Applied Mathematics Research Notes in Mathematics 94 An Introduction to Macsyma Pitman Advanced Publishing Program Boston London Melbourne Chapter 1. Introduction to MACSYMA ....................................... 1 Example 1. Complex Variables ............................................. 1 Example 2. Euler-Lagrange equation ....................................... 3 Example 3. First Order O.D.E.'s .......................................... 5 Example 4. Period of a nonlinear oscillator .............................. 9 Example 5. Laplace transforms ............................................ 15 Example 6. Eigensolution of a system of O. D. E.'s ....................... 18 Exercise. Boundary Value Problem ......................................... 25 Chapter 2. Housekeeping in MACSYMA ....................................... 31 Disk files ............................................................... 31 Special keys ............................................................. 36 The editor ............................................................... 38 Chapter 3. Programming in MACSYMA ........................................ 41 Example 1. Taylor series solution of O. D. E's ........................... 42 Example 2. Lagrange'S equations .......................................... 52 Example 3. Hamilton's equations .......................................... 57 Exercise. Laplace Transforms ............................................. 64 Chapter 4. Perturbation Methods .......................................... 71 Example 1. Van der Pol's equation ........................................ 71 Example 2. Mathieu's equation ............................................ 87 Example 3. Duffing's equation ............................................ 124 Questions of convergence ................................................. 135 Exercise. The Two Variable Expansion Method .............................. 145 Epilogue. On Bugs ........................................................ 162 Appendix. Sample Batch program ........................................... 164 Glossary of MACSYMA Functions ............................................ 169 References ............................................................... 175 Index .................................................................... 177
leff@smu.UUCP (09/18/84)
Table of Contents for Lecture Notes in Computer Science 142 Springer Verlag Computer Algebra EUROCAL '83 European Computer Algebra Conference London, England March 1983 Edited by J. A. Van Hulzen INTRODUCTION ............................................................. 1 Algorithms 1 - Miscellaneous Integration - What do We Want From the Theory? (Invited Paper) ........... 2 J. H. Davenport The Euclidean Algorithm for Gaussian Integers ............................ 12 H. Rolletschek MultiPolynomial Remainder Sequence and its Application to Linear Diophantine Equations .................................................. 24 A. Furukawa Applications - Miscellaneous Towards Mechanical Solution of the Kahan Ellipse Problem I ................ 36 D. S. Arnon S. F. Smith Automatically Determining Symmetries of Ordinary Differential Equations ... 45 F. Schwartz Algebraic Computation of the Statistics of the Solution of Some Nonlinear Stochastic Differential Equations ....................................... 55 F. Lamnabhi-Lagarrique Gif sur Yvette M. Lamnabhi Characterization of a Linear Differential System with a Regular Singularity 68 A. Hilali Systems and Language Features The Bath Concurrent Lisp Machine .......................................... 78 J. Marti J. P. Fitch The Ecology of Lisp or the case for the Preservation of the Environment ... 91 J. A. Padget The Design of Maple: A Compact, Portable and Powerful Computer Algebra System .................................................................101 B. W. Char, K. O. Geddes, W. M. Gentleman G. H. Gonnet Lisp Compilation Viewed as Provable Semantics Preserving Program Transformation ............................................................116 H. Stoyan Implementing Reduce on a Micro-Computer ...................................128 J. P. Fitch Algorithms 2 - Polynomial Ideal Bases A Note on the complexity of Constructing Grobner Bases ....................137 B. Buchberger Grobner Bases, Gaussian Elimination and Resolution of Systems of Algebraic Equations .................................................................146 D. Lazard The Computation of the Hilbert Function ...................................157 F. Mora H. M. Moller An Algorithm for Constructing Detaching Bases in the Ring of Polynomials Over a Field ..............................................................168 F. Winkler Algorithms 3 - Computational Number Theory On the Problem of Beha Eddin Amuli and the Computation of Height Functions (Invited Paper) .........................................................180 H. G. Zimmer A Procedure for Determining Algebraic Integers of Given Norm ..............194 U. Fincke and M. Pohst Computation of Integral Solutions of a Special Type of Systems of Quadratic Equations ...............................................................203 M. Pohst Algorithms 4 - Factorization Factorization of Sparse Polynomials .......................................214 J. H. Davenport Early Detection of True Factors in Univariate Polynomial Factorization ....225 P. S. Wang On the Complexity of Finding Short Vectors in Integer Lattices ............236 E. Kaltoren Factoring Polynomials Over Algebraic Number Fields ........................245 A. K. Lenstra System Oriented Applications The construction of a Complete Minimal Set of Contextual Normal Forms .....255 M. Rice A Knowledge-Based Approach to User-Friendliness in Symbolic Computing .....267 F. Gardin J. A. Campbell Computer Algebra and VLSI, Prospects for Cross Fertilization ..............275 J. Smit Code Optimization of Multivariate Polynomial schemes: A Pragmatic Approach.286 J. A. van Hulzen Appendix: The Conference Program ....................................................301
leff@smu.UUCP (09/18/84)
Table of Contents for SYSMAC 81 1981 ACM Symposium on Symbolic and Algebraic Computation Session 1. System Design The basis of a computer system for modern algebra ......................... 1 J. Cannon A language for computational algebra ...................................... 6 R. D. Jenks B. M. Trager Characterization of VAX Macsyma ........................................... 14 J. K. Foderaro R. J. Fateman SMP - A Symbolic Manipulation Program ..................................... 20 C. A. Cole and S Wolfram Session 2. Ordinary Differential Equations An extension of Liouville's theorem on integration in finite terms ........ 23 M. F. Singer B. D. Saunders B. F. Caviness Formal solutions of differential equations in the neighborhood of singular points .................................................................. 25 J. Della Dora E. Tournier Elementary first integrals of differential equations ...................... 30 M. J. Prelle M. F. Singer A technique for solving ordinary differential equations using Riemans' P-functions .................................................... 36 S. Watanabe Using Lie transformation groups to find closed form solutions to first order ordinary differntial equations ................. 44 B. Char Session 3. Applied Algebraic Computation The computational complexity of continued fractions (Invited Paper) ....... 51 V. Strassen Newton's iteration and the sparse Hensel algorithm ........................ 68 R. Zippel Session 4. Applied Algebraic Computatin (cont.) Automatic generation of finite difference equations and Fourier stability analyses ................................................................ 73 M. C. Wirth The automatic derivation of periodic solutions to a class of weakly nonlinear differential equations ........................................239 J. P. Fitch A. C. Norman M. A. Moore An algorithmic classification of geometries in general relativity ......... 79 J. Aman A. Karlhede Formulation of design rules for NMR imaging coil by using symbolic manipulation ............................................................ 85 J. F. Schenck M. A. Hussain Computation for conductatnce distributions of percolation lattice cells ... 94 R. Fogelholm Session 5. Algorithm IMplementations Breur's grow factor algorithm in computer algebra .........................100 J. A. van Hulzen User-based integration software ...........................................245 J. P. Fitch An implementation of Kovacic's algorithm for solving second order linear homogenous differential equations .......................................105 B. D. Saunders Implementing a polynomial factorization and GCD package ...................109 P. M. A. Moore A. C. Norman Session 6. Performance Issues Note on probabilistic algorithms in integer and polynomial arithmetic .....117 M. Kaminski A case study in interlanguage communication: fast LISP polynomial operations written in 'C' ...............................................122 R. J. Fateman On the application of array processors to symbol manipulation .............126 R. Beardsworth The optimization of user programs for an algebraic manipulation system ....131 P. D. Pearce R. J. Hicks Views on transportability of LISP and LISP-based systems ..................137 R. J. Fateman Session 7. Linear Algebra Algorithms Algebraic constructions for algorithms (Invited Paper) ....................142 S. Winograd A cancellation free algorithm, with factoring capabilities, for the efficient solution of large sparse sets of equations ....................146 J. Smit Efficient Gaussian eliminatin method for symbolic determinants and linear systems..................................................................155 T. Sasaki and H. Murao Parallelism in algebraic computation and parallel algorithms for symbolic linear systems...........................................................160 T. Sasaki Y. Kanada Symposium Banquet Banquet Address: Algebraic Computation for the masses Joel Moses, MIT, USA.......................................................168 Session 8. Groups, Rings and Algebras Construction of nilpotent Lie algebras over arbitrary fields...............169 R. E. Beck B. Kolman Algorithms for central extensions of Lie algebras..........................175 R. E. Beck B. Kolman Computing and invariant subring of k[x,y]..................................179 R. Neumann Double cosets and searching small groups...................................182 G. Butler Session 9 Polynomials and Rational Functions A generalized class of polynomials that are hard to factor.................188 E. Kaltofen D. R. Musser B. D. Saunders Some inequalities about univariant polynomials.............................195 M. Mignotte Factorization over finitely generated fields...............................200 J. H. Davenport B. M. Trager On solving systems of algebraic equations via ideal bases and elimination theory...................................................................206 M. Pohst D. Y. Y Yun A p-adic algorithm for univariate partial fractions........................212 P. Wang Section 10. Semi-Symbolic Computation Use of VLSI in algebraic computation: some suggestions.....................218 H. T. Kung An Algebraic front-end for the production and use of numeric programs......223 D. H. Lanam Computer Algebra and numerical integration.................................228 R. J. Fateman Tracing occurrences of patterns in symbolic computations...................233 F. Gardin J. A. Campbell Author Index...............................................................249
leff@smu.UUCP (09/18/84)
Table of Contents for EUROCAM '82 European Computer Algebra Conference Marseille, France, April 1982 Springer Verlag Lecture Notes in Computer Science 144 0. INTRODUCTION ........................................................... 1 1. ALGORITHMS I Asymptotically fast algorithms for the numerical multiplication and division of polynomials with complex coefficients. (Invited) ............. 3 A. Schonhage An adaptive hybrid algorithm for multiplying dense polynomials ............ 16 D. Probst V. S. Alagar The construction of multivariate polynomials with preassigned zeros ....... 24 H. M. Moller B. Buchberger Lattices and factorization of polynomials over algebraic number fields .... 32 A. K. Lenstra 2. Algebraic Structures Commutative Algebra and Computer Algebra (Invited) ........................ 40 D. Lazard The Nielsen reduction as key problem to polynomial algorithms in free groups ......................................................... 49 J. Avenhaus K. Madlener The structure of near-rings of small order ................................ 57 J. Angerer G. Pilz Computing double coset representatives for the generation of solvable groups .................................................................. 65 R. Laue On the determination of algebraic number fields of given discriminant ..... 71 M. Pohst 3. Abstract Data Types and Rewrite Rules Rewrite rule theory and abstract data type analysis (Invited) ............. 77 D. R. Musser Deepak Kapur Algebraic specifications: a constructive methodology in logic programming . 91 M. Bergman A theorem-proving approach to the Knuth-Bendix completion algorithm .......101 W. Kuchlin Solving symbolic equations with PRESS .....................................109 L. Sterling A. Bundy L. Byrd R. O'Keefe B. Silver 4. Algorithms II Deterministic versus probabilistic factorization of integral polynomials.. 117 J. Calmet R. Loos On polynomial factorization............................................... 126 D. Lazard Hacijan's algorithm in VAXIMA: improvements and difficulties.............. 135 P. S. Wang The parallel Risch algorithm (I).......................................... 144 J. H. Davenport An algorithm to compute the equations of tangent cones.................... 158 F. Mora 5. Applications I Computer algebra systems viewed by a notorious user (Invited)............. 166 J. A. van Hulzen Implementation of differential geometric objects and functions with an application to extended Maxwell equations................................. 181 P. K. H. Gragert P. H. M. Kersten A sum-substitutor used as trigonometric simplifier........................ 188 L. Hornfeldt Transformation of an intractable problem into a tractable problem: evaluation of a determinant in several variables ........................196 J. A. Campbell F. Gardin Algebraic computation of the solution of some non linear differential equations............................................................... 204 F. Lamnabhi-Lagarrigue M. Lamnabhi 6. Algorithms III Factorization in cylindrical algebraic decomposition (Invited).............212 G. E. Collins Cylindrical algebraic decomposition by quantifier elimination............. 215 D. S. Arnon S. McCallum Algorithms for the computation of free lattices........................... 223 Z. Lomecky Linear algebraic approach for computing polynomial resultant.............. 231 L. Bordoni A. Colagrossi A. Miola 7. Systems The development of a vector-based algebra system (Invited)................ 237 A. C. Norman NLARGEing a Z80 microprocessor............................................ 249 J. P. Fitch J. Marti Escaping from intermediate expression swell: a continuing saga............ 256 J. A. Padget REDUCE - A case study in algebra system development (Invited)............. 263 A. C. Hearn 8. Applications II An algorithm to obtain formal solutions of a linear homogenous differential equation at an irregular singular point.................... 273 J. Della Doro C. Di Crescenzo E. Tournier Symbolic numeric methods in microwave technology.......................... 281 J. Smit J. A. van Hulzen A program in REDUCE for finding explicit solutions to certain ordinary differential equations.................................................. 289 B. Malm An application of MACSYMA to nonlinear systems decoupling................. 294 D. Claude P. Dufresne
leff@smu.UUCP (09/18/84)
Table of Contents for SIGSAM May 1984 1 From the Chair 2-3 Treasurer's Report 4 Obituary: Carl Engelman ANNOUNCEMENTS 5 NYU Computer Algebra Conference 6 3rd MACSYMA Conference 7 ICME 5 Session on Symbolic Mathmatical Systems 8-9 EUROCAL '85 Conference 10-11 "PROLOG" to EUROCAL 85 CONTRIBUTIONS 12-18 A. Krasinski, ORTOCARTAN - A Program for Algebraic Calculations in General Relativity 19-20 M. E. Stickel A Note on Leftmost-innermost Term Reduction 20 F. Winkler & B. Buchberger A Criterion for Eliminating Unnecessary Reductions in the Knuth-Bendix Algortih (ABSTRACT) 21-24 P. Smith & L. Sterling Of Integration by Man and Machine 25-30 M. Wester S. Steinberg An Extension to MACSYMA's Concept of Functional Differentiation 31-42 B. Char, K. Geddes & G. Gonnet The MAPLE Computation System 43-47 S. S. Abi-Ezzi Clarification to the Symbolic Mode in REDUCE 48-49 G. Gonnet, B. Char and K. O. Geddes Solution of a General System of Equations (PROBLEM) 50-75 SIGSAM Membership List (January 1984)
leff@smu.UUCP (09/18/84)
Report on Volume 18, Number 3 of SIGSAM Bulletin
Unfortunately, this issue had the May 1984 Table of Contents on the
cover due to some clerical error. The issue consists almost exclusively
of papers on ideas for the furutre of symbolic computation. This
was requested by the program chairman for EUROCAL 85, Bruno Buchberger.
The papers are by: (I have listed titles when they were something
other than a variation on "Future of Symbolic Computation")
Gerard Huet
Richard Zippel
H. Zassenhaus: The efficiency of mathematical models
Richard Fateman
Regina Llopis de Trias: A New Generation of Symbolic and Algebraic Computation
Systems
Ferdinando Mora and Lorenzo Robbiano: The Interplay between Commutative
Algebra and Computer Algebra
Arjen K. Lenstra: Factorization of Polynomials
J. Nievergelt: Computating with Geometric Objects
J. Davenport: Integration in Finite Terms
W. Trinks: Comments from Number Tehory on Computer Algebra
E. V. Krishnamurthy: Functional Programming with Combinators for Symbolic
Computation
H. G. Zimmer: Algorithms in Algebraic Number Theory
W. Bibel: Logica nd Algebraic Compuation
J. A. van Hulzen: The Symbolic-Numeric Interface
A. T. Balaban: Numerican and Non-Numerical Methods in Chemistry:
Present and Future
N. K. Bose: Symbolic and Algebraic Computations in Multidemnsional
Systems Theory
T. Legendi: Cellular Hardware and Symbolic Computation
H. Lunenburg: Write a Book!leff@smu.UUCP (09/19/84)
Table of Contents for EUROSAM 84 International Symposium on Symbolic and Algebraic Computation Cambridge, England July 1984 Springer Verlag Lecture Notes in Computer Sciences 174 Introduction .............................................................. 1 DIFFERENTIAL EQUATIONS Homogenous Linear Difference Equation (Frobenius - Boole Method ) ......... 2 J. Della Dora, E. Tournier An Experiment Toward a General Quadrature for Second Order Linear Ordinary Different Equations by Symbolic Computation ............................... 13 S. Watanabe Operatioal Calculus Techniques for Solving Differential Equations ......... 23 M. Glinos, B. D. Saunders APPLICATIONS 1 On the Application of Symbolic Computation to Nonlinear Control THeory .... 35 G. Cesareo, R. Marino Quartic equations and Algorithms for Riemann Tenson Classification ........ 47 J. E. Aman, R. A. D'Inverno, G. C. Joly, M. A H. MacCallum Symbolic Computation and the Dirichlet Problem ............................ 59 R. W. Wilkerson Simplification of Polynomials in n Variables .............................. 64 G. Viry On the Equivalence of Hierarchical and Non-Hierarchical Rewriting on Conditional Term Rewriting Systems ........................................ 74 M. Navarro, F. Orejas Implemenation of a p-adic Package for Polynomial Factorization and Other Related Operations ........................................................ 86 P. S. Wang ALGEBRAIC NUMBER COMPUTATION Computations on Curves ....................................................100 C. Dicrescenzo, D. Duval Detecting Torsion Divisors on Curves of Genus 2 ...........................108 T. G. Berry Computation in Radical Extensions..........................................115 H. Najid-Zejli Languages for Symbolic Computing A Primer: 11 Keys to New Scratchpad .......................................123 R. D. Jenks A Pure and Really Simple Initial Functional Algebraic Language ............148 J. P. Fitch J. A. Padget GROEBNER BASIS ALGORITHMS Some Effectivity Problems in Polynomial Ideal Theory ......................159 M. Giusti Upper and Lower Bounds for the Degree of Groebner Bases....................172 H. M. Moller F. Mora On the Complexity of the Groebner-Bases Algorithm over K[x,y,z]............184 F. Winkler Algorithms for Computing Groebner Bases of Polynomial Ideals over Various Euclidean Rings............................................................195 A. Kandri-Rody D. Kapur COMPUTATIONAL GROUP THEORY Computation with Rational Subsets of Confluent Groups .....................207 R. H. Gilman CAMAC2: A Portable System for Combinatorial and Algebraic Computation......213 J. S. Leon Polynomial Time Algorithms for Galois Groups...............................225 S. Landau APPLICATIONS 2 Code Generation and Optimization for Finite element Analysis...............237 P. S. Wang, T. Y. P. Chang, J. A. van Hulzen A Comparison of Algorithms for the Symbolic Computation of Pade Approximants...............................................................248 S. R. Czapor, K. O. Geddes Automatic Error Cumulation Control.........................................260 R. J. A. Hulshof, J. A. van Hulzen FACTORIZATION AND GCD COMPUTATIONS Polynomial Factorization by Root Approximation.............................272 A. K. Lenstra Effective Hilbert Irreducibility...........................................277 E. Kaltofen GCDHEU: Heuristic Polynomial GCD Algorithm based on Integer GCD Computation ...............................................................285 B. W. Char K. O. Geddes G. H. Gonnet A New Lifting Process for the Multivariate Polynomial Factorization .......297 D. Lugiez NUMBER THEORY ALGORITHMS Explicit Construction of the Hilbert Class Fields of Imaginary Quadratic Fields iwth Class Numbers 7 and 11 ........................................310 E. Kaltofen, N. Yui On a Simple Primality Testing Algorithm ...................................321 M. -D. A. Huang A Criterion for the Equivalence of Two Ideals .............................333 J. Buchmann INTEGRATION y' + fy = g ...............................................................341 J. H. Davenport Integration in Finite Terms with Special Functions: A Progress Report......351 G. W. Cherry B. F. Caviness A Note on the Risch differential Equation..................................359 E. Kaltofen SOLUTION OF EQUATIONS Approximation by Continued Fraction of a Polynomial Real Root..............367 K. Thull On the Automatic Resolution of Certain Diophantine Equations...............378 M. Mignotte On Pseudo-Resultants.......................................................386 M. Rothstein
leff@smu.UUCP (09/19/84)
#N:smu:35800010:000:587
smu!leff Sep 19 07:18:00 1984
Dr. David Y. Y. Yun has asked me to obtain a list of conference articles
pertaining to symbolic math that are 1) useful and 2) hard to find.
This is being done for Academic Press which is planning to produce a
compendium of such articles. Please mail your suggested articles to
be included to me and I will prepare a list for Dr. Yun.
Thank you for your cooperation.
-----------------------------------------------------------------------------
From the domain of Leff:
Usenet {allegra,ihnp4,ctvax}!convex!smu!leff
CSNET or ARPANET leff%smu@csnet-relay Land Line:(214)-692-3712leff@smu.UUCP (10/04/84)
Although this has appeared in other news groups and in SIGSAM, I thought
it would be appropriate to repost here.
Call for Papers
Journal of Symbolic Computation
computer algebra
automated theorem proving
automatic programming
algorithmic geometry
Academic Press
Subsidiary of Harcourt Brace Jovanovich, Publishers
Editor
B. Buchberger
Johannes Kepler Universitat, A 4040 Linz, Austria
Associate Editors:
W. Bibel, Techische Universitat Munchen, Federal Republic of Germany
J. Cannon Rutgers University, USA
B. F. Caviness, University of Delaware, USA
J. H. Davenport, University of Bath, England
K. Fuchi, ICOT, Japan
G. Huet, INRIA, France
R. Loos, Universitat Karlsruhe, Federal Republic of Germany
Z. Manna, Stanford University, USA
J. Nievergelt, ETH, Switzerland
D. Yun, Southern Methodist University, USA
Editorial Statement:
The Journal of Symbolic Computation aims to provide a forum for research in
the algorithmic treatment of all types of symbolic objects, i. e. objects in
formal languages (terms, formulae, programs), algebraic objects (elements in
basic number domains, polynomials, residue classes etc.) and geometrical
objects. Hence, the main areas covered in the journal are:
. computer algebra
. automated theorem proving
. algorithmic geometry
. automatic programming
All three basic aspects of the algorithmic treatment of symbolic objects
will be included in a balanced way:
. mathematical foundations, correctness and complexity of new (sequential
and parallel) algorithms
. implementations of the algorithms in software systems
. applications of the systems as tools for problem solving in the mathematical
and natural sciences
So far, the above subject areas and the various aspects of these areas have
been treated in diverse environments and publications. However, it is
becoming increasingly clear that these areas share many basic algorithmic
ideas. In addition, the algorithmic achievements of these areas should
be made available for the human problem solver in integrated software systems
for symbolic computation. It is the explicit goal of the Journal of Symbolic
Computation to promote the integration of the field of symbolic computation
by establishing one common forum for researchers working in the different
subareas.
Typical topics to be treated in the journal are:
symbolic integration
symbolic summation
symbolic solution of differential equations and of other problems in analysis
term simplification
arithmetic in basic and higher algebraic domains
symbolic solution of equations and systems of equations
computational group theory
computational number theory
computation problems in non-associative and other agebras
algorithmic combinatorics
algorithmic geometry
computational aspects of algebraic geometry
algorithms in coding theory and cryptography
interface between symbolic and numerical algorithms
universal automated theorem proving
unification
automated theorem proving in special theories
automated proof checking
algorithmic proof theory
algorithmic questions in combinatorial logic and lambda calculus
algorithmic logic
automatic program synthesis
automatic program transformation
automatic program verification
symbolic execution of programs
operational semantics of programming languages
algorithmic treatment of abstract data type specifications
interpreters for high-level programs (functional programs, rewrite rule
programs, logic programs)
parallel and other special hardware for symbolic computation
design issues of software systems for symbolic computation
programming languages for symbolic computation
description of working software systems
descriptions of typical systems applications
symbolic computation and teaching of mathematics
Information for Contributers:
The Journal of Symbolic Computation will publish original articles on all
aspects of the algorithmic treatment of symbolic objects(terms, formulae,
programs, algebraic and geometrical objects). The emphasis will be on
mathematical foundation, correctness and complexity of new sequential and
parallel algorithms for symbolic computations. However, the description
of working software systems for symbolic computation and of general new
design principles for symbolic software systems and applications of such
systems for advanced problem solving are also within the scope of the journal.
In addition to original research papers, the Journal of Symbolic Computation
will regularly publish invited tutorial papers on the various subject areas
of symbolic computation and on recent research trends.
Submissions of manuscripts
These should be sent in triplicate to:
B. Buchberger
Journal of Symbolic Computation
Johannes-Kepler-Universitat Telephone: Austria (732)232381-9219
A4040 Linz, Austria (Europe) Telex:2-2323 uni li a
Form of manuscripts
An abstract of not more than 200 words should be included. The introduction
of a paper must contain a clear description of the problem in a form that is
easily understandable for researchers working in other areas of symbolic
computation. The introduction should explain the relevance of the problem
in the context of the entire field of symbolic computation. Also, the
author should explicitly claim which parts of the paper he considers to
be original. Algorithms must be described in a well structured and system-
independent form such that they are easily read by human readers. On the
other hand, algorithm descriptions should contain enough details to make
subsequent implementation in a concrete system a routine task.
References
An alphabetical list of references should be included. Bibliographical
information must be complete. Only self-explanatory abbreviations should
be used.
The typical form of reference is:
Peterson, G. E. Stickel, M. E. (1981). Complete sets of reductions for
some equational theories. J. of the ACM 28/2 233-264.
Citations in the text should be of the form Peter, Stickel (1981).
Rabin (1980a) etc. should be used when necessary.
More detailed information on the preparation of manuscripts for the journal
is available from the publishers:
ACADEMIC PRESS INC.
A Subsidiary of Harcourt Brace Jovanovich, Publishers
24-28 Oval Road, London NW1 7DX
Telephone 01-267-4466leff@smu.UUCP (10/05/84)
Table of Contents for RSYMSAC
The Second International Symposium on Symbolic and Algebraic Computation
by Computers
August 21(Tues)-22(Wed), 1984
1-1 D. R. Stoutemeyer Polynomial Remainder Sequence Greatest Common
Divisors Revisited
2-1 J. B. Marti The Role of Explanation in Symbolic Computation
3-1 N. Inada, M. Suzuki Overview and Curent Status of the FLATS
K. Shimizu M. Sato
4-1 J. Padget The Rationale of LIER; A Considered LISP
J. P. Fitch
5-1 J. Calmet I. Cohen Symbolic Manipulation to Recurrence Relations
An Approach to the Manipulation of Special Function
6-1 D. Y. Y. Yun Towards a Symbolic Mathematical Knowledge Base
7-1 B. Buchberger A Survey of the Method of Groebner Bases for
Solving Problems in Connection with Systems of
Multi-variate Polynomials
8-1 T. Ida Towards a Parallel Reduction Architecture
9-1 K. F. Loe Design of an Automatic Circuitry Code Generator
N. Ohsawa E. Goto
10-1 S. Moritsugu Symbolic Newton Iteration and its Application
N. Inada E. Goto
11-1 H. Kodaira H. Toshima Gini Coefficient of Wealth in Life Cycle Model
12-1 S. Watanabe Another Topics in Solving Differential Equations
13-1 S. Katsura Application of the Formula Manipulating System to
the Statistical Mechanics
14-1 T. Soma Recent Applications of REDUCE in Riken
15-1 J. H. Davenport Closed From solutions of Ordinary Differential
Equations
16-1 T. J. W. Clarke Speeding up the SKIM List Processor with Caches
A. C. Norman
W. R. Stoye
17-1 E. Goto K. Shimizu Architecture of a Josephson Computer (FLATS-2)
18-1 A. C. Hearn Structure: THe Key to Improved Algebraic
Computationpurtilo@uiucdcsb.UUCP (10/11/84)
RE: leff's list of contents from RSYMSAC anyone have any ordering information for getting a copy of proceedings? jim UUCP: ...!uiucdcs!purtilo CSNET: purtilo.uucp@csnet-relay ARPA: jimp@mit-mc
leff@smu.UUCP (10/13/84)
The following were not included in the original posting of table of
contents:
A-1 K. Shimizu Design and CAD Implementation of Formula Manipulation
Machine, FLATS
B-1 K. Shimizu A Portable Logic Simulation System
C-1 M. Sato The Flats Assembler, Syslisp and Basic Operating System
M. Suzuki
D-1 E. Goto Design of a Lisp Machine - FLATS
et. al.
Note: these articles are not included in the table of contents at the
begining of the book even though they were bound with it.leff@smu.UUCP (10/29/84)
Table of Contents for Soft Warehouse Newsletters. (The publishers of muMATH and muLISP). Note many of the bug fixes and enhancements were added to the newest versions. I am ommitting conference announcements. Newsletter 1 NL1-1 A TAYLOR series Expansion Function NL1-2 A muSIMP-79 WRITE Command NL1-3 A RANDOM Number Generator NL1-3 a Non-recursive Match Function NL1-4 A DRIVER Function Mod to Save Node Space NL1-4 Simplifed MATRIX and EQUATION Operators NL1-5 The DEAR ALGy Column NL1-6 Metamind program Newsletter 2 NL2-1 MICROSOFT to Distribute muLISP and muMATH NL2-2 The Small Systems Group's Software Survey NL2-2 Errors in the Matrix Package NL2-3 the DEAR ALGy Column NL2-4 A Summation Package NL2-6 A uMath Function Deparser and Pretty Printer NL2-11 A More Efficient DEPTH Function NL2-11 A Function Definition Pretty Print Package Newsletter3 NL3-1 Announcing muLISP/muSTAR-80 and muSIMP/muMATH 80 NL3-1 LIFEBOAT Associates to Distribute muLISP and muMath NL3-2 muLISP and muMATH User Groups NL3-3 Typographical Error in Newsletter #2 NL3-3 What was "HALF" doing in my answer? NL3-3 Hyperbolic Function Package NL3-6 Matrix Determinant Package NL3-6 Improved FCTR function NL3-7 Radix Base Conversion Program NL3-7 ANIMAL: A Learning Game Newsletter 4 NL4-1 muMATH and muLISP Reviews NL4-2 Handy muSIMP Utility Functions (BOUND & CLEAR) NL4-4 A FOR-loop Construct for muSIMP NL4-7 BUG in the Matrix Package NL4-7 Bugs in the Integration Package NL4-8 A note to Users of muLISP-79 and muLISP-79 (PUSH & POP) NL4-8 Dazzler Robot for Blocks World NL4-9 The Tower of Hanoi Problem Newsletter #5 NL5-1 APPLE and TRS-80 Versions of muMATH Released NL5-1 muLISP and muATH Reviews NL5-2 loating Point Inupt for muMATH NL5-2 Floating Point OUtput for muMATH NL5-4 Series Approximations of Natural Logarithms NL5-5 Bug Found in Array Package NL5-5 Vector Algebra Package NL5-10 A REDO Commmand for muSTAR NL5-11 A ractional Factorial Experiment Design Program Newsletter #6 NL6-1 muMATH and muLISP for the APPLE II Computer NL6-3 Computation of Determinants using Minor Expansion NL6-4 Linear RegressionAnalysis using muMATH NL6-5 Using the muSIMP Pretty-printer with muSIMP-80 NL6-7 SIGMA plus LIM spells CONFUSION NL6-7 Using muSAR to Create muLISP Source Files NL6-8 A Lexicographical Radix List Sort Newsletter #7 NL7-1 muMATH and muLISP for 8086 and 8088 based Microcomputers NL7-2 Solving Simultaneousl Linear Algebraic Equations NL7-2 ABSolutely Simple! NL7-5 Syntehtic Division of Polynomials NL7-7 Those Darn Bugs NL7-8 SNOMED Diagnostic Coding Program NL7-9 Automatically Saving Definitions WHile Working with muSTAR Newsletter #8 NL8-1 a "Down Under" muMATH User Group NL8-2 THe SUPER-CALCULATOR: A scientific for muMATH NL8-4 A muSIMP BREAKPOINT Debugging FAcility NL8-6 A Mini-muLISP Structure Editor NL8-9 MACROS: Expanding Your Programming Horizonas Newsletter #9 NL9-1 Announcing muMATH-83 and muLISP-83 NL9-2 A muMATH User Group NL9-2 A Power-Series Powering NL9-3 Collection of VAriables NL9-6 Symmetric Polynomials NL9-7 Partial Fractions & Other Goodies NL9-11 SOUNDEX Codes NL9-12 Solving General Relativity Problems NL9-12 Turtle Graphics Newsletter #10 NL10-1 Recent Reveiws and ARticles NL10-2 muMATH and muLISP USer Groups NL10-2 muMATH-83 Quick Reference Card NL10-2 Correction to STFORM Program NL10-3 Approximate Rational Arithmetic NL10-5 LAPLACE Transforms NL10-8 Fix for muMATH-83 Cubic Equation Solver NL10-8 An Improvement for Matrix Division NL10-8 Fix or the Absolute Value Trig Identities NL10-9 A Merge Sort Utility for Files
leff@smu.UUCP (02/08/85)
SIGSAM Volume 18 Number 3
Contents
Procedures for Polynomial and Rational Function Recognition by Carolyn J.
Smith
Note on "Solution of a General System of Equations" R. Gebauer H. Kredel
(solving a problem given by G. H. Gonnet, B. W. Char and K. O. Geddes
in SIGSAM Bulletin using the Buchberger's method)
On Improving Approximate Results of Buchberger's Algorithm by Newton's
Method W. Trinks
An Antitranslator of the RLISP Language A. P. Kryukov
A program to translate LISP into RLISP as used by REDUCE
Work with Non-Commutative Variables in the Reduce-2 System for Analytical
Calculations A. Ya. Rodionov
Completing the L-th Power in Z[x] by Daniel Zwillinger
Representing Matrices as Quadtrees for Parallel Processors David S. Wise
------------------------------------------------------------------------
The following "pointers" were provided to other literatures and I
repeat them here:
N. K. Bose, Applied Multidimensional Systems Theory Van Nostran
Reinhold Electrical Engineering/computer Science Series 1982 which
talks about the role of symbolic manipuation in this area.
The Church-Rosser Property in Computer Algebra and Special Theorem
Proving: An Investigationof Critical-Pair/Completion Algorithms (Ph. D.
Thesis) Franz Winkler
There was a National Computer Algebra Workshop in Leipzig. There were
the following talks:
B. Buchberger
1) Compute algebra, algorithms, systems and applications (a survey)
2) Algorithms of the type "Critical Pair/Completion" in symbolic
mathematics ( a survey)
3) L-networks - a concept for parallel algorithms and parallel
machines for symbolic computation
4) International research activities in the field of symbolic and
algebraic computation (a survey)
V. P. Gerdt
1) FORMIT - a program for the classification of formally integrable
non-linear evolution equations
2) Application of CAS in high energy physica (a survey)
J. Grabowski
Symbolic computational methods for layout design (VLSI)
K. P. Jann (KMU Leipzig)
AMP6 - internal structure and ESER-implemenation
W. Lassner
1) Computer Algebra system in the GDR and at the KMU
2) Symbol representations of noncommutative algebras
N. Lehmann
Computer analysis as pendant to numerical mathematics
K. Nehrkorn
Symbolic integration on computers ( a survey)
W. Reidel
Modularization of REDUCE
V. A. Rostovtsev
Questions about the dialogue with and within the CAS Reduce
S. Seidl
Experience with FORMAC 73 in electron optical formulae design
T. Wolf
An analystical algorithm for the decoupling and integration of
systems of non-linear partial differential equations
Talks held at the 1984 national Meeting of Americal Chemical Society
held in Philadelphia, Pennsylvania during August 26-31 1984. I will include
summary when contents do not seem obvious from title:
Basic Capabilities of computer algebra programs and their applications to
progblems in the sciences
Symbolic Mathematical Compuation on Modern Computers
Using VAXIMA (Macsyma) to write Fortran Code -- When solving elliptic
boundary problems these can be done by mapping an arbitrary region
to a rectangular region and solving via finite difference techniques.
Vaxima was used to automate code generation.
Using Macsyma to obtain reliable results for some wild integrals
Applications of symbolic mathematics to mathematics
past, present and future applications of computer algebra in chemistry
symbolic computation in chemical education
A Lisp System for the Manipulation of Chemical Groups: Wigner-Eckart
Coefficients for Arbitrary Permutation Groups
Computer-Assisted Analysis of Reaction Pathways -- analytical rate
expressions for chain reactions of the Rice-Herzfeld type
Polymer Modeling Applications of Symbolic Computation
Stability Analysis and Optimal Control of a Photochemical Heat Engine
Fourier Transform Algorithms for Spectral Analysis Derived with Macsyma
Creating Nonlinear Two-dimensional Finite Element Codes for the Analysis
of Shells in Structural mechanics.
Computer Algebra as a tool for optimal control problems
Applications off Macsyma to Mechanisms and Systems
Stability Analysis of a Robotoic Mechanism using Computer Algebra
Derivation of the Hopf Bifurcation formula using Lindstedt's perturbation
method and macsyma
Normal form and center manifold calculations ion macysma
Symbolic computation of the Stokes Waterways
Simplifying large algebraic expressions by Computer
Algebraic Computation in Graphical Calculations
Exact Solutions for superlattices and how to recognize them
Computer Generation of symbolic generalized inverses and applications to
physics and data analysis -- Moore-Penrose generalized inverse and
generation of a generalized inverse of a covariance matrix
...............................
Eurosam '84 proceedings Lecture Notes in Computer Science 174 are
available from J. P. Fitch, School of Mathematics, University of Bath, Bath
BA2 7Ay for USA Surface $4.20, Air Parcel $6.30
.....
A special session entitled "Symbolic Mathematical Computation on Modern
Computers" will be held at the 151st meeting of the AAAS. There will
be five invited lectures:
Paul S. Wang "Introduction to computer-based Symbolic Computation"
Richard Pavelle "Capabilities of Macsyma"
David R. Stoutemeyer "Symbolic Manipulation on Micro and Personal Computers"
Paul Davies "The SMP system and its application in Universities"
Paul Zorn "Computer Symbolic Manipulation in Undergraduate Mathematics
Education"
.........
Dr. S. Kamal Abdali
Symbolic Compuation Program
Computer Research Lab
Tektronix, Inc.
P. O. Box 500- MS 50-662
Beaverton, OR 97077
announces the availability of REDUCE under Franz Lisp. ($300.00 handling
charge and contribution to RAND corp). REDUCE is also available under PSL
(a different version of LISP) from RAND for $200.00.leff@smu.UUCP (02/19/85)
ACM Transactions on Mathematical Software December 1984 Volume 10 Number 4 Page 477 Corrections and Errors in John Ivies' Macsyma Programs for Solving Recurrence Equations by Pedro Celis The original article was published in ACM Trans. Math. Softw 4,1 (March 1978) 24-33