Sciweavers

ISSAC
1997
Springer
125views Mathematics» more  ISSAC 1997»
13 years 8 months ago
A Modular Algorithm for Computing Greatest Common Right Divisors of Ore Polynomials
Abstract. This paper presents a modular algorithm for computing the greatest common right divisor (gcrd) of two univariate Ore polynomials over Z[t]. The subresultants of Ore polyn...
Ziming Li, István Nemes
ISSAC
1997
Springer
194views Mathematics» more  ISSAC 1997»
13 years 8 months ago
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington
ISSAC
1997
Springer
138views Mathematics» more  ISSAC 1997»
13 years 8 months ago
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
Erich Kaltofen, Victor Shoup
ISSAC
1997
Springer
110views Mathematics» more  ISSAC 1997»
13 years 8 months ago
Integration of the Signum, Piecewise and Related Functions
David J. Jeffrey, George Labahn, Martin von Mohren...
ISSAC
1997
Springer
102views Mathematics» more  ISSAC 1997»
13 years 8 months ago
A Numerical Absolute Primality Test for Bivariate Polynomials
We give a new numerical absolute primality criterion for bivariate polynomials. This test is based on a simple property of the monomials appearing after a generic linear change of...
André Galligo, Stephen M. Watt
ISSAC
1997
Springer
157views Mathematics» more  ISSAC 1997»
13 years 8 months ago
On the Worst-case Complexity of Integer Gaussian Elimination
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
Xin Gui Fang, George Havas
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
13 years 8 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
ISSAC
1997
Springer
105views Mathematics» more  ISSAC 1997»
13 years 8 months ago
On Randomized Lanczos Algorithms
Las Vegas algorithms that are based on Lanczos’s method for solving symmetric linear systems are presented and analyzed. These are compared to a similar randomized Lanczos algor...
Wayne Eberly, Erich Kaltofen
ISSAC
1997
Springer
105views Mathematics» more  ISSAC 1997»
13 years 8 months ago
Guarded Expressions in Practice
Computer algebra systems typically drop some degenerate cases when evaluating expressions, e.g., x=x becomes 1 dropping the case x = 0. We claim that it is feasible in practice to...
Andreas Dolzmann, Thomas Sturm
ISSAC
1997
Springer
118views Mathematics» more  ISSAC 1997»
13 years 8 months ago
An OpenMath 1.0 Implementation
Stéphane Dalmas, Marc Gaëtano, Stephen...