Results 1  10
of
14
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
 Manuscript
, 2006
"... We consider the problem of computing minimal real or complex deformations to the coefficients in a list of relatively prime real or complex multivariate polynomials such that the deformed polynomials have a greatest common divisor (GCD) of at least a given degree k. In addition, we restrict the defo ..."
Abstract

Cited by 16 (9 self)
 Add to MetaCart
We consider the problem of computing minimal real or complex deformations to the coefficients in a list of relatively prime real or complex multivariate polynomials such that the deformed polynomials have a greatest common divisor (GCD) of at least a given degree k. In addition, we restrict the deformed coefficients by a given set of linear constraints, thus introducing the linearly constrained approximate GCD problem. We present an algorithm based on a version of the structured total least norm (STLN) method and demonstrate, on a diverse set of benchmark polynomials, that the algorithm in practice computes globally minimal approximations. As an application of the linearly constrained approximate GCD problem, we present an STLNbased method that computes for a real or complex polynomial the nearest real or complex polynomial that has a root of multiplicity at least k. We demonstrate that the algorithm in practice computes, on the benchmark polynomials given in the literature, the known globally optimal nearest singular polynomials. Our algorithms can handle, via randomized preconditioning, the difficult case when the nearest solution to a list of real input polynomials actually has nonreal complex coefficients.
The Bézout matrix in the Lagrange basis
 Proceedings EACA
, 2004
"... A recent paper by Amiraslani, Corless, GonzalezVega and Shakoori studies polynomial algebra by values, without first converting to another basis such as the monomial basis. Their methodology is driven by a desire to avoid illconditioning in such changes of basis. In this talk I expand on some deta ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
A recent paper by Amiraslani, Corless, GonzalezVega and Shakoori studies polynomial algebra by values, without first converting to another basis such as the monomial basis. Their methodology is driven by a desire to avoid illconditioning in such changes of basis. In this talk I expand on some details from that paper, namely the construction and use of the Bézout matrix directly from given polynomial values. We here show details of the construction of common roots of polynomials directly from the eigenvectors of the constructed Bézout matrix.
Dividing polynomials when you only know their values
 In Laureano GonzalezVega and Tomas Recio, editors, Proceedings EACA
, 2004
"... A recent paper by Amiraslani, Corless, GonzalezVega and Shakoori studies polynomial algebra by values, without first converting to another basis such as the monomial basis. In this talk I expand on some details from that paper, namely the method we used to divide (multivariate and univariate) polyn ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A recent paper by Amiraslani, Corless, GonzalezVega and Shakoori studies polynomial algebra by values, without first converting to another basis such as the monomial basis. In this talk I expand on some details from that paper, namely the method we used to divide (multivariate and univariate) polynomials given only by values. This is a surprisingly valuable operation, and with it one can solve systems of polynomial equations without first constructing a Gröbner basis, or one can compute Gröbner bases if desired.
Pseudospectra of Matrix Polynomials that are Expressed in Alternative Bases
"... Abstract. Spectra and pseudospectra of matrix polynomials are of interest in geometric intersection problems, vibration problems, and analysis of dynamical systems. In this note we consider the effect of the choice of polynomial basis on the pseudospectrum and on the conditioning of the spectrum of ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. Spectra and pseudospectra of matrix polynomials are of interest in geometric intersection problems, vibration problems, and analysis of dynamical systems. In this note we consider the effect of the choice of polynomial basis on the pseudospectrum and on the conditioning of the spectrum of regular matrix polynomials. In particular, we consider the direct use of the Lagrange basis on distinct interpolation nodes, and give a geometric characterization of “good ” nodes. We also give some tools for computation of roots at infinity via a new, natural, reversal. The principal achievement of the paper is to connect pseudospectra to the wellestablished theory of Lebesgue functions and Lebesgue constants, by separating the influence of the scalar basis from the natural scale of the matrix polynomial, which allows many results from interpolation theory to be applied. 1.
Structured low rank approximations of the Sylvester resultant matrix for approximate GCDs of Bernstein polynomials, 2006. Submitted to Computer Aided Geometric Design
"... Abstract. A structured low rank approximation of the Sylvester resultant matrix S(f, g) of the Bernstein basis polynomials f = f(y) and g = g(y), for the determination of their approximate greatest common divisors (GCDs), is computed using the method of structured total least norm. Since the GCD of ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. A structured low rank approximation of the Sylvester resultant matrix S(f, g) of the Bernstein basis polynomials f = f(y) and g = g(y), for the determination of their approximate greatest common divisors (GCDs), is computed using the method of structured total least norm. Since the GCD of f(y) and g(y) is equal to the GCD of f(y) and αg(y), where α is an arbitrary nonzero constant, it is more appropriate to consider a structured low rank approximation S ( ˜ f, ˜g) of S(f, αg), where the polynomials ˜ f = ˜ f(y) and ˜g = ˜g(y) approximate the polynomials f(y) and αg(y), respectively. Different values of α yield different structured low rank approximations S ( ˜ f, ˜g), and therefore different approximate GCDs. It is shown that the inclusion of α allows to obtain considerably improved approximations, as measured by the decrease of the singular values σi of S ( ˜ f, ˜g), with respect to the approximation obtained when the default value α = 1 is used. An example that illustrates the theory is presented and future work is discussed. Key words. Bernstein polynomials, structured low rank approximation, Sylvester resultant matrix.
Hardware Implementation of Greatest Common Divisor using subtractor in Euclid Algorithm
"... This paper proposed an efficient implementation of digital circuit based on the Euclidean Algorithm with modular arithmetic to find Greatest Common Divisor (GCD) of two Binary Numbers given as input to the circuit. Output of the circuit is the GCD of the given inputs. In this paper subtractionbased ..."
Abstract
 Add to MetaCart
This paper proposed an efficient implementation of digital circuit based on the Euclidean Algorithm with modular arithmetic to find Greatest Common Divisor (GCD) of two Binary Numbers given as input to the circuit. Output of the circuit is the GCD of the given inputs. In this paper subtractionbased narrative defined by Euclid is described, the remainder calculation replaced by repeated subtraction. The selection of the Division Method using subtractor is due to ease of implementation and less complexity in connection with reduced hardware. The circuit is built using basic digital electronic components like Multiplexers & comparator (A<B) as control function and Registers, Full subtractor as Register transfer components. Although the circuit is developed to handle 4bit of data, it can be easily extended to handle any number of bits just by increasing capacity of basic