Title: Approximate Polynomial Greatest Common Divisor Author: Ján Eliaš Department: Department of Numerical Mathematics, MFF UK Supervisor: Doc. RNDr. Jan Zítko, CSc., Department of Numerical Mathematics, MFF UK Abstract: The computation of polynomial greatest common divisor (GCD) ranks among basic algebraic problems with many applications. The Euclidean algorithm is the oldest and usual technique for computing GCD. However, the GCD computation problem is ill-posed, particularly when some unknown noise is applied to the polyno- mial coefficients. Since the Euclidean algorithm is unstable, new methods have been extensively studied in recent years. Methods based on the numerical rank estimation represent one group of current meth- ods. Their disadvantage is that the numerical rank cannot be computed reliably due to the sensitivity of singular values on noise. The aim of the work is to overcome the ill-posed sensitivity of GCD computation in the presence of noise. Keywords: AGCD, Sylvester matrix, numerical rank, TLS
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:305162 |
| Date | January 2012 |
| Creators | Eliaš, Ján |
| Contributors | Zítko, Jan, Hnětynková, Iveta |
| Source Sets | Czech ETDs |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0018 seconds