Nearest common root of polynomials, approximate greatest common divisor and the structured singular value

Nearest common root of polynomials, approximate greatest common divisor and the structured... In this paper the following problem is considered: given two coprime polynomials, find the smallest perturbation in the magnitude of their coefficients such that the perturbed polynomials have a common root. It is shown that the problem is equivalent to the calculation of the structured singular value of a matrix arising in robust control and a numerical solution to the problem is developed. A simple numerical example illustrates the effectiveness of the method for two polynomials of low degree. Finally, problems involving the calculation of the approximate greatest common divisor of univariate polynomials are considered, by proposing a generalization of the definition of the structured singular value involving additional rank constraints. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png IMA Journal of Mathematical Control and Information Oxford University Press

Nearest common root of polynomials, approximate greatest common divisor and the structured singular value

Loading next page...
 
/lp/oxford-university-press/nearest-common-root-of-polynomials-approximate-greatest-common-divisor-0jOiIZaZ3S
Publisher
Oxford University Press
Copyright
The authors 2012. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.
Subject
Articles
ISSN
0265-0754
eISSN
1471-6887
DOI
10.1093/imamci/dns032
Publisher site
See Article on Publisher Site

Abstract

In this paper the following problem is considered: given two coprime polynomials, find the smallest perturbation in the magnitude of their coefficients such that the perturbed polynomials have a common root. It is shown that the problem is equivalent to the calculation of the structured singular value of a matrix arising in robust control and a numerical solution to the problem is developed. A simple numerical example illustrates the effectiveness of the method for two polynomials of low degree. Finally, problems involving the calculation of the approximate greatest common divisor of univariate polynomials are considered, by proposing a generalization of the definition of the structured singular value involving additional rank constraints.

Journal

IMA Journal of Mathematical Control and InformationOxford University Press

Published: Dec 11, 2013

Keywords: approximate common root of polynomials approximate GCD Sylvester resultant matrix structured singular value distance to singularity structured approximations

There are no references for this article.

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create folders to
organize your research

Export folders, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off