Loading...
Please wait, while we are loading the content...
Similar Documents
Approximate greatest common divisor of polynomials and the structured singular value
| Content Provider | Semantic Scholar |
|---|---|
| Author | Halikias, George Fatouros, Stavros Karcanias, Nicos |
| Copyright Year | 2003 |
| Abstract | In this note the following problem is considered: Given two monic coprime polynomials a(s) and b(s) with real coefficients, find the smallest (in magnitude) perturbation in their coefficients so 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, which can be performed using efficient existing techniques of robust control. A simple numerical example illustrates the effectiveness of the method. The generalisation of the method to calculate the approximate greatest common divisor (GCD) of polynomials is finally discussed. |
| Starting Page | 3587 |
| Ending Page | 3591 |
| Page Count | 5 |
| File Format | PDF HTM / HTML |
| DOI | 10.23919/ecc.2003.7086599 |
| Journal | 2003 European Control Conference (ECC) |
| Alternate Webpage(s) | http://www.nt.ntnu.no/users/skoge/prost/proceedings/ecc03/pdfs/605.pdf |
| Alternate Webpage(s) | http://www.staff.city.ac.uk/~george1/%5BC.20%5D%20Approximate-GCD-Of-Polynomials-And-The-Structured-Singular-Value-ECC.pdf |
| Alternate Webpage(s) | http://folk.ntnu.no/skoge/prost/proceedings/ecc03/pdfs/605.pdf |
| Alternate Webpage(s) | https://doi.org/10.23919/ecc.2003.7086599 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
