#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2003

2016

- This year (0)
- Last 5 years (1)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Nicos Karcanias, S. Fatouros, Marilena Mitrouli, George D. Halikias
- Computers & Mathematics with Applications
- 2006

The computation of the Greatest Common Divisor (GCD) of many polynomials is a nongeneric problem. Techniques defining “approximate GCD” solutions have been defined, but the proper definition of the “approximate” GCD, and the way we can measure the strength of the approximation has remained open. This paper uses recent results on the representation of the… (More)

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… (More)

The aim of this paper is to extend recent results on the approximate GCD of polynomials [1] and approximate zeros to the case of a polynomial matrices within the framework of exterior algebra [2]. The results provide the means to introduce a new characterization of approximate decoupling zeros and measures for approximate controllability and observability… (More)

- ‹
- 1
- ›