Author(s): B. Buchberger (auth.), Edward W. Ng (eds.)
Series: Lecture Notes in Computer Science 72
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1979
Language: English
Pages: 563
Tags: Computer Science, general
A criterion for detecting unnecessary reductions in the construction of Gröbner-bases....Pages 3-21
Unification of commutative terms....Pages 22-22
Canonicality in rule systems....Pages 23-29
The application of symbolic algebra to physics — A case of creeping flow....Pages 30-41
Progress towards a solution of the equivalence problem in general relativity....Pages 42-44
Symbol calculus by symbolic computation and semi-classical expansions....Pages 45-51
An algorithm for the analytic evaluation of a class of integrals....Pages 52-57
Fast computation of the rational hermite interpolant and solving toeplitz systems of equations via the extended Euclidean algorithm....Pages 58-64
Approximate algorithms to derive exact solutions to systems of linear equations....Pages 65-73
New recursive minor expansion algorithms, a presentation in a comparative context....Pages 74-87
Systems of algebraic equations....Pages 88-94
On the van der waerden criterion for the group of an equation....Pages 95-107
Some computations related to torsion points on elliptic curves over number fields....Pages 108-118
The computerisation of algebraic geometry....Pages 119-133
Algebraic extensions of arbitrary integral domains....Pages 134-139
On unit computation in real quadratic fields....Pages 140-152
An algebraic form of a solution of a system of linear differential equations with constant coefficients....Pages 153-163
Substitution methods for the automatic symbolic solution of differential equations of first order and first degree....Pages 164-176
A semi-numeric difference algorithm....Pages 177-188
Convergence behaviour of the Newton iteration for first order differential equations....Pages 189-199
Probabilistic algorithms for verification of polynomial identities....Pages 200-215
Probabilistic algorithms for sparse polynomials....Pages 216-226
Non-modular computation of polynomial GCDS using trial division....Pages 227-239
Product of symmetric and anti-symmetric polynomials....Pages 240-240
Capabilities of the mumath-79 computer algebra system for the intel-8080 microprocessor....Pages 241-248
CAMAC 1979....Pages 249-257
The initial design of a vector based algebra system....Pages 258-265
Hashing — the key to rapid pattern matching....Pages 266-278
A system for automatic generation of tensor algorithms and indicial tensor calculus, including substitution of sums....Pages 279-290
Analysis of the p-adic construction of multivariate correction coefficiencts in polynomial factorization: Iteration vs. recursion....Pages 291-300
A cellular decomposition algorithm for semialgebraic sets....Pages 301-315
Gamma-algebra algorithms for canonical hypercomplex representations....Pages 316-316
Factoring univariate integral polynomials in polynomial average time....Pages 317-329
Symbolic-numeric interface: A review....Pages 330-345
A note on methods for solving systems of polynomial equations with floating point coefficients....Pages 346-357
An arbitrary precision real arithmetic package in REDUCE....Pages 358-368
Symbolic preprocessing in interval function computing....Pages 369-382
Approximate rational arithmetic systems: Analysis of recovery of simple fractions during expression evaluation....Pages 383-397
Symbolic integration — the dust settles?....Pages 398-407
Integration of simple radical extensions....Pages 408-414
Algorithms for the integration of algebraic functions....Pages 415-425
An extension of liouville's theorem....Pages 426-430
Integer matrices and Abelian groups....Pages 431-451
An algorithm for the computation of conjugacy classes and centralizers in p-groups....Pages 452-465
MODLISP: An introduction....Pages 466-480
Extending interlisp for modularization and efficiency....Pages 481-489
TLISP — A “transportable-lisp” implemented in pcode....Pages 490-502
Symbolic computing with compression of data structures: General observations, and a case study....Pages 503-513
On the design of algebraic data structures with the approach of abstract data types....Pages 514-530
Matching under commutativity....Pages 531-545
γ-algebra algorithms for canonical hypercomplex representations....Pages 546-557