An improvement of Euclid's algorithm
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10080852" target="_blank" >RIV/00216208:11320/10:10080852 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
An improvement of Euclid's algorithm
Original language description
The paper introduces the calculation of a greatest common divisor of two univariate polynomials. Euclid's algorithm is simulated by the reduction of the Sylvester matrix to an upper triangular form by using c-s transformation and QR-factorization method.Both procedures are described and numerically compared with classical Euclid's algorithm. The new procedures yield more precise results.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
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 15
ISBN
978-80-85823-57-8
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
—
Publisher name
Matematický ústav AV ČR, v.v.i.
Place of publication
Praha
Event location
Dolní Maxov
Event date
Jun 6, 2010
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—