Symbolic and Algebraic Computation: International Symposium ISSAC '88 Rome, Italy, July 4–8, 1988 Proceedings

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"

The ISSAC'88 is the thirteenth conference in a sequence of international events started in 1966 thanks to the then established ACM Special Interest Group on Symbolic and Algebraic Manipulation (SIGSAM). For the first time the two annual conferences "International Symposium on Symbolic and Algebraic Computation" (ISSAC) and "International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes" (AAECC) have taken place as a Joint Conference in Rome, July 4-8, 1988. Twelve invited papers on subjects of common interest for the two conferences are included in the proceedings and divided between this volume and the preceding volume of Lecture Notes in Computer Science which is devoted to AAECC-6. This book contains contributions on the following topics: Symbolic, Algebraic and Analytical Algorithms, Automatic Theorem Proving, Automatic Programming, Computational Geometry, Problem Representation and Solution, Languages and Systems for Symbolic Computation, Applications to Sciences, Engineering and Education.

Author(s): G. Ausiello, A. Marchetti Spaccamela, U. Nanni (auth.), P. Gianni (eds.)
Series: Lecture Notes in Computer Science 358
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1989

Language: English
Pages: 488
Tags: Symbolic and Algebraic Manipulation; Artificial Intelligence (incl. Robotics); Algorithm Analysis and Problem Complexity; Coding and Information Theory; Programming Techniques; Computation by Abstract Devices

Dynamic maintenance of paths and path expressions on graphs....Pages 1-12
Generic programming....Pages 13-25
From a noncomputability result to new interesting definitions and computability results....Pages 26-32
Symbolic derivation and automatic generation of parallel routines for finite element analysis....Pages 33-56
Liouvillian first integrals of differential equations....Pages 57-63
Fast reduction of the Risch differential equation....Pages 64-72
An application of reduce to the approximation of F(X,Y)....Pages 73-84
The use of symbolic computation in solving some non-relativistic quantum mechanical problems....Pages 85-95
Experiments with quadtree representation of matrices....Pages 96-108
Discovering inequality conditions in the analytical solution of optimization problems....Pages 109-115
Can EXCALC be used to investigate high-dimensional cosmological models with non-linear Lagrangians?....Pages 116-124
Gröbner trace algorithms....Pages 125-138
Solving systems of algebraic equations....Pages 139-149
Groebner bases in non-commutative algebras....Pages 150-161
Greater easy common divisor and standard basis completion algorithms....Pages 162-176
Experiments with a projection operator for algebraic decomposition....Pages 177-182
Rational Newton algorithm for computing formal solutions of linear differential equations....Pages 183-195
An ordinary differential equation solver for REDUCE....Pages 196-205
A fixed point method for power series computation....Pages 206-217
An algorithm for symbolic computation of center manifolds....Pages 218-230
Shortest division chains in imaginary quadratic number fields....Pages 231-243
Effective tests for cyclotomic polynomials....Pages 244-251
The probability of relative primality of Gaussian integers....Pages 252-258
Some computational aspects of root finding in GF(q m )....Pages 259-270
Symbolic computation for Witt rings....Pages 271-273
Computations with algebraic curves....Pages 274-284
On the computational complexity of the resolution of plane curve singularities....Pages 285-292
Generalized characteristic polynomials....Pages 293-299
Decomposition of algebras....Pages 300-308
Algebraic transformations of polynomial equations, symmetric polynomials and elimination....Pages 309-314
Tetrahedrizing point sets in three dimensions....Pages 315-331
A generalization of the roider method to solve the robot collision problem in 3D....Pages 332-343
Symbolic analysis of planar drawings....Pages 344-355
A geometrical decision algorithm based on the gröbner bases algorithm....Pages 356-363
Solving permutation problems using rewriting systems....Pages 364-377
Applying rewriting techniques to groups with power-commutation-presentations....Pages 378-389
Efficient decision procedures for locally finite theories II....Pages 390-401
Aformal approach to some usually informal techniques used in mathematical reasoning....Pages 402-406
Decision procedures for elementary sublanguages of set theory. XIV. Three languages involving rank related constructs....Pages 407-422
Computer algebra on MIMD machine....Pages 423-439
Algebraic extensions and algebraic closure in Scratchpad II....Pages 440-446
Software development for computer algebra or from ALDES/SAC-2 to WEB/Modula-2....Pages 447-455
Cayley, version 4: The user language....Pages 456-466
Improved sparse multivariate polynomial interpolation algorithms....Pages 467-474
Heuristic methods for operations with algebraic numbers....Pages 475-480
Asymptotic estimation of oscillating functions using an interval calculus....Pages 481-489
A new algorithm for computing symbolic limits using hierarchical series....Pages 490-495
Verification of non-identities in algebras....Pages 496-507
Equations in words....Pages 508-520
Cayley factorization....Pages 521-533
Complexity of computing the characters and the genre of a system of exterior differential equations....Pages 534-543