Comparison of algorithms for calculation of the greatest common divisor of several polynomials
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10319194" target="_blank" >RIV/00216208:11320/15:10319194 - isvavai.cz</a>
Result on the web
<a href="http://panm17.math.cas.cz/PANM17_proceedings.pdf" target="_blank" >http://panm17.math.cas.cz/PANM17_proceedings.pdf</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Comparison of algorithms for calculation of the greatest common divisor of several polynomials
Original language description
The paper deals with a problem of numerical computing of the greatest common divisor of polynomials. In the paper there are compared two possible appraches base either on Sylveter or on Bezout matrices.
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
2015
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 17
ISBN
978-80-85823-64-6
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
64-70
Publisher name
Matematický Ústav AV ČR
Place of publication
Praha
Event location
Horní Maxov
Event date
Jun 8, 2014
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—