Results 1  10
of
14
The Singular Value Decomposition for Polynomial Systems
, 1995
"... This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known. We first give an algorithm for computing univariate GCD's which gives exact results for interesting nearby problems, and ..."
Abstract

Cited by 81 (9 self)
 Add to MetaCart
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known. We first give an algorithm for computing univariate GCD's which gives exact results for interesting nearby problems, and give efficient algorithms for computing precisely how nearby. We generalize this to multivariate GCD computation. Next, we adapt Lazard's uresultant algorithm for the solution of overdetermined systems of polynomial equations to the inexactcoefficient case. We also briefly discuss an application of the modied Lazard's method to the location of singular points on approximately known projections of algebraic curves.
Certified approximate univariate GCDs
 METHODS IN ALGEBRAIC GEOMETRY, 117 & 118:229251
, 1997
"... We study the approximate GCD of two univariate polynomials given with limited accuracy or, equivalently, the exact GCD of the perturbed polynomials within some prescribed tolerance. A perturbed polynomial is regarded as a family of polynomials in a classification space, which leads to an accurate an ..."
Abstract

Cited by 41 (5 self)
 Add to MetaCart
We study the approximate GCD of two univariate polynomials given with limited accuracy or, equivalently, the exact GCD of the perturbed polynomials within some prescribed tolerance. A perturbed polynomial is regarded as a family of polynomials in a classification space, which leads to an accurate analysis of the computation. Considering only the Sylvester matrix singular values, as is frequently suggested in the literature, does not suffice to solve the problem completely, even when the extended euclidean algorithm is also used. We provide a counterexample that illustrates this claim and indicates the problem's hardness. SVD computations on subresultant matrices lead to upper bounds on the degree of the approximate GCD. Further use of the subresultant matrices singular values yields an approximate syzygy of the given polynomials, which is used to establish a gap theorem on certain singular values that certifies the maximumdegree approximate GCD. This approach leads directly to an algorithm for computing the approximate GCD polynomial. Lastly, we suggest the use of weighted norms in order to sharpen the theorem's conditions in a more intrinsic context.
Optimization Strategies for the Approximate GCD Problem
 IN PROC. ISSAC'98
, 1998
"... We describe algorithms for computing the greatest common divisor (GCD) of two univariate polynomials with inexactlyknown coefficients. Assuming that an estimate for the GCD degree is available (e.g., using an SVDbased algorithm), we formulate and solve a nonlinear optimization problem in order to d ..."
Abstract

Cited by 22 (2 self)
 Add to MetaCart
We describe algorithms for computing the greatest common divisor (GCD) of two univariate polynomials with inexactlyknown coefficients. Assuming that an estimate for the GCD degree is available (e.g., using an SVDbased algorithm), we formulate and solve a nonlinear optimization problem in order to determine the coefficients of the "best" GCD. We discuss various issues related to the implementation of the algorithms and present some preliminary test results.
Numerical Computation Of A Polynomial GCD And Extensions
, 1996
"... In the first part of this paper, we dene approximate polynomial gcds (greatest common divisors) and extended gcds provided that approximations to the zeros of the input polynomials are available. We relate our novel definition to the older and weaker ones, based on perturbation of the coefficients o ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
In the first part of this paper, we dene approximate polynomial gcds (greatest common divisors) and extended gcds provided that approximations to the zeros of the input polynomials are available. We relate our novel definition to the older and weaker ones, based on perturbation of the coefficients of the input polynomials, we demonstrate some deficiency of the latter definitions (which our denition avoids), and we propose new effective sequential and parallel (RNC and NC) algorithms for computing approximate gcds and extended gcds. Our stronger results are obtained with no increase of the asymptotic bounds on the computational cost. This is partly due to application of our recent nearly optimal algorithms for approximating polynomial zeros. In the second part of our paper, working under the older and more customary definition of approximate gcds, we modify and develop an alternative approach, which was previously based on the computation of the Singular Value Decomposition (SVD) of the associat...
Numerical Univariate Polynomial GCD
 The Mathematics of Numerical Analysis, volume 32 of Lectures in Applied Math
