EUROCAL '85: European Conference on Computer Algebra Linz, Austria, April 1–3 1985 Proceedings Vol. 2: Research Contributions

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Dario Bini, Victor Pan (auth.), Bob F. Caviness (eds.)
Series: Lecture Notes in Computer Science 204
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1985

Language: English
Pages: 662
Tags: Mathematical Logic and Formal Languages

Algorithms for polynomial division....Pages 1-3
Sparse hensel lifting....Pages 4-17
Heugcd: How elementary upperbounds generate cheaper data....Pages 18-28
Gaussian elimination over a euclidean ring....Pages 29-30
Demonstration of reduce3 as implemented on a stand-alone Motorola 68000 based microcomputer....Pages 31-31
The Scratchpad II computer algebra language and system....Pages 32-33
The SAC-2 computer algebra system....Pages 34-35
DOE-MACSYMA: Progress report....Pages 36-39
Towards practical implementations of syllogistic....Pages 40-49
Path resolution and semantic graphs....Pages 50-63
Fast subsumption algorithms....Pages 64-77
Substitution expressions: Extracting solutions of non-Horn clause proofs....Pages 78-86
The complexity of elementary problems in archimedean ordered groups....Pages 87-88
Progress on the equivalence problem....Pages 89-98
Symbol representations of noncommutative algebras....Pages 99-115
Algebraic computations in elementary catastrophe theory....Pages 116-125
Bifurcation theory and computer algebra: An initial approach....Pages 126-137
Factorization of polynomials by transcendental evaluation....Pages 138-145
Factorization of rational polynomials in the Zassenhaus — Norm....Pages 146-147
On decomposable and commuting polynomials....Pages 148-149
Fast polynomial decomposition algorithms....Pages 150-153
A program system for root finding....Pages 154-154
A program system for factorization of polynomials with rational coefficients....Pages 155-155
THKLISP as a base of formula manipulation systems....Pages 156-156
AMP a system for algebraic computations....Pages 157-158
The program ortocartan for applications in Einstein's relativity theory....Pages 159-160
Sheep and classification in general relativity....Pages 161-162
Norcan — A computer calculus program....Pages 163-164
Demo of stensor....Pages 165-165
Visual environments for symbolic computation....Pages 166-167
Syntactic equivalences inducing semantic equivalences....Pages 168-178
The Algos computational system....Pages 179-180
Retrieval in a module library using formal specifications: Preliminary search using syntactic properties....Pages 181-196
The J-Machine: Functional programming with combinators....Pages 197-198
Symbolic algebra in problems of nonlinear mechanics....Pages 199-200
Macsyma's computation of dirac-bergmann algorithm for Hamiltonian syytems with constraints....Pages 201-202
Infinite dimensional computer Lie algebra ?....Pages 203-204
Application of computer algebra to the theory of the vibration-rotational spectra of diatomic molecules....Pages 205-205
Algorithms for the character theory of the symmetric group....Pages 206-224
Worst-case analysis of algorithms for computational problems on abelian permutation groups....Pages 225-228
A completion of some coxeter groups....Pages 229-242
A CAYLEY file of finite simple groups....Pages 243-244
On some laws in PSL(2,q)....Pages 245-245
An adjacency algorithm for cylindrical algebraic decompositions of three-dimensional space....Pages 246-261
A cluster-based cylindrical algebraic decomposition algorithm....Pages 262-269
On mechanical quantifier elimination for elementary algebra and geometry: Solution of a nontrivial problem....Pages 270-271
Gröbner bases using SAC2....Pages 272-274
A polynomial-time algorithm for the topological type of a real algebraic curve....Pages 275-276
An improved projection operation for cylindrical algebraic decomposition....Pages 277-278
Arithmetic in quadratic fields with unique factorization....Pages 279-288
About a new method for computing in algebraic number fields....Pages 289-290
An algebraic implementation of packages....Pages 291-302
The SMP pattern matcher....Pages 303-314
An expression compression package for REDUCE based on factorization and controlled expansion....Pages 315-316
STENSOR uses disc automatically for very large computations....Pages 317-317
Numerical methods with automatic verification....Pages 318-319
ACRITH — High accuracy arithmetic subroutine library....Pages 320-321
Floating-point computation in PASCAL-SC with verified results....Pages 322-324
PASCAL-SC demonstration accurate arithmetic for verified results....Pages 325-326
A solution to the polynomial hensel-code conversion problem....Pages 327-327
A posteriori interval analysis....Pages 328-334
Symbolic manipulations on a computer and their application to generation and investigation of difference schemes....Pages 335-347
Completeness in data type specifications....Pages 348-362
On solving the equality problem in theories defined by Horn clauses....Pages 363-377
Reducing the complexity of the Knuth-Bendix completion algorithm: A "unification" of different approaches....Pages 378-389
A confluence criterion based on the generalised Newman Lemma....Pages 390-399
ERIL — Equational reasoning: an interactive laboratory....Pages 400-401
Implementation of a general completion procedure parameterized by built-in theories and strategies....Pages 402-404
Computer algebra in Norway....Pages 405-406
Goppa codes: Algorithmic problems....Pages 407-408
Gcd's and factoring multivariate polynomials using Grobner bases....Pages 409-410
A note on the complexity of constructing standard bases....Pages 411-412
Some algorithmic questions on ideals of differential operators....Pages 413-421
Obtaining complete sets of reductions and equations without using special unification algorithms....Pages 422-423
An overview of completion algorithms....Pages 424-428
The optimisation by "code motion" of user programs for an algebraic manipulation system....Pages 429-430
An improved plotting package for VAXIMA....Pages 431-432
On logic programs with data-driven computations....Pages 433-443
Darwin, a system designed for the study of enumerative combinatorics....Pages 444-445
Correctness proofs of the implementation of abstract data types....Pages 446-447
Using prolog for constructing geometric objects defined by constraints....Pages 448-459
The role of symbolic computation in the management of scientific information....Pages 460-461
CIM (computer integrated manufacturing) — A challenge for symbolic computation....Pages 462-463
Symbolic and algebraic computation may support secondary education....Pages 464-465
Software toolkit for input stage measurement in symbolic compuation....Pages 466-467
The algebraic manipulation systems on the electrical power systems....Pages 468-469
A new method of computing fundamental units in algebraic number fields....Pages 470-478
The generalized Voronoi-algorithm in totally real algebraic number fields....Pages 479-486
An algorithm for the computation of perfect polyhedral cones over real quadratic number fields....Pages 487-488
Explicit determination of non-trivial torsion structures of elliptic curves over quadratic number fields....Pages 489-490
p-Adic algorithms and the computation of zeros of p-adic l-functions....Pages 491-502
On the solution of the diophantine equation G n =p z ....Pages 503-512
Term orderings on the polynomial ring....Pages 513-517
An algorithmic approach to local rings....Pages 518-525
A reduction strategy for the taylor resolution....Pages 526-534
From polynomials to Galois groups....Pages 535-536
A system for parallel computer algebra programs....Pages 537-538
Unification in parallel with refined linearity test: An example of recursive network structure in FP2, a functional parallel programming language....Pages 539-540
The parallel L-machine for symbolic computation....Pages 541-542
Unification in conditional-equational theories....Pages 543-553
Mechanical translation of set theoretic problem specifications into efficient RAM code — A case study....Pages 554-567
A methodology for automatic programming based on the constructive matching strategy....Pages 568-569
The structural synthesis of programs: New means....Pages 570-571
Taking advantage of symmetry in the automatic generation of numerical programs for finite element analysis....Pages 572-582
Automatic generation of optimized programs....Pages 583-584
Canonical form for rational exponential expressions....Pages 585-594
Elementary and Liouvillian solutions of linear differential equations....Pages 595-596
Analytical decoupling, decision of compatibility and partial integration of systems of nonlinear ordinary and partial differential equations....Pages 597-598
Symbolic integration of exponential polynomials....Pages 599-600
A REDUCE package for determining first integrals of autonomous systems of ordinary differential equations....Pages 601-602
A package of tools for manipulation of sums and series....Pages 603-604
Theory of summation in finite terms....Pages 605-606
Abstract of the manuscript entitled "symbol manipulation and symmetry breaking"....Pages 607-607
On improving approximate results of Buchberger's algorithm by Newton's method....Pages 608-612