Calculation of the greatest common divisor of perturbed polynomials
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10133744" target="_blank" >RIV/00216208:11320/13:10133744 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Calculation of the greatest common divisor of perturbed polynomials
Original language description
The coefficients of the greatest common divisor of two univariate polynomials can be obtained from the Sylvester subresultant matrix transformed to lower triangular form. Firstly, it is supposed that the coefficients of polynomials are given exactly. Transformation is in detail described and an algorithm for the calculation of the greatest common divisor is formulated. If inexact polynomials are given, then an approximate greatest common divisor (AGCD) is introduced. The considered techniques for an AGCD computations are shortly discussed and numerically compared in the presented paper.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Programs and Algorithms of Numerical Mathematics 16, Proceedings of Seminar
ISBN
978-80-85823-62-2
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
215-222
Publisher name
Matematický ústav AV ČR
Place of publication
Praha
Event location
Dolní Maxov
Event date
Jun 3, 2012
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—