, 1996
"... We formalize the notion of approximate GCD for univariate polynomials given with limited accuracy and then address the problem of its computation. Algebraic concepts are applied in order to provide a solid foundation for a numerical approach. We exhibit the limitations of the euclidean algorithm thr ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We formalize the notion of approximate GCD for univariate polynomials given with limited accuracy and then address the problem of its computation. Algebraic concepts are applied in order to provide a solid foundation for a numerical approach. We exhibit the limitations of the euclidean algorithm through experiments, show that existing methods only solve part of the problem and assert its worstcase complexity. A rigorous geometrical point of view is given in the parameter space of all input polynomials and SVD computations on subresultants are applied in order to derive upper bounds on the degree of the approximate GCD. Then, we establish a certification theorem and state the conditions under which it determines the precise GCD degree.
Some Recent Algebraic/Numerical Algorithms
, 1998
"... Combination of algebraic and numerical techniques for improving the computations in algebra and geometry is a popular research topic of growing interest. We survey some recent progress that we made in this area, in particular, regarding polynomial rootfinding, the solution of a polynomial system of ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Combination of algebraic and numerical techniques for improving the computations in algebra and geometry is a popular research topic of growing interest. We survey some recent progress that we made in this area, in particular, regarding polynomial rootfinding, the solution of a polynomial system of equations, the computation of an approximate greatest common divisor of two polynomials as well as various computations with dense structured matrices and their further applications to polynomial and rational interpolation and multipoint polynomial evaluation. In some cases our algorithms reach nearly optimal time bounds and/or improve the previously known methods by order of magnitude, in other cases we yield other gains, such as improved numerical stability. Key words: algebraic/numerical algorithms, polynomial rootfinding, solution of a polynomial system of equations, approximate gcd, dense structured matrices, Toeplitz matrices, Cauchy matrices, polynomial interpolation, rational interpo...
Optimization Strategies for the FloatingPoint GCD
 IN ISSAC PROCEEDINGS
, 1998
"... We describe algorithms for computing the greatest common divisor (GCD) of two univariate polynomials with inexactlyknown coefficients. Assuming that an estimate for the GCD degree is available (e.g., using an SVDbased algorithm), we formulate and solve a nonlinear optimization problem in order to d ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We describe algorithms for computing the greatest common divisor (GCD) of two univariate polynomials with inexactlyknown coefficients. Assuming that an estimate for the GCD degree is available (e.g., using an SVDbased algorithm), we formulate and solve a nonlinear optimization problem in order to determine the coefficients of the "best" GCD. We discuss various issues related to the implementation of the algorithms and present some preliminary test results.
Some Algorithms for Matrix Polynomials
, 1996
"... . For a polynomial matrix P (x) of degree d in Mn;n (K[x]) where K is a commutative field, a reduction to the Hermite normal form can be computed in O ~ (M(nd)) arithmetic operations if M(n) is the time required to multiply two n \Theta n matrices over K. Further, a reduction can be computed usin ..."
Abstract
 Add to MetaCart
. For a polynomial matrix P (x) of degree d in Mn;n (K[x]) where K is a commutative field, a reduction to the Hermite normal form can be computed in O ~ (M(nd)) arithmetic operations if M(n) is the time required to multiply two n \Theta n matrices over K. Further, a reduction can be computed using O(log +1 (nd)) parallel arithmetic steps and O(L(nd)) processors if the same processor bound holds with time O(log (nd)) for determining the lexicographically first maximal linearly independent subset of the set of the columns of an nd \Theta nd matrix over K. These results are obtained by applying in the matrix case, the techniques used in the scalar case of the gcd of polynomials. Keywords: Parallel algorithms, NC 2 K , Hermite normal forms, theory of realizations. Introduction The problem of computing the greatest common divisor (gcd) of scalar polynomials in K[x] (K is a commutative field) or of polynomial matrices in M m;n (K[x]) has attracted a lot of attention and has many...
DOI: 10.2478/v1000600700388 ON THE COMPUTATION OF THE GCD OF 2D POLYNOMIALS
"... An interesting problem of algebraic computation is the computation of the greatest common divisor (GCD) of a set of polynomials. The GCD is usually linked with the characterisation of zeros of a polynomial matrix description ..."
Abstract
 Add to MetaCart
An interesting problem of algebraic computation is the computation of the greatest common divisor (GCD) of a set of polynomials. The GCD is usually linked with the characterisation of zeros of a polynomial matrix description