Sciweavers

ISSAC
1995
Springer
93views Mathematics» more  ISSAC 1995»
13 years 8 months ago
Finding Roots of Unity Among Quotients of the Roots of an Integral Polynomial
We present an efficient algorithm for testing whether a given integral polynomial has two distinct roots a, B such that fflp is a root of unity. The test is based on results obtai...
Kazuhiro Yokoyama, Ziming Li, István Nemes
ISSAC
1995
Springer
86views Mathematics» more  ISSAC 1995»
13 years 8 months ago
Programs for Applying Symmetries
In this paper the programs APPLYSYM, QUASILINPDE and DETRAFO are described which aim at the utilization of infinitesimal symmetries of differential equations. The purpose of QUA...
Thomas Wolf
ISSAC
1995
Springer
174views Mathematics» more  ISSAC 1995»
13 years 8 months ago
Numerical Uniformization of Hyperelliptic Curves
Abstract. In this paper we derive an algorithm that computes, for a given algebraic hyperelliptic plane curve C of genus p, p > 1, defined by a polynomial y2 = (x−λ1) · · ...
Klaus-Dieter Semmler, Mika Seppälä
ISSAC
1995
Springer
125views Mathematics» more  ISSAC 1995»
13 years 8 months ago
An Algorithm for the Reduction of Linear DAE
M. P. Quéré, Gilles Villard
ISSAC
1995
Springer
108views Mathematics» more  ISSAC 1995»
13 years 8 months ago
A Solution to the Extended GCD Problem
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
Bohdan S. Majewski, George Havas
ISSAC
1995
Springer
125views Mathematics» more  ISSAC 1995»
13 years 8 months ago
Numeric-Symbolic Algorithms for Evaluating One-Dimensional Algebraic Sets
: We present e cient algorithms based on a combination of numeric and symbolic techniques for evaluating one-dimensional algebraic sets in a subset of the real domain. Given a desc...
Shankar Krishnan, Dinesh Manocha
ISSAC
1995
Springer
119views Mathematics» more  ISSAC 1995»
13 years 8 months ago
The Singular Value Decomposition for Polynomial Systems
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
Robert M. Corless, Patrizia M. Gianni, Barry M. Tr...
ISSAC
1995
Springer
155views Mathematics» more  ISSAC 1995»
13 years 8 months ago
On the Implementation of Dynamic Evaluation
Dynamic evaluation is a technique for producing multiple results according to a decision tree which evolves with program execution. Sometimes it is desired to produce results for ...
Peter A. Broadbery, T. Gómez-Díaz, S...