|
| Table of Contents
For full text in
Algorithmic determination of structure of infinite Lie pseudogroups of symmetries of PDEs
I. G. Lisle, G. J. Reid and A. Boulton
Pages 1 - 6
Programs for applying symmetries
Thomas Wolf
Pages 7 - 15
Symmetries of 2
Fritz Schwarz
Pages 16 - 25
The symbolic computation of differential invariants of polynomial vector field systems using trees
M. J. Doffou and R. L. Grossman
Pages 26 - 31
From honest to intelligent plotting
Ron Avitzur, Olaf Bachmann and Norbert Kajler
Pages 32 - 41
Simplification and optimization transformations of chains of recurrences
Eugene V. Zima
Pages 42 - 50
A hybrid symbolic-numerical method for tracing surface-to-surface intersections
Trâ&;grave;n Quo&circ&;acute;c Nam
Pages 51 - 58
Numeric-symbolic algorithms for evaluating one-dimensional algebraic sets
Shankar Krishnan and Dinesh Manocha
Pages 59 - 67
Computations with relative extensions of number fields with an application to the construction of Hilbert class fields
M. Daberkow and M. Pohst
Pages 68 - 76
On the implementation of dynamic evaluation
P. A. Broadbery, T. Gómez-Díaz and S. M. Watt
Pages 77 - 84
Finding roots of unity among quotients of the roots of an integral polynomial
Kazuhiro Yokoyama, Ziming Li and István Nemes
Pages 85 - 89
An algorithm for computing the Weierstrass normal form
Mark van Hoeij
Pages 90 - 95
Algorithms for computing sparse shifts for multivariate polynomials
Dima Yu. Grigoriev and Y. N. Lakshman
Pages 96 - 103
A simplified method of recognizing zero among elementary constants
Daniel Richardson
Pages 104 - 109
Fast computation of the Smith normal form of an integer matrix
Mark Giesbrecht
Pages 110 - 118
Preconditioning of rectangular polynomial matrices for efficient Hermite normal form computation
Arne Storjohann and George Labahn
Pages 119 - 125
STAR/MPI: binding a parallel library to interactive symbolic algebra systems
Gene Cooperman
Pages 126 - 132
Searching techniques for integral tables
T. H. Einwohner and Richard J. Fateman
Pages 133 - 139
Mathematical typesetting in
Neil Soiffer
Pages 140 - 149
Theorems and algorithms: an interface between Isabelle and Maple
Clemens Ballarin, Karsten Homann and Jacques Calmet
Pages 150 - 157
Representation for the radical of a finitely generated differential ideal
F. Boulier, D. Lazard, F. Ollivier and M. Petitot
Pages 158 - 166
Gro¨bner duality and multiplicities in polynomial system solving
Maria Grazia Marinari, Teo Mora and Hans Michael Möller
Pages 167 - 179
Implicitization of parametric curves and surfaces by using symmetric functions
L. González-Vega and G. Trujillo
Pages 180 - 186
Comparison of various multivariate resultant formulations
Deepak Kapur and Tushar Saxena
Pages 187 - 194
The singular value decomposition for polynomial systems
Robert M. Corless, Patrizia M. Gianni, Barry M. Trager and Stephen M. Watt
Pages 195 - 207
Numerical uniformization of hyperelliptic curves
Klaus-Dieter Semmler and Mika Seppälä
Pages 208 - 215
The analytic continuation process: from computer algebra to numerical analysis
Claudine Chaffy
Pages 216 - 222
An algorithm for the reduction of linear DAE
M. P. Quéré and G. Villard
Pages 223 - 231
On computing greatest common divisors with polynomials given by black boxes for their evaluations
Angel Díaz and Erich Kaltofen
Pages 232 - 239
Evaluation of the heuristic polynomial GCD
Hsin-Chao Liao and Richard J. Fateman
Pages 240 - 247
A solution to the extended gcd problem
Bohdan S. Majewski and George Havas
Pages 248 - 253
An analysis of Lehmer's Euclidean GCD algorithm
Jonathan Sorenson
Pages 254 - 258
Computing with matrix groups using permutation representations
Gene Cooperman, Larry Finkelstein and Michael Tselman
Pages 259 - 264
Fast recognition of the nilpotency of permutation groups
Ferenc Rákóczi
Pages 265 - 269
A nearly linear algorithm for Sylow subgroups in small-base groups
Prabhav Marje
Pages 270 - 277
On the computation of ordinary irreducible representations of finite groups
Torsten Minkwitz
Pages 278 - 284
Rational solutions of linear difference and
S. A. Abramov
Pages 285 - 289
On polynomial solutions of linear operator equations
Sergei A. Abramov, Manuel Bronstein and Marko Petkovšek
Pages 290 - 296
A rational version of Moser's algorithm
A. Barkatou
Pages 297 - 302
Indefinite sums of rational functions
S. A. Abramov
Pages 303 - 308
|
|
For full text in
|
The Digital Library is published by the Association for Computing Machinery. Copyright © 1999 ACM, Inc. | ||