Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ISSAC
2004
Springer
118views Mathematics» more  ISSAC 2004»
10 years 9 months ago
The approximate GCD of inexact polynomials
This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of multivariate polynomials whose coefficients may be inexact. ...
Zhonggang Zeng, Barry H. Dayton
ISSAC
2004
Springer
109views Mathematics» more  ISSAC 2004»
10 years 9 months ago
Extracting mathematical expressions from postscript documents
Michael Yang, Richard J. Fateman
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
10 years 9 months ago
Automatic generation of polynomial loop
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
Enric Rodríguez-Carbonell, Deepak Kapur
ISSAC
2004
Springer
98views Mathematics» more  ISSAC 2004»
10 years 9 months ago
Symbolic summation with single-nested sum extensions
We present a streamlined and refined version of Karr’s summation algorithm. Karr’s original approach constructively decides the telescoping problem in ΠΣ-fields, a very ge...
Carsten Schneider
ISSAC
2004
Springer
106views Mathematics» more  ISSAC 2004»
10 years 9 months ago
Factoring polynomials via polytopes
We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to...
Fatima Abu Salem, Shuhong Gao, Alan G. B. Lauder
ISSAC
2004
Springer
86views Mathematics» more  ISSAC 2004»
10 years 9 months ago
Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction
Let n/d ∈ Q, m be a positive integer and let u = n/d mod m. Thus u is the image of a rational number modulo m. The rational reconstruction problem is; given u and m find n/d.
Michael B. Monagan
ISSAC
2004
Springer
93views Mathematics» more  ISSAC 2004»
10 years 9 months ago
Finding the smallest image of a set
We describe an algorithm for finding a canonical image of a set of points under the action of a permutation group. Specifically if we order images by sorting them and ordering t...
Steve Linton
ISSAC
2004
Springer
91views Mathematics» more  ISSAC 2004»
10 years 9 months ago
Hyperexponential solutions of finite-rank ideals in orthogonal ore rings
An orthogonal Ore ring is an abstraction of common properties of linear partial differential, shift and q-shift operators. Using orthogonal Ore rings, we present an algorithm for...
George Labahn, Ziming Li
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
10 years 9 months ago
The truncated fourier transform and applications
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
Joris van der Hoeven
books