On Root Classification in Kinetic Data Structures
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F11%3A43897723" target="_blank" >RIV/49777513:23520/11:43897723 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On Root Classification in Kinetic Data Structures
Original language description
In this paper we discuss the mathematical properties of kinetic events computation for kinetic data structures with polynomial-type certi?cate functions. We show that it is neither theoretically possible nor numerically safe to ignore the multiplicitiesof roots of these equations. The multiplicities of the roots are sometimes ignored in order to speed up the process of estimating their location, however, they must be taken into account during the management of the kinetic data structures. Some of the roots obtained by the computations of these equations do not necessarily carry the expected information (i.e., the times of future kinetic events) and they may be therefore avoided entirely during the computation. This text shows how to distinguish theseroots before their exact location is computed and thus to avoid their computation.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
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
ADVCOMP 2011
ISBN
978-1-61208-172-4
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
32-35
Publisher name
IARIA
Place of publication
Lisabon
Event location
Lisbon, Portugal
Event date
Nov 20, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